Multiple Instance Learning for Sparse Positive Bags
Abstract
We present a new approach to multiple instance learning (MIL) that is particularly effective when the positive bags are sparse (i.e. contain few positive instances). Unlike other SVM-based MIL methods, our approach more directly enforces the desired constraint that at least one of the instances in a positive bag is positive. Using both artificial and real-world data, we experimentally demonstrate that our approach achieves greater accuracy than state-of-the-art MIL methods when positive bags are sparse, and performs competitively when they are not. In particular, our approach is the best performing method for image region classification.
Cite
Text
Bunescu and Mooney. "Multiple Instance Learning for Sparse Positive Bags." International Conference on Machine Learning, 2007. doi:10.1145/1273496.1273510Markdown
[Bunescu and Mooney. "Multiple Instance Learning for Sparse Positive Bags." International Conference on Machine Learning, 2007.](https://mlanthology.org/icml/2007/bunescu2007icml-multiple/) doi:10.1145/1273496.1273510BibTeX
@inproceedings{bunescu2007icml-multiple,
title = {{Multiple Instance Learning for Sparse Positive Bags}},
author = {Bunescu, Razvan C. and Mooney, Raymond J.},
booktitle = {International Conference on Machine Learning},
year = {2007},
pages = {105-112},
doi = {10.1145/1273496.1273510},
url = {https://mlanthology.org/icml/2007/bunescu2007icml-multiple/}
}