MILES: Multiple-Instance Learning via Embedded Instance Selection
Citations Over TimeTop 1% of 2006 papers
Abstract
Multiple-instance problems arise from the situations where training class labels are attached to sets of samples (named bags), instead of individual samples within each bag (called instances). Most previous multiple-instance learning (MIL) algorithms are developed based on the assumption that a bag is positive if and only if at least one of its instances is positive. Although the assumption works well in a drug activity prediction problem, it is rather restrictive for other applications, especially those in the computer vision area. We propose a learning method, MILES (Multiple-Instance Learning via Embedded instance Selection), which converts the multiple-instance learning problem to a standard supervised learning problem that does not impose the assumption relating instance labels to bag labels. MILES maps each bag into a feature space defined by the instances in the training bags via an instance similarity measure. This feature mapping often provides a large number of redundant or irrelevant features. Hence, 1-norm SVM is applied to select important features as well as construct classifiers simultaneously. We have performed extensive experiments. In comparison with other methods, MILES demonstrates competitive classification accuracy, high computation efficiency, and robustness to labeling uncertainty.
Related Papers
- → Classification using support vector machines with graded resolution(2005)31 cited
- → Smoothing Support Vector Machines for e-Insensitive Regressi(2006)2 cited
- On Multiclass Support Vector Machines: One-Against-Half Approach(2010)
- 재무예측을 위한 Support Vector Machine의 최적화(2011)
- [발표논문] 인공신경망과 Support Vector Machine의 기업부도예측 성과 비교-Support Vector Machine의 유용성을 중심으로-(2004)