The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Random Forests for Big Data
Open accessAbstract
Big Data is one of the major challenges of statistical science and has numerous consequences from algorithmic and theoretical viewpoints. Big Data always involve massive data but they also often include online data and data heterogeneity. Recently some statistical methods have been adapted to process Big Data, like linear regression models, clustering methods and bootstrapping schemes. Based on decision trees combined with aggregation and bootstrap ideas, random forests were introduced by Breiman in 2001. They are a powerful nonparametric statistical method allowing to consider in a single and versatile framework regression problems, as well as two-class and multi-class classification problems. Focusing on classification problems, this paper proposes a selective review of available proposals that deal with scaling random forests to Big Data problems. These proposals rely on parallel environments or on online adaptations of random forests. We also describe how related quantities -- such as out-of-bag error and variable importance -- are addressed in these methods. Then, we formulate various remarks for random forests in the Big Data context. Finally, we experiment five variants on two massive datasets (15 and 120 millions of observations), a simulated one as well as real world data. One variant relies on subsampling while three others are related to parallel implementations of random forests and involve either various adaptations of bootstrap to Big Data or to "divide-and-conquer" approaches. The fifth variant relates on online learning of random forests. These numerical experiments lead to highlight the relative performance of the different variants, as well as some of their limitations.
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
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
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
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
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
Classification and Regression by randomForest
Liaw, A. I., & Wiener, M. C. (2007) · Cited by 18,594
Geurts, P., Ernst, D., & Wehenkel, L. (2006) · Machine Learning · doi:10.1007/s10994-006-6226-1 · Cited by 9,300
Variable selection using random forests
Genuer, R., Poggi, J.-M., & Tuleau-Malot, C. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.03.014 · Cited by 2,619
Self-citationChallenges of Big Data analysis
Fan, J., Han, F., & Liu, H. (2014) · National Science Review · doi:10.1093/nsr/nwt032 · Cited by 1,482
Map-Reduce for Machine Learning on Multicore
Chu, C.-T., Kim, S. K., Lin, Y.-A., Yu, Y., Bradski, G., Ng, A. Y., & Olukotun, K. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0040 · Cited by 1,229
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
Scornet, E., Biau, G., & Vert, J.-P. (2015) · The Annals of Statistics · doi:10.1214/15-aos1321 · Cited by 612
Oza, N. C. (2006) · 2005 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2005.1571498 · Cited by 569
Mining Frequent Patterns in Data Streams at Multiple Time Granularities
Giannella, C. R., Han, J., Yan, X., & Yu, P. S. (2002) · Cited by 497
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
Fast approximate spectral clustering
Yan, D., Huang, L., & Jordan, M. I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557118 · Cited by 474
Consistency of Random Forests and Other Averaging Classifiers
Gérard Biau, A., Devroye, L., & Lugosi, G. (2008) · Cited by 457
Resampling Fewer Than n Observations: Gains, Losses, and Remedies for Losses
Bickel, P. J., Götze, F., & van Zwet, W. R. (2012) · Selected Works of Willem van Zwet · doi:10.1007/978-1-4614-1314-1_17 · Cited by 432
Data warehousing and analytics infrastructure at facebook
Thusoo, A., Shao, Z., Anthony, S., Borthakur, D., Jain, N., Sen Sarma, J., Murthy, R., & Liu, H. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807278 · Cited by 425
An analysis of diversity measures
Tang, E. K., Suganthan, P. N., & Yao, X. (2006) · Machine Learning · doi:10.1007/s10994-006-9449-2 · Cited by 404
A Scalable Bootstrap for Massive Data
Kleiner, A., Talwalkar, A., Sarkar, P., & Jordan, M. I. (2014) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12050 · Cited by 389
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
Mining data with random forests: current options for real‐world applications
Ziegler, A., & König, I. R. (2014) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1114 · Cited by 288
Computational and statistical tradeoffs via convex relaxation
Chandrasekaran, V., & Jordan, M. I. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1302293110 · Cited by 179
Scalable Strategies for Computing with Massive Data
Kane, M. J., Emerson, J. W., & Weston, S. (2013) · Journal of Statistical Software · doi:10.18637/jss.v055.i14 · Cited by 149
A weighted random forests approach to improve predictive performance
Winham, S. J., Freimuth, R. R., & Biernacka, J. M. (2013) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11196 · Cited by 104
On statistics, computation and scalability
Jordan, M. I. (2013) · Bernoulli · doi:10.3150/12-bejsp17 · Cited by 104
Scalable Simple Random Sampling and Stratified Sampling
Meng, X. (2013) · Cited by 91
Consistency of Online Random ForestsPreprint
Denil, M., Matheson, D., & de Freitas, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4853 · Cited by 59
Data Stream Management: Processing High-Speed Data Streams (Data-Centric Systems and Applications)
Garofalakis, M., Gehrke, J. E., & Rastogi, R. R. (2007) · Springer eBooks · Cited by 53
Analysis of purely random forests biasPreprint
Arlot, S., & Genuer, R. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.3939 · Cited by 51
Self-citationClassifying Evolving Data Streams Using Dynamic Streaming Random Forests
Abdulsalam, H. M., Skillicorn, D. B., & Martin, P. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85654-2_54 · Cited by 37
A Survey of Statistical Methods and Computing for Big DataPreprint
Wang, C., Chen, M., Schifano, E. D., Wu, J., & Yan, J. (2015) · arXiv (Cornell University) · Cited by 15
Cited by
Tyralis, H., Papacharalampous, G., & Langousis, A. (2019) · Water · doi:10.3390/w11050910 · Cited by 771
Real-time big data processing for anomaly detection: A survey
Ariyaluran Habeeb, R. A., Nasaruddin, F., Gani, A., Targio Hashem, I. A., Ahmed, E., & Imran, M. (2019) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2018.08.006 · Cited by 487
A survey of data partitioning and sampling methods to support big data analysis
Mahmud, M. S., Huang, J. Z., Salloum, S., Emara, T. Z., & Sadatdiynov, K. (2020) · Big Data Mining and Analytics · doi:10.26599/bdma.2019.9020015 · Cited by 282
The state of the art and taxonomy of big data analytics: view from new big data framework
Mohamed, A., Najafabadi, M. K., Wah, Y. B., Zaman, E. A. K., & Maskat, R. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09685-9 · Cited by 265
Deo, R. C., Yaseen, Z. M., Al-Ansari, N., Nguyen-Huy, T., Langlands, T. A. M., & Galligan, L. (2020) · IEEE Access · doi:10.1109/access.2020.3010938 · Cited by 89
Metadata
- Authors
- Genuer, R., Poggi, J.-M., Tuleau-Malot, C., & Villa-Vialaneix, N.
- Venue
- Big Data Research
- Publisher
- Elsevier BV
- Published
- 2017-09
- Volume
- 9
- Pages
- 28-46
- ISSN
- 2214-5796 (ISSN-L)
- OpenAlex
- W2174668940
- Cited by
- 367
- References
- 33
- FWCI
- 21.67
- Type
- journal article
- Language
- en
- Open access
- green
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.