Article thumbnail
Location of Repository

Solving Multiple-Instance Problem: A Lazy Learning Approach

By Jun Wang and Jean-Daniel Zucker

Abstract

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 multiple-instance problem. We present two variants of the K-nearest neighbor algorithm, called Bayesian-KNN and Citation-KNN, solving the multiple-instance 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

Topics: Artificial Intelligence, Machine Learning
Publisher: Morgan Kaufmann
Year: 2000
OAI identifier: oai:cogprints.org:2124

Suggested articles

Citations

  1. (1994). A comparison of dynamic reposing and tangent distance for drug activity prediction.
  2. (1998). A framework for multiple-instance learning.
  3. (1998). A note on learning from multiple-instance examples.
  4. (1998). Attribute-value learning versus inductive logic programming: The missing links.
  5. (1979). Citation indexing: Its theory and application in science, technology, and humanities.
  6. (1997). Lazy Learning.
  7. (1998). Learning from ambiguity. Doctoral dissertation,
  8. (2000). Learning single and multiple instance decision tree for computer security applications.
  9. (1992). Local learning algorithms.
  10. (1991). Machine learning: An integrated framework and its application.
  11. (1995). Measure, topology, and fractal geometry (3rd print).
  12. (1998). Multicriteria filtering methods based on concordance and non-discordance principles.
  13. (1998). Multiple-instance learning for natural scene classification.
  14. (1991). Nearest neighbor norms: NN pattern classification techniques.
  15. (1997). On learning from multi-instance examples: Empirical evaluation of a theoretical approach.
  16. (1996). PAC-learning axis aligned rectangles with respect to product distributions from multiple-instance examples.
  17. (1997). Solving the multiple-instance problem with axis-parallel rectangles.
  18. (1995). The nature of statistical learning theory. doi
  19. (1998). Top-down induction of first order logical decision trees.
  20. (1997). Tractable induction and classification in first order logic via stochastic matching.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.