The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
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. 1.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Solving the multiple instance problem with axis-parallel rectangles
Dietterich, T. G., Lathrop, R. H., & Lozano-Pérez, T. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(96)00034-3 · Cited by 2,866 · cited 6×
“A variety of MIL algorithms have been developed over the past ten years (Dietterich et al., 1997; Gartner et al., 2002; Andrews et al., 2003); however, the sim- Appearing in Proceedings of the 24 th International Conference on Machine Learning, Corvallis, OR, 2007.”
MethodInfluentialYuille, A. L., & Rangarajan, A. (2003) · Neural Computation · doi:10.1162/08997660360581958 · Cited by 1,151
Cited by
Multiple instance learning: A survey of problem characteristics and applications
Carbonneau, M.-A., Cheplygina, V., Granger, E., & Gagnon, G. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.10.009 · Cited by 740
“For example, the scenario where the number of positive instances in a bag is low was referred to as either sparse bags [26, 27] or low witness rate [24, 28].”
BackgroundMethodMultiple instance classification: Review, taxonomy and comparative study
Amores, J. (2013) · Artificial Intelligence · doi:10.1016/j.artint.2013.06.003 · Cited by 557
From Group to Individual Labels Using Deep Features
Kotzias, D., Denil, M., de Freitas, N., & Smyth, P. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783380 · Cited by 312
Robust multiple-instance learning ensembles using random subspace instance selection
Carbonneau, M.-A., Granger, E., Raymond, A. J., & Gagnon, G. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2016.03.035 · Cited by 60
Metadata
- Authors
- Bunescu, R. C., & Mooney, R. J.
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 105-112
- OpenAlex
- W2106848050
- Cited by
- 184
- References
- 2
- FWCI
- 4.65
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.