The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Overview
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.
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
(1979) · Cited by 43,841
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
(1992) · Cited by 23,431
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Classification 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
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Fayyad, U. M., & Irani, K. B. (1993) · International Joint Conference on Artificial Intelligence · Cited by 2,870
Machine Learning, Neural and Statistical Classification
Fulkerson, B. (1995) · Technometrics · doi:10.1080/00401706.1995.10484383 · Cited by 2,209
Supervised and Unsupervised Discretization of Continuous Features
Dougherty, J., Kohavi, R., & Sahami, M. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50032-3 · Cited by 1,936
Stochastic Complexity in Statistical Inquiry
Rissanen, J. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/0822 · Cited by 1,539
Database mining: a performance perspective
Agrawal, R., Imielinski, T., & Swami, A. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250074 · Cited by 1,505
SPLIT SELECTION METHODS FOR CLASSIFICATION TREES
Loh, W., & Shih, Y. (1997) · Cited by 977
Bayesian classification (AutoClass): theory and results
Cheeseman, P. C., & Stutz, J. (1996) · Cited by 975
Constructing optimal binary decision trees is NP-complete
Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Ibarra, O. H., & Kim, C. E. (1975) · Journal of the ACM · doi:10.1145/321906.321909 · Cited by 959
Chi2: feature selection and discretization of numeric attributes
Liu, H., & Setiono, R. (2002) · Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/tai.1995.479783 · Cited by 933
Weiss, S. M., & Kulikowski, C. A. (1991) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 898
Induction of decision trees. Machine Learning
Quinlan, J. R. (1986) · Symposium on the Theory of Computing · Cited by 809
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
SLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
Kohavi, R. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-59286-5_57 · Cited by 712
ChiMerge: discretization of numeric attributes
Kerber, R. (1992) · National Conference on Artificial Intelligence · Cited by 657
Construction and Assessment of Classification Rules
Wade, M. R., & Hand, D. J. (1999) · Technometrics · doi:10.2307/1270579 · Cited by 621
AutoClass: A Bayesian Classification System
CHEESEMAN, P., KELLY, J., SELF, M., STUTZ, J., TAYLOR, W., & FREEMAN, D. (1988) · Machine Learning Proceedings 1988 · doi:10.1016/b978-0-934613-64-4.50011-6 · Cited by 498
On changing continuous attributes into ordered discrete attributes
Catlett, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017012 · Cited by 426
Log-Linear Models and Logistic Regression
(1997) · Springer Texts in Statistics · doi:10.1007/b97647 · Cited by 390
Liu, H. (1996) · ACM SIGART Bulletin · doi:10.1145/230062.1066049 · Cited by 369
A Recursive Partitioning Decision Rule for Nonparametric Classification
Friedman (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674849 · Cited by 368
Approximate Algorithms for the 0/1 Knapsack Problem
Sahni, S. (1975) · Journal of the ACM · doi:10.1145/321864.321873 · Cited by 349
Symbolic and neural learning algorithms: An experimental comparison
Shavlik, J. W., Mooney, R. J., & Towell, G. G. (1991) · Machine Learning · doi:10.1007/bf00114160 · Cited by 327
Tree-Structured Classification via Generalized Discriminant Analysis
Loh, W.-Y., & Vanichsetakul, N. (1988) · Journal of the American Statistical Association · doi:10.1080/01621459.1988.10478652 · Cited by 320
(2012) · SpringerReference · doi:10.1007/springerreference_178824 · Cited by 316
An Interval Classifier for Database Mining Applications
Agrawal, R., Ghosh, S. P., Imieliński, T., Iyer, B. R., & Swami, A. (1992) · Cited by 264
The data warehouse and data mining
Inmon, W. H. (1996) · Communications of the ACM · doi:10.1145/240455.240470 · Cited by 260
Brachman, R. J., Khabaza, T., Kloesgen, W., Piatetsky-Shapiro, G., & Simoudis, E. (1996) · Communications of the ACM · doi:10.1145/240455.240468 · Cited by 231
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Rastogi, R., & Shim, K. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009887311454 · Cited by 216
MDL-based decision tree pruning
Mehta, M., Rissanen, J., & Agrawal, R. (1995) · Cited by 187
Neural Networks, Decision Tree Induction and Discriminant Analysis: an Empirical Comparison
Curram, S. P., & Mingers, J. (1994) · Journal of the Operational Research Society · doi:10.1057/jors.1994.62 · Cited by 172
Megainduction : machine learning on very large databases
Catlett, J. (1991) · Medical Entomology and Zoology · Cited by 169
Experiments on multistrategy learning by meta-learning
Chan, P. K., & Stolfo, S. J. (1993) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/170088.170160 · Cited by 150
Fayyad, U. M., Haussler, D. H., & Stolorz, P. (1996) · Communications of the ACM · doi:10.1145/240455.240471 · Cited by 144
On growing better decision trees from data
Salzberg, S. L., & Murthy, K. V. S. (1996) · Cited by 112
Brown, D. E., Corruble, V., & Pittard, C. L. (1993) · Pattern Recognition · doi:10.1016/0031-3203(93)90060-a · Cited by 97
Construction and assessment of classification rules
Hand, D. J. (1997) · International Linear Collider · Cited by 87
Designing storage efficient decision trees
Murphy, O. J., & McCraw, R. L. (1991) · IEEE Transactions on Computers · doi:10.1109/12.76408 · Cited by 41
Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules
Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1996) · Cited by 35
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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
Machine learning: a review of classification and combining techniques
Kotsiantis, S. B., Zaharakis, I. D., & Pintelas, P. E. (2006) · Artificial Intelligence Review · doi:10.1007/s10462-007-9052-3 · Cited by 1,582
Decision trees: a recent overview
Kotsiantis, S. B. (2013) · Artificial Intelligence Review · doi:10.1007/s10462-011-9272-4 · Cited by 1,568
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
Metadata
- Authors
- Gehrke, J., Ramakrishnan, R., & Ganti, V.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2000-07
- Volume
- 4
- Issue
- 2-3
- Pages
- 127-162
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W1637435380
- Cited by
- 348
- References
- 52
- FWCI
- 50.07
- Type
- journal article
- 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
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.