The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
On Oblique Random Forests
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 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
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
'Gene shaving' as a method for identifying distinct sets of genes with similar expression patterns
Hastie, T., Tibshirani, R., Eisen, M. B., Alizadeh, A., Levy, R., Staudt, L., Chan, W. C., Botstein, D., & Brown, P. (2000) · Genome Biology · doi:10.1186/gb-2000-1-2-research0003 · Cited by 547 · cited 1×
“We also compare both random forest scores with a t-test measuring class separation individually at every feature – similar to, for example, fMRI experiments, microarray, or tests on spectra [15].”
MethodRandom Forests and Adaptive Nearest Neighbors
Lin, Y., & Jeon, Y. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000001230 · Cited by 507
Tu, Z. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.194 · Cited by 397
Cited by
Biau, G., & Scornet, E. (2016) · Test · doi:10.1007/s11749-016-0481-7 · Cited by 4,149
Criminisi, A., Shotton, J., & Konukoglu, E. (2012) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000035 · Cited by 677
Mapping patterns of long-term settlement in Northern Mesopotamia at a large scale
Menze, B. H., & Ur, J. A. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1115472109 · Cited by 139
Self-citationDetecting Lithium (Li) Mineralizations from Space: Current Research and Future Perspectives
Cardoso-Fernandes, J., Teodoro, A. C., Lima, A., Perrotta, M., & Roda-Robles, E. (2020) · Applied Sciences · doi:10.3390/app10051785 · Cited by 71
Metadata
- Authors
- Menze, B. H., Kelm, B. M., Splitthoff, D. N., Koethe, U., & Hamprecht, F. A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 453-469
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W13188192
- Cited by
- 212
- References
- 5
- FWCI
- 32.07
- 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: On Oblique Random Forests. https://app.cochat.ai/papers/10.1007/978-3-642-23783-6_29
- The paper
- Menze, B. H., Kelm, B. M., Splitthoff, D. N., Koethe, U., & Hamprecht, F. A. (2011). On Oblique Random Forests. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-23783-6_29
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.
