A Two-Level Learning Method for Generalized Multi-instance Problems

Lecture notes in computer sciencePublished 1 January 2003

Nils B. Weidmann, Eibe Frank, Bernhard Pfahringer

DOI10.1007/978-3-540-39857-8_42

Source URL

Citations162

SJR quartileQ2

SJR score0.35

SNIP0.55

TL;DR

This paper investigates a generalized view of the MI problem where an "interaction" between instances in a bag determines the class label, and transforms an MI bag into a single meta-instance that can be learned by a standard propositional method.

Abstract

In traditional multi-instance (MI) learning, a single positive instance in a bag produces a positive class label. Hence, the learner knows how the bags class label depends on the labels of the instances in the bag and can explicitly use this information to solve the learning task. In this paper we investigate a generalized view of the MI problem where this simple assumption no longer holds. We assume that an interaction between instances in a bag determines the class label. Our two-level learning method for this type of problem transforms an MI bag into a single meta-instance that can be learned by a standard propositional method. The meta-instance indicates which regions in the instance space are covered by instances of the bag. Results on both artificial and real-world data show that this two-level classification approach is well suited for generalized MI problems.

Keywords

Computer Science

C4.5: Programs for Machine Learning

23,665 Citations1992J. R. Quinlan

A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.

NeurocomputingAdvances in neural information processing systems 7

22,300 Citations1997Krzysztof J. Cios, Mark E. Shields

Artificial IntelligenceWrappers for feature subset selection

8,925 Citations1997Ron Kohavi, George H. John

The wrapper method searches for an optimal feature subset tailored to a particular algorithm and a domain and compares the wrapper approach to induction without feature subset selection and to Relief, a filter approach tofeature subset selection.

The Annals of StatisticsAdditive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)

6,842 Citations2000Jerome H. Friedman, Trevor Hastie +1 more

This work shows that this seemingly mysterious phenomenon of boosting can be understood in terms of well-known statistical principles, namely additive modeling and maximum likelihood, and develops more direct approximations and shows that they exhibit nearly identical results to boosting.

View PDF

Programs for Machine Learning

5,794 Citations1994Steven L. Salzberg, Alberto M. Segre

In his new book, C4.5: Programs for Machine Learning, Quinlan has put together a definitive, much needed description of his complete system, including the latest developments, which will be a welcome addition to the library of many researchers and students.

Artificial IntelligenceSolving the multiple instance problem with axis-parallel rectangles

2,886 Citations1997Thomas G. Dietterich, Richard H. Lathrop +1 more

Three kinds of algorithms that learn axis-parallel rectangles to solve the multiple instance problem are described and compared, giving 89% correct predictions on a musk odor prediction task.

A Framework for Multiple-Instance Learning

1,183 Citations1997Oded Maron, Tomás Lozano‐Pérez

A new general framework, called Diverse Density, is described, which is applied to learn a simple description of a person from a series of images containing that person, to a stock selection problem, and to the drug activity prediction problem.

Multi-Instance Kernels

468 Citations2002Thomas Gärtner, Peter Flach +2 more

A kernel on multi-instance data that can be shown to separate positive and negative sets under natural assumptions is shown and compares favorably with state of the art multi- instance learning algorithms in an empirical study.

International Conference on Machine LearningMulti instance neural networks

157 Citations2000Jan Ramon, Luc De Raedt

View PDF

Lecture notes in computer scienceSolving Multiple-Instance and Multiple-Part Learning Problems with Decision Trees and Rule Sets. Application to the Mutagenesis Problem

133 Citations2001Yann Chevaleyre, Jean‐Daniel Zucker

This paper analyzes and tries to clarify multiple-problem solving, and goes on to propose multiple-instance extensions of classical learning algorithms to solve multiple-problems by learning multiple-decision trees (ID3-MI and multiple-Decision rules (RIPPERMI).