The DOI matches its Crossref record; 37 of the 38 references it cites were found in a registry or an index.
Solving the multiple instance problem with axis-parallel rectangles
Open accessOverview
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Multi-instance learning is a group of supervised learning algorithms that has seen widespread application in WSOD [202-209].”
From Object Detection in 20 Years: A Survey (2023) · cites this paper as [202]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Theorem 3 states that modern Hopfield networks possess an exponential storage capacity which enables to tackle massive multiple instance learning (MIL) problems (Dietterich et al., 1997).”
From Hopfield Networks is All You Need (2020) · cites this paper as Dietterich et al., 1997
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Theorem 3 states that modern Hopfield networks possess an exponential storage capacity which enables to tackle massive multiple instance learning (MIL) problems (Dietterich et al., 1997).”
From Hopfield Networks is All You Need (2020) · cites this paper as Dietterich et al., 1997
Experimental — accuracy not yet measured
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
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
A new force field for molecular mechanical simulation of nucleic acids and proteins
Weiner, S. J., Kollman, P. A., Case, D. A., Singh, U. C., Ghio, C., Alagona, G., Profeta, S., & Weiner, P. (1984) · Journal of the American Chemical Society · doi:10.1021/ja00315a051 · Cited by 4,639
Cramer, R. D., Patterson, D. E., & Bunce, J. D. (1988) · Journal of the American Chemical Society · doi:10.1021/ja00226a005 · Cited by 3,931
An all atom force field for simulations of proteins and nucleic acids
Weiner, S. J., Kollman, P. A., Nguyen, D. T., & Case, D. A. (1986) · Journal of Computational Chemistry · doi:10.1002/jcc.540070216 · Cited by 3,437 · cited 1×
“Hence, additional steps were taken to ensure that the artificial data was consistent with fakeAPR.”
ResultSubstituent constants for correlation analysis in chemistry and biology
Hansch, C. H., & Leo, A. J. (1979) · Medical Entomology and Zoology · Cited by 2,903
Solvent-Accessible Surfaces of Proteins and Nucleic Acids
Connolly, M. L. (1983) · Science · doi:10.1126/science.6879170 · Cited by 2,745
p-σ-π Analysis. A Method for the Correlation of Biological Activity and Chemical Structure
Hansch, C., & Fujita, T. (1964) · Journal of the American Chemical Society · doi:10.1021/ja01062a035 · Cited by 2,313
Friedman, J. H., & Stuetzle, W. (1981) · Journal of the American Statistical Association · doi:10.1080/01621459.1981.10477729 · Cited by 2,216
An internal-coordinate Monte Carlo method for searching conformational space
Chang, G., Guida, W. C., & Still, W. C. (1989) · Journal of the American Chemical Society · doi:10.1021/ja00194a035 · Cited by 1,091
Structure-Based Strategies for Drug Design and Discovery
Kuntz, I. D. (1992) · Science · doi:10.1126/science.257.5073.1078 · Cited by 989
Research works printed but not linked: 2
- Bersuker, 1991, New J. Chem., 15, 307
- Soderlund, 1994, GRAM and nfragII: simulating and solving the single-digest partial restriction map problem, Comput. Appl. Biosci., 10, 349
Cited by
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750
(2009) · Minds at UW (University of Wisconsin) · Cited by 4,791
Object Detection in 20 Years: A Survey
Zou, Z., Chen, K., Shi, Z., Guo, Y., & Ye, J. (2023) · Proceedings of the IEEE · doi:10.1109/jproc.2023.3238524 · Cited by 3,689
A Review on Multi-Label Learning Algorithms
Zhang, M.-L., & Zhou, Z.-H. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.39 · Cited by 3,321
“There are several learning settings related to multi-label learning which are worth some discussion, such as multi-instance learning [25], ordinal classification [29], multi-task learning [10], and data streams classification [31].”
Background
Metadata
- Authors
- Dietterich, T. G., Lathrop, R. H., & Lozano-Pérez, T.
- Affiliations
- Oregon State University (US)
- University of California, Irvine (US)
- Corresponding author
- Dietterich, Thomas G.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1997-01
- Volume
- 89
- Issue
- 1-2
- Pages
- 31-71
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2110119381
- Cited by
- 2,866
- References
- 38
- Citations by year
- 2026: 108 · 2025: 113 · 2024: 140 · 2023: 168 · 2022: 174 · 2021: 169 · 2020: 195 · 2019: 164 · 2018: 156 · 2017: 168 · 2016: 139 · 2015: 129 · 2014: 125 · 2013: 138 · 2012: 118
- FWCI
- 19.40
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 6049 d)
- Locations
- Artificial Intelligence (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Keywords
- axis-parallel rectangles, axis-aligned rectangles, classifier comparison
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: Solving the multiple instance problem with axis-parallel rectangles. https://app.cochat.ai/papers/10.1016/s0004-3702(96)00034-3
- The paper
- Dietterich, T. G., Lathrop, R. H., & Lozano-Pérez, T. (1997). Solving the multiple instance problem with axis-parallel rectangles. Artificial Intelligence. https://doi.org/10.1016/s0004-3702(96)00034-3
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.