The DOI matches its Crossref record; 110 of the 110 references it cites were found in a registry or an index.
Decision forest: Twenty years of research
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
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
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
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
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227
David, F. N., & Tukey, J. W. (1977) · Biometrics · doi:10.2307/2529486 · Cited by 12,708
Proceedings of the 24th international conference on Machine learning
(2007) · doi:10.1145/1273496 · Cited by 11,630
Geurts, P., Ernst, D., & Wehenkel, L. (2006) · Machine Learning · doi:10.1007/s10994-006-6226-1 · Cited by 9,300
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
The Handbook of brain theory and neural networks
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4484 · Cited by 3,870
Combining Pattern Classifiers: Methods and Algorithms
Bagui, S. C. (2005) · Technometrics · doi:10.1198/tech.2005.s320 · Cited by 3,202
Popular Ensemble Methods: An Empirical Study
Opitz, D., & Maclin, R. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.614 · Cited by 2,953
Dietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
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
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
Improved boosting algorithms using confidence-rated predictions
Schapire, R. E., & Singer, Y. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279960 · Cited by 2,547
Improved Boosting Algorithms Using Confidence-rated Predictions
Schapire, R. E., & Singer, Y. (1999) · Machine Learning · doi:10.1023/a:1007614523901 · Cited by 1,971
Ensembling neural networks: Many could be better than all
Zhou, Z.-H., Wu, J., & Tang, W. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00190-x · Cited by 1,964
Rotation Forest: A New Classifier Ensemble Method
Rodriguez, J. J., Kuncheva, L. I., & Alonso, C. J. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.211 · Cited by 1,893
Graph-based approach for airborne light detection and ranging segmentation
Vilariño, D. L., Cabaleiro, J. C., Martínez, J., Rivera, F. F., & Pena, T. F. (2017) · Journal of Applied Remote Sensing · doi:10.1117/1.jrs.11.015020 · Cited by 1,721
The Handbook of brain theory and neural networks
(2003) · Choice Reviews Online · doi:10.5860/choice.41-0300 · Cited by 1,524
Bulmer, M. (1978) · Sociology · doi:10.1177/003803857801200331 · Cited by 1,412
An Introduction to Recursive Partitioning Using the RPART Routines
Therneau, T. M., & Atkinson, E. J. (2015) · Cited by 1,006
A survey of multiple classifier systems as hybrid systems
Woźniak, M., Graña, M., & Corchado, E. (2014) · Information Fusion · doi:10.1016/j.inffus.2013.04.006 · Cited by 912
Ensemble selection from libraries of models
Caruana, R., Niculescu-Mizil, A., Crew, G., & Ksikes, A. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015432 · Cited by 861
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
An Efficient Boosting Algorithm for Combining Preferences
Freund, Y., Iyer, R. D., Schapire, R. E., & Singer, Y. (1998) · Cited by 806
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
Mining data with random forests: A survey and results of new tests
Verikas, A., Gelzinis, A., & Bacauskiene, M. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.08.011 · Cited by 719
Decision trees for hierarchical multi-label classification
Vens, C., Struyf, J., Schietgat, L., Džeroski, S., & Blockeel, H. (2008) · Machine Learning · doi:10.1007/s10994-008-5077-3 · Cited by 644
A time series forest for classification and feature extraction
Deng, H., Runger, G., Tuv, E., & Vladimir, M. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.030 · Cited by 635
Decision Forests for Computer Vision and Medical Image Analysis
(2013) · Advances in Computer Vision and Pattern Recognition · doi:10.1007/978-1-4471-4929-3 · Cited by 595
Clark, L. A., & Pregibon, D. (2017) · Statistical Models in S · doi:10.1201/9780203738535-9 · Cited by 560
Margineantu, D. D., & Dietterich, T. G. (1997) · Cited by 553
The Need for Biases in Learning Generalizations
Mitchell, T. M. (2007) · Cited by 514
Attribute bagging: improving accuracy of classifier ensembles by using random feature subsets
Bryll, R., Gutierrez-Osuna, R., & Quek, F. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00121-8 · Cited by 481
Saffari, A., Leistner, C., Santner, J., Godec, M., & Bischof, H. (2009) · 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops · doi:10.1109/iccvw.2009.5457447 · Cited by 481
The Impact of Diversity on Online Ensemble Learning in the Presence of Concept Drift
Minku, L. L., White, A. P., & Yao, X. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.156 · Cited by 440
DDD: A New Ensemble Approach for Dealing with Concept Drift
Minku, L. L., & Yao, X. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.58 · Cited by 431
Dynamic weighted majority: a new ensemble method for tracking concept drift
Kolter, J. Z., & Maloof, M. A. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250911 · Cited by 419
EUSBoost: Enhancing ensembles for highly imbalanced data-sets by evolutionary undersampling
Galar, M., Fernández, A., Barrenechea, E., & Herrera, F. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2013.05.006 · Cited by 419
Top-down induction of clustering trees
Blockeel, H., Raedt, L. D., & Ramon, J. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0011032 · Cited by 397
Boolean Feature Discovery in Empirical Learning
Pagallo, G., & Haussler, D. (1990) · Machine Learning · doi:10.1023/a:1022611825350 · Cited by 390
Game theory, on-line prediction and boosting
Freund, Y., & Schapire, R. E. (1996) · Proceedings of the ninth annual conference on Computational learning theory - COLT '96 · doi:10.1145/238061.238163 · Cited by 383
A Comparison of Decision Tree Ensemble Creation Techniques
Banfield, R. E., Hall, L. O., Bowyer, K. W., & Kegelmeyer, W. P. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.250609 · Cited by 383
A composite classifier system design: Concepts and methodology
Dasarathy, B. V., & Sheela, B. V. (1979) · Proceedings of the IEEE · doi:10.1109/proc.1979.11321 · Cited by 340
Managing Diversity in Regression Ensembles
Brown, G., Wyatt, J., & Peter Tiňo, B. (2005) · Research Explorer (The University of Manchester) · doi:10.5555/1046920.1194899 · Cited by 336
Actively Searching for an Effective Neural Network Ensemble
Opitz, D. W., & Shavlik, J. W. (1996) · Connection Science · doi:10.1080/095400996116802 · Cited by 331
On the use of MapReduce for imbalanced big data using Random Forest
del Río, S., López, V., Benítez, J. M., & Herrera, F. (2014) · Information Sciences · doi:10.1016/j.ins.2014.03.043 · Cited by 328
Stochastic gradient boosted distributed decision trees
Ye, J., Chow, J.-H., Chen, J., & Zheng, Z. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646301 · Cited by 324
An Analysis of Ensemble Pruning Techniques Based on Ordered Aggregation
Martinez-Munoz, G., Hernandez-Lobato, D., & Suarez, A. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.78 · Cited by 315
Classifier ensembles: Select real-world applications
Oza, N. C., & Tumer, K. (2008) · Information Fusion · doi:10.1016/j.inffus.2007.07.002 · Cited by 313
Randomized Clustering Forests for Image Classification
Moosmann, F., Nowak, E., & Jurie, F. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70822 · Cited by 287
Scaling up machine learning: parallel and distributed approaches
Bekkerman, R., Bilenko, M., & Langford, J. (2011) · Proceedings of the 17th ACM SIGKDD International Conference Tutorials · doi:10.1145/2107736.2107740 · Cited by 282
Randomizing Outputs to Increase Prediction Accuracy
Breiman, L. (2000) · Machine Learning · doi:10.1023/a:1007682208299 · Cited by 276
PLANET: massively parallel learning of tree ensembles with MapReduce
Panda, B., Herbach, J. S., Basu, S., & Bayardo, R. J. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687569 · Cited by 267
Ensemble Pruning Via Semi-definite Programming
Zhang, Y., Samuel Burer, A., & Street, W. N. (2006) · doi:10.5555/1248547.1248595 · Cited by 258
Learning Decision Trees for Unbalanced Data
Cieslak, D. A., & Chawla, N. V. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-87479-9_34 · Cited by 244
Ensemble diversity measures and their application to thinning
Banfield, R. E., Hall, L. O., Bowyer, K. W., & Kegelmeyer, W. P. (2005) · Information Fusion · doi:10.1016/j.inffus.2004.04.005 · Cited by 221
Bou-Hamad, I., Larocque, D., & Ben-Ameur, H. (2011) · Statistics Surveys · doi:10.1214/09-ss047 · Cited by 203
Machine Learning Bias, Statistical Bias, and Statistical Variance of Decision Tree Algorithms
Dietterich, T. G., & Bae, E. H. (2008) · Cited by 197
RotBoost: A technique for combining Rotation Forest and AdaBoost
Zhang, C.-X., & Zhang, J.-S. (2008) · Pattern Recognition Letters · doi:10.1016/j.patrec.2008.03.006 · Cited by 165
Decision Tree Ensemble: Small Heterogeneous Is Better Than Large Homogeneous
Gashler, M., Giraud-Carrier, C. G., & Martinez, T. R. (2008) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2008.154 · Cited by 162
Désir, C., Bernard, S., Petitjean, C., & Heutte, L. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2013.05.022 · Cited by 157
A Comparative Evaluation of Voting and Meta-learning on Partitioned Data
Chan, P. K., & Stolfo, S. J. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50020-7 · Cited by 149
Decision trees for mining data streams
da Gama, J. M. P., Fernandes, R., & Rocha, R. (2006) · Intelligent Data Analysis · doi:10.3233/ida-2006-10103 · Cited by 144
Bernard, S., Adam, S., & Heutte, L. (2012) · Pattern Recognition Letters · doi:10.1016/j.patrec.2012.04.003 · Cited by 131
Selective Ensemble of Decision Trees
Zhou, Z., & Tang, W. (2007) · Springer eBooks · doi:10.1007/3-540-39205-x_81 · Cited by 128
Learning Ensembles from Bites: A Scalable and Accurate Approach
Chawla, N. V., Hall, L., Bowyer, K. W., & Kegelmeyer, W. P. (2004) · doi:10.5555/1005332.1005347 · Cited by 124
Genetic algorithm-based feature set partitioning for classification problems
Rokach, L. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.10.013 · Cited by 115
Self-citationAn ensemble uncertainty aware measure for directed hill climbing ensemble pruning
Partalas, I., Tsoumakas, G., & Vlahavas, I. P. (2010) · Machine Learning · doi:10.1007/s10994-010-5172-0 · Cited by 108
Search for the smallest random forest
Wang, M., & Zhang, H. (2009) · Statistics and Its Interface · doi:10.4310/sii.2009.v2.n3.a11 · Cited by 106
On the Boosting Pruning Problem
Tamon, C., & Xiang, J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45164-1_41 · Cited by 99
The impact of diversity on the accuracy of evidential classifier ensembles
Bi, Y. (2012) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2011.12.011 · Cited by 99
Scalable and Parallel Boosting with MapReduce
Palit, I., & Reddy, C. K. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.208 · Cited by 98
Troika – An improved stacking schema for classification tasks
Menahem, E., Rokach, L., & Elovici, Y. (2009) · Information Sciences · doi:10.1016/j.ins.2009.08.025 · Cited by 98
Self-citationEROS: Ensemble rough subspaces
Hu, Q., Yu, D., Xie, Z., & Li, X. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.04.022 · Cited by 97
Switching class labels to generate classification ensembles
Martínez-Muñoz, G., & Suárez, A. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.02.020 · Cited by 95
Lookahead and pathology in decision tree induction
Murthy, S. K., & Salzberg, S. L. (1995) · Cited by 91
On the link between error correlation and error reduction in decision tree ensembles
Ali, K., & Pazzani, M. J. (1995) · Cited by 73
Cost Complexity-Based Pruning of Ensemble Classifiers
Prodromidis, A. L., & Stolfo, S. J. (2001) · Knowledge and Information Systems · doi:10.1007/pl00011678 · Cited by 71
Random Projection Ensemble Classifiers
Schclar, A., & Rokach, L. (2009) · Lecture notes in business information processing · doi:10.1007/978-3-642-01347-8_26 · Cited by 58
Self-citationStatistical Instance-Based Pruning in Ensembles of Independent Classifiers
Hernández-Lobato, D., Martínez-Muñoz, G., & Suárez, A. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.204 · Cited by 57
Feature-subspace aggregating: ensembles for stable and unstable learners
Ting, K. M., Wells, J. R., Tan, S. C., et al. (2010) · Machine Learning · doi:10.1007/s10994-010-5224-5 · Cited by 52
Collective-agreement-based pruning of ensembles
Rokach, L. (2008) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2008.12.001 · Cited by 50
Self-citationLookahead-based algorithms for anytime induction of decision trees
Esmeir, S., & Markovitch, S. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015373 · Cited by 48
Parameter determination and feature selection for C4.5 algorithm using scatter search approach
Lin, S.-W., & Chen, S. (2011) · Soft Computing · doi:10.1007/s00500-011-0734-z · Cited by 46
Xia, F., Zhang, W., Li, F., & Yang, Y. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0118-y · Cited by 46
Semi-supervised learning for tree-structured ensembles of RBF networks with Co-Training
Hady, M. F. A., Schwenker, F., & Palm, G. (2009) · Neural Networks · doi:10.1016/j.neunet.2009.09.001 · Cited by 45
Li, P. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553455 · Cited by 39
SELECTIVE VOTING — GETTING MORE FOR LESS IN SENSOR FUSION
Rokach, L., Maimon, O., & Arbel, R. (2006) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001406004739 · Cited by 35
Self-citationData Mining by Attribute Decomposition with Semiconductor Manufacturing Case Study
Maimon, O., & Rokach, L. (2001) · Massive computing · doi:10.1007/978-1-4757-4911-3_13 · Cited by 33
Self-citationRandomized Inquiries About Shape: An Application to Handwritten Digit Recognition.
Amit, Y., & Geman, D. (1994) · Cited by 30
Derbeko, P., El‐Yaniv, R., & Meir, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36755-1_6 · Cited by 29
Decision forest for classification of gene expression data
Huang, J., Fang, H., & Fan, X. (2010) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2010.06.004 · Cited by 28
Large-Scale Learning to Rank Using Boosted Decision Trees
Svore, K. M., & Burges, C. J. C. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139042918.009 · Cited by 26
Attribute-Driven Hidden Markov Model Trees for Intention Prediction
Antwarg, L., Rokach, L., & Shapira, B. (2012) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/tsmcc.2012.2198212 · Cited by 24
Self-citationAn Empirical Comparison of Pruning Methods for Ensemble Classifiers
Windeatt, T., & Ardeshir, G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44816-0_21 · Cited by 21
Approximate Splitting for Ensembles of Trees using Histograms
Kamath, C., Cantú‐Paz, E., & Littau, D. (2002) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.22 · Cited by 20
Efficient prediction algorithms for binary decomposition techniques
Park, S.-H., & Fürnkranz, J. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-011-0219-9 · Cited by 20
Post-aggregation of classifier ensembles
Omari, A., & Figueiras-Vidal, A. R. (2015) · Information Fusion · doi:10.1016/j.inffus.2015.01.003 · Cited by 18
OCCT: A One-Class Clustering Tree for Implementing One-to-Many Data Linkage
Dror, M., Shabtai, A., Rokach, L., & Elovici, Y. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.23 · Cited by 10
Self-citation(1996)
(2014) · doi:10.5555/2627435.2697065
Cited by
Sagi, O., & Rokach, L. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1249 · Cited by 3,103
Self-citationA comparative analysis of gradient boosting algorithms
Bentéjac, C., Csörgő, A., & Martínez-Muñoz, G. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09896-5 · Cited by 2,998
SMOTE for Learning from Imbalanced Data: Progress and Challenges, Marking the 15-year Anniversary
Fernandez, A., Garcia, S., Herrera, F., & Chawla, N. V. (2018) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11192 · Cited by 2,219
A survey on missing data in machine learning
Emmanuel, T., Maupong, T., Mpoeleng, D., Semong, T., Mphago, B., & Tabona, O. (2021) · Journal of Big Data · doi:10.1186/s40537-021-00516-9 · Cited by 1,067
Longo, L., Brcic, M., Cabitza, F., Choi, J., Confalonieri, R., Ser, J. D., Guidotti, R., Hayashi, Y., Herrera, F., Holzinger, A., et al. (2024) · Information Fusion · doi:10.1016/j.inffus.2024.102301 · Cited by 626
Metadata
- Authors
- Rokach, L.
- Venue
- Information Fusion
- Publisher
- Elsevier BV
- Published
- 2016-01
- Volume
- 27
- Pages
- 111-125
- ISSN
- 1566-2535 (ISSN-L)
- OpenAlex
- W873782400
- Cited by
- 472
- References
- 110
- FWCI
- 63.97
- 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.