The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Multi-instance learning by treating instances as non-I.I.D. samples
Open accessAbstract
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely independent in real tasks, and a better performance can be expected if the instances are treated in an non-i.i.d. way that exploits relations among instances. In this paper, we propose two simple yet effective methods. In the first method, we explicitly map every bag to an undirected graph and design a graph kernel for distinguishing the positive and negative bags. In the second method, we implicitly construct graphs by deriving affinity matrices and propose an efficient graph kernel considering the clique information. The effectiveness of the proposed methods are validated by experiments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Visual categorization with bags of keypoints
Csurka, G. (2004) · Cited by 4,379
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
Support Vector Machines for Multiple-Instance Learning
Andrews, S. J., Tsochantaridis, I., & Hofmann, T. (2002) · Cited by 1,404
A Framework for Multiple-Instance Learning
Maron, O., & Lozano‐Pérez, T. (1997) · Cited by 1,232
Stanfill, C., & Waltz, D. (1986) · Communications of the ACM · doi:10.1145/7902.7906 · Cited by 1,218
Shortest-Path Kernels on Graphs
Borgwardt, K. M., & Kriegel, H. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.132 · Cited by 837
MILES: Multiple-Instance Learning via Embedded Instance Selection
Chen, Y., Bi, J., & Wang, J. Z. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.248 · Cited by 752
Multiple Instance Boosting for Object Detection
Zhang, C., Platt, J. C., & Viola, P. A. (2005) · neural information processing systems · Cited by 687
Image Categorization by Learning and Reasoning with Regions
Chen, Y., & Wang, J. Z. (2004) · doi:10.5555/1005332.1016789 · Cited by 621
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
“To deal with similar instances, miGraph [10] builds a graph per bag and groups similar instances together to adjust their relative importance based on the group size.”
BackgroundMethodInfluentialMultiple instance classification: Review, taxonomy and comparative study
Amores, J. (2013) · Artificial Intelligence · doi:10.1016/j.artint.2013.06.003 · Cited by 557
A survey on instance selection for active learning
Fu, Y., Zhu, X., & Li, B. (2013) · Knowledge and Information Systems · doi:10.1007/s10115-012-0507-8 · Cited by 364
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
Representation Learning of Histopathology Images using Graph Neural Networks
Adnan, M., Kalra, S., & Tizhoosh, H. R. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw50498.2020.00502 · Cited by 109
Metadata
- Authors
- Zhou, Z.-H., Sun, Y.-Y., & Li, Y.-F.
- Venue
- Proceedings of the 26th Annual International Conference on Machine Learning
- Publisher
- ACM
- Published
- 2009-06-14
- Pages
- 1249-1256
- OpenAlex
- W2133288557
- Cited by
- 396
- References
- 28
- FWCI
- 9.40
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multi-instance learning by treating instances as non-I.I.D. samples. https://app.cochat.ai/papers/10.1145/1553374.1553534
- The paper
- Zhou, Z.-H., Sun, Y.-Y., & Li, Y.-F. (2009). Multi-instance learning by treating instances as non-I.I.D. samples. Proceedings of the 26th Annual International Conference on Machine Learning. https://doi.org/10.1145/1553374.1553534
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.