- Title
- Building sparse support vector machines for multi-instance classification
- Creator
- Fu, Zhouyu; Lu, Guojun; Ting, Kaiming; Zhang, Dengsheng
- Date
- 2011
- Type
- Text; Conference paper
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/74324
- Identifier
- vital:7242
- Identifier
-
https://doi.org/10.1007/978-3-642-23780-5_40
- Identifier
- ISBN:9783642237799
- Abstract
- We propose a direct approach to learning sparse Support Vector Machine (SVM) prediction models for Multi-Instance (MI) classification. The proposed sparse SVM is based on a “label-mean” formulation of MI classification which takes the average of predictions of individual instances for bag-level prediction. This leads to a convex optimization problem, which is essential for the tractability of the optimization problem arising from the sparse SVM formulation we derived subsequently, as well as the validity of the optimization strategy we employed to solve it. Based on the “label-mean” formulation, we can build sparse SVM models for MI classification and explicitly control their sparsities by enforcing the maximum number of expansions allowed in the prediction function. An effective optimization strategy is adopted to solve the formulated sparse learning problem which involves the learning of both the classifier and the expansion vectors. Experimental results on benchmark data sets have demonstrated that the proposed approach is effective in building very sparse SVM models while achieving comparable performance to the state-of-the-art MI classifiers.
- Publisher
- Springer-Verlag
- Relation
- European Conference on Machine Learning Knowledge Discovery in Databases (ECML PKDD) p. 471-486
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0801 Artificial Intelligence and Image Processing
- Reviewed
- Hits: 891
- Visitors: 890
- Downloads: 2
| Thumbnail | File | Description | Size | Format |
|---|