Solving Multiple-Instance Problem: A Lazy Learning Approach
Jun Wang, et Jean-Daniel Zucker, Jean‐Daniel Zucker · CogPrints (University of Southampton) · 2000
As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances, given bags that are labeled by a teacher as being overall positive or negative. Current research mainly concentrates on adapting traditional concept learning to solve this problem. In this paper we investigate the use of lazy learning and Hausdorff distance to approach the multipleinstance problem. We present two variants of the K-nearest neighbor algorithm, called Bayesian-KNN and Citation-KNN, solving the multipleinstance problem. Experiments on the Drug discovery benchmark data show that both algorithms are competitive with the best ones conceived in the concept learning framework. Further work includes exploring of a combination of lazy and eager multiple-instance problem classifiers. 1.
Cited by 563 works. Open-access PDF
Authors
References
- The Nature of Statistical Learning Theory
- Solving the multiple instance problem with axis-parallel rectangles
- Nearest neighbor (NN) norms: NN pattern classification techniques
- Citation Indexing-Its Theory and Application in Science, Technology, and Humanities
- Local Learning Algorithms
- Multiple-Instance Learning for Natural Scene Classification
- A Framework for Multiple-Instance Learning
- Measure, topology, and fractal geometry
- Learning from ambiguity
- On Learning From Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach