Random Forests for Big Data

Big Data Research

Volumn 9, Issue , 2017, Pages 28-46

  Genuer, Robin ^a   Poggi, Jean Michel ^b   Tuleau Malot, Christine ^c   Villa Vialaneix, Nathalie ^d  

^a INSERM U657   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c UNIVERSITÉ CÔTE D'AZUR   (France)

^d UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

Bag of little bootstraps; Big Data; On line learning; Parallel computing; R; Random forest

Indexed keywords

DECISION TREES; E-LEARNING; REGRESSION ANALYSIS;

ALGORITHMICS; BAG OF LITTLE BOOTSTRAP; DATA HETEROGENEITY; LINEAR REGRESSION MODELLING; MASSIVE DATA; ONLINE DATA; ONLINE LEARNING; PARALLEL COM- PUTING; R; RANDOM FORESTS;

BIG DATA;

EID: 85028618822     PISSN: None     EISSN: 22145796     Source Type: Journal    
DOI: 10.1016/j.bdr.2017.07.003     Document Type: Article

References (50)

1. Fan, J., Han, F., Liu, H., Challenges of big data analysis. Nat. Sci. Rev. 1:2 (2014), 293–314, 10.1093/nsr/nwt032.
2. Hoerl, R., Snee, R., De Veaux, R., Applying statistical thinking to ‘Big Data’ problems. Wiley Interdiscip. Rev.: Comput. Stat. 6:4 (2014), 222–232, 10.1002/wics.1306.
3. Jordan, M., On statistics, computation and scalability. Bernoulli 19:4 (2013), 1378–1390, 10.3150/12-BEJSP17.
4. Thusoo, A., Shao, Z., Anthony, S., Borthakur, D., Jain, N., Sen Sarma, J., Murthy, R., Liu, H., Data warehousing and analytics infrastructure at Facebook. Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, 2010, 1013–1020.
5. Besse, P., Garivier, A., Loubes, J., Big data – Retour vers le futur 3. De statisticien à data scientist. arXiv preprint arXiv:1403.3758, 2014.
6. Yin, S., Kaynak, O., Big data for modern industry: challenges and trends. Proceedings of the IEEE, vol. 103, 2015, 143–146.
7. Kane, M., Emerson, J., Weston, S., Scalable strategies for computing with massive data. J. Stat. Softw., 55, 2013 http://www.jstatsoft.org/v55/i14.
8. R Core Team. R: A Language and Environment for Statistical Computing. 2016, R Foundation for Statistical Computing, Vienna, Austria http://www.R-project.org.
9. Besse, P., Villa-Vialaneix, N., Statistique et big data analytics. Volumétrie, l'attaque des clones. arXiv preprint arXiv:1405.6676, 2014.
10. Wang, C., Chen, M., Schifano, E., Wu, J., Yan, J., A survey of statistical methods and computing for big data. arXiv preprint arXiv:1502.07989, 2015.
11. Yan, D., Huang, L., Jordan, M., Fast approximate spectral clustering. Elder, J., Soulié-Fogelman, F., Flach, P., Zaki, M., (eds.) Proceedings of the 15th ACM SIGKDD international Conference on Knowledge Discovery and Data Mining, 2009, ACM, New York, NY, USA, 907–916, 10.1145/1557019.1557118.
12. Kleiner, A., Talwalkar, A., Sarkar, P., Jordan, M., A scalable bootstrap for massive data. J. R. Stat. Soc., Ser. B, Stat. Methodol. 76:4 (2014), 795–816.
13. Meng, X., Scalable simple random sampling and stratified sampling. Proceedings of the 30th International Conference on Machine Learning, ICML 2013 JMLR, vol. 28, 2013, W&CP, Georgia, USA.
14. Bǎdoiu, M., Har-Peled, S., Indyk, P., Approximate clustering via core-sets. Reif, J., (eds.) Proceedings of the 34th Annual ACM Symposium on Theory of Computing, no. 250–257, 2002, ACM, New York, NY, USA, 10.1145/509907.509947.
15. Laptev, N., Zeng, K., Zaniolo, C., Early accurate results for advanced analytics on MapReduce. Proceedings of the 28th International Conference on Very Large Data Bases, Istanbul, Turkey Proc. VLDB Endow., 5, 2012.
16. Chu, C., Kim, S., Lin, Y., Yu, Y., Bradski, G., Ng, A., Olukotun, K., Map-Reduce for machine learning on multicore. Lafferty, J., Williams, C., Shawe-Taylor, J., Zemel, R., Culotta, A., (eds.) Advances in Neural Information Processing Systems (NIPS 2010), Hyatt Regency, Vancouver, Canada, vol. 23, 2010, 281–288.
17. Chen, X., Xie, M., A split-and-conquer approach for analysis of extraordinarily large data. Stat. Sin. 24 (2014), 1655–1684.
18. Chandrasekaran, V., Jordan, M., Computational and statistical tradeoffs via convex relaxation. Proc. Natl. Acad. Sci. USA 13 (2013), E1181–E1190.
19. Laskov, P., Gehl, C., Krüger, S., Müller, K., Incremental support vector learning: analysis, implementation and application. J. Mach. Learn. Res. 7 (2006), 1909–1936.
20. Saffari, A., Leistner, C., Santner, J., Godec, M., Bischof, H., On-line random forests. Proceedings of IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops, 2009, IEEE, 1393–1400.
21. Breiman, L., Random forests. Mach. Learn. 45:1 (2001), 5–32 http://www.springerlink.com/content/u0p06167n6173512/fulltext.pdf.
22. Scornet, E., Biau, G., Vert, J., Consistency of random forests. Ann. Stat. 43:4 (2015), 1716–1741, 10.1214/15-AOS1321.
23. Verikas, A., Gelzinis, A., Bacauskiene, M., Mining data with random forests: a survey and results of new tests. Pattern Recognit. 44:2 (2011), 330–349, 10.1016/j.patcog.2010.08.011.
24. Ziegler, A., König, I., Mining data with random forests: current options for real-world applications. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 4:1 (2014), 55–63, 10.1002/widm.1114.
25. Bishop, C., Pattern Recognition and Machine Learning. 2006, Springer-Verlag, New York, NY, USA.
26. Hastie, T., Tibshirani, R., Friedman, J., The Elements of Statistical Learning. 2nd edition, 2009, Springer-Verlag, New York, NY, USA.
27. Breiman, L., Friedman, J., Olsen, R., Stone, C., Classification and Regression Trees. 1984, Chapman and Hall, New York, USA.
28. Genuer, R., Poggi, J., Tuleau-Malot, C., Variable selection using random forests. Pattern Recognit. Lett. 31:14 (2010), 2225–2236, 10.1016/j.patrec.2010.03.014.
29. Bickel, P., Götze, F., van Zwet, W., Resampling fewer than n observations: gains, losses and remedies for losses. Stat. Sin. 7:1 (1997), 1–31.
30. Bickel, P., Sakov, A., On the choice of m in the m out of n bootstrap and confidence bounds for extrema. Stat. Sin. 18:3 (2008), 967–985 http://www3.stat.sinica.edu.tw/statistica/J18N3/J18N38/J18N38.html.
31. del Rio, S., López, V., Benítez, J., Herrera, F., On the use of MapReduce for imbalanced big data using random forest. Inf. Sci. 285 (2014), 112–137, 10.1016/j.ins.2014.03.043.
32. Oza, N., Russel, S., Online bagging and boosting. Kaufmann, M., (eds.) Proceedings of Eighth International Workshop on Artificial Intelligence and Statistics, 2001, Key West, Florida, USA, 105–112.
33. Lee, H., Clyde, M., Online Bayesian bagging. J. Mach. Learn. Res. 5 (2004), 143–151.
34. Hanley, J., MacGibbon, B., Creating non-parametric bootstrap samples using Poisson frequencies. Comput. Methods Programs Biomed. 83 (2006), 57–62.
35. Geurts, P., Ernst, D., Wehenkel, L., Extremely randomized trees. Mach. Learn. 63:1 (2006), 3–42, 10.1007/s10994-006-6226-1.
36. Denil, M., Matheson, D., de Freitas, N., Consistency of online random forests. Proceedings of the 30th International Conference on Machine Learning, ICML 2013, 2013, 1256–1264.
37. Wickham, H., François, R., readr: Read Tabular Data. R package version 0.2.2 http://CRAN.R-project.org/package=readr, 2015.
38. Liaw, A., Wiener, M., Classification and regression by randomForest. R News 2:3 (2002), 18–22 http://CRAN.R-project.org/doc/Rnews.
39. Weston, J., Elisseff, A., Schoelkopf, B., Tipping, M., Use of the zero norm with linear model and kernel methods. J. Mach. Learn. Res. 3 (2003), 1439–1461.
40. Revolution Analytics, Weston, S., foreach: Foreach looping construct for R. R package version 1.4.2 http://CRAN.R-project.org/package=foreach, 2014.
41. Fawagreh, K., Gaber, M., Elyan, E., An outlier detection-based tree selection approach to extreme pruning of random forests. arXiv preprint arXiv:1503.05187, 2015.
42. Tang, E., Suganthan, P., Yao, X., An analysis of diversity measures. Mach. Learn. 65 (2006), 247–271.
43. Winham, S.J., Freimuth, R., Biernacka, J., A weighted random forests approach to improve predictive performance. Stat. Anal. Data Min. ASA Data Sci. J. 6:6 (2013), 496–505.
44. Freund, Y., Schapire, R., A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55:1 (1997), 119–139.
45. Cutler, A., Zhao, G., Pert-perfect random tree ensembles. Comput. Sci. Stat. 33 (2001), 490–497.
46. Biau, G., Devroye, L., Lugosi, G., Consistency of random forests and other averaging classifiers. J. Mach. Learn. Res. 9 (2008), 2015–2033.
47. Arlot, S., Genuer, R., Analysis of purely random forests bias. arXiv preprint arXiv:1407.3939, 2014.
48. Garofalakis, M., Gehrke, J., Rastogi, R., Data Stream Management: Processing High-Speed Data Streams, Data-Centric Systems and Applications. 2016, Springer-Verlag, Berlin, Heidelberg.
49. Giannella, C., Han, J., Pei, J., Yan, X., Yu, P., Mining frequent patterns in data streams at multiple time granularities. Kargupta, H., Joshi, A., Sivakumar, K., Yesha, Y., (eds.) Data Mining: Next Generation Challenges and Future Directions (Proceedings of the NSF Workshop on Next Generation Data Mining), 2004, AAAI Press/The MIT Press, Menlo Park, CA, USA, 191–212.
50. Abdulsalam, H., Skillicorn, D., Martin, P., Classification using streaming random forests. IEEE Trans. Knowl. Data Eng. 23:1 (2011), 22–36, 10.1109/TKDE.2010.36.