The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
New Machine Learning Algorithm: Random Forest
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
The random subspace method for constructing decision forests
Ho, T. K. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.709601 · Cited by 6,842
Ho, T. K. (2002) · Proceedings of 3rd International Conference on Document Analysis and Recognition · doi:10.1109/icdar.1995.598994 · Cited by 5,054
Dietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
Shape Quantization and Recognition with Randomized Trees
Amit, Y., & Geman, D. (1997) · Neural Computation · doi:10.1162/neco.1997.9.7.1545 · Cited by 1,275
Prediction Games and Arcing Algorithms
Breiman, L. (1999) · Neural Computation · doi:10.1162/089976699300016106 · Cited by 530
Breiman, L. (1996) · Cited by 322
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
Cited by
Ahmad, I., Basheri, M., Iqbal, M. J., & Rahim, A. (2018) · IEEE Access · doi:10.1109/access.2018.2841987 · Cited by 693
Lowe, M., Qin, R., & Mao, X. (2022) · Water · doi:10.3390/w14091384 · Cited by 354
Landslide Susceptibility Mapping Using Machine Learning: A Literature Survey
Ado, M., Amitab, K., Maji, A. K., Jasińska, E., Gono, R., Leonowicz, Z., & Jasiński, M. (2022) · Remote Sensing · doi:10.3390/rs14133029 · Cited by 254
Alabdulhafith, M., Saleh, H., Elmannai, H., Ali, Z. H., El-Sappagh, S., Hu, J.-W., & El-Rashidy, N. (2023) · IEEE Access · doi:10.1109/access.2023.3312343 · Cited by 27
Metadata
- Authors
- Liu, Y., Wang, Y., & Zhang, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 246-252
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1472067
- Cited by
- 639
- References
- 11
- FWCI
- 0.80
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: New Machine Learning Algorithm: Random Forest. https://app.cochat.ai/papers/10.1007/978-3-642-34062-8_32
- The paper
- Liu, Y., Wang, Y., & Zhang, J. (2012). New Machine Learning Algorithm: Random Forest. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-34062-8_32
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.