Support Vector Machines for Multiple-Instance Learning
Stuart J. Andrews, Ioannis Tsochantaridis, Thomas Hofmann · 2002
This paper presents two new formulations of multiple-instance learning as a maximum margin problem. The proposed extensions of the Support Vector Machine (SVM) learning approach lead to mixed integer quadratic programs that can be solved heuristically. Our generalization of SVMs makes a state-of-the-art classification technique, including non-linear classification via kernels, available to an area that up to now has been largely dominated by special purpose methods. We present experimental results on a pharmaceutical data set and on applications in automated image indexing and document categorization. 1
Cited by 1,325 works.
Authors
References
- Learning with Kernels
- Transductive Inference for Text Classification using Support Vector Machines
- Solving the multiple instance problem with axis-parallel rectangles
- Editorial: On Machine Learning
- Blobworld: A System for Region-Based Image Indexing and Retrieval
- Multiple-Instance Learning for Natural Scene Classification
- A Framework for Multiple-Instance Learning
- On Learning From Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach
- PAC learning axis-aligned rectangles with respect to product distributions from multiple-instance examples
- EM-DD: An Improved Multiple-Instance Learning Technique