The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Pasting Small Votes for Classification in Large Databases and On-Line
Open accessOverview
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Self-citationClassification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Self-citationA decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Self-citationThe Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
A desicion-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-59119-2_166 · Cited by 2,252
Machine Learning, Neural and Statistical Classification
Fulkerson, B. (1995) · Technometrics · doi:10.1080/00401706.1995.10484383 · Cited by 2,209
Quinlan, J. R. (1996) · National Conference on Artificial Intelligence · Cited by 1,262
Arcing classifier (with discussion and a rejoinder by the author)
Breiman, L. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691079 · Cited by 1,105
Self-citationIncremental Induction of Decision Trees
Utgoff, P. E. (1989) · Machine Learning · doi:10.1023/a:1022699900025 · Cited by 791
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
Liu, H. (1996) · ACM SIGART Bulletin · doi:10.1145/230062.1066049 · Cited by 369
A Survey of Methods for Scaling Up Inductive Algorithms
Provost, F., & Kolluri, V. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009876119989 · Cited by 277
The strength of weak learnability
Schapire, R. E. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63451 · Cited by 257
Drucker, H., & Cortes, C. (1995) · neural information processing systems · Cited by 229
An Efficient Method To Estimate Bagging's Generalization Error
Wolpert, D. H., & Macready, W. G. (1999) · Machine Learning · doi:10.1023/a:1007519102914 · Cited by 161
On the Accuracy of Meta-learning for Scalable Data Mining
Chan, P. K., & Stolfo, S. J. (1997) · Journal of Intelligent Information Systems · doi:10.1023/a:1008640732416 · Cited by 158
Scaling up: distributed machine learning with cooperation
Provost, F. J., & Hennessy, D. N. (1996) · Cited by 110
(1996)
Cited by
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
A survey on concept drift adaptation
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014) · ACM Computing Surveys · doi:10.1145/2523813 · Cited by 3,735
Ensemble based systems in decision making
Polikar, R. (2006) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2006.1688199 · Cited by 2,938
Galar, M., Fernandez, A., Barrenechea, E., Bustince, H., & Herrera, F. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2161285 · Cited by 2,794
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Metadata
- Authors
- Breiman, L.
- Venue
- Machine Learning
- Published
- 1999-07
- Volume
- 36
- Issue
- 1-2
- Pages
- 85-103
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1588100052
- Cited by
- 317
- References
- 19
- FWCI
- 6.92
- Type
- journal article
- Language
- en
- Open access
- bronze
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.