.png){kind=icon}
返回
Mining Big Data with Random Forests
.png){kind=icon}
PRE
AI
DOI：10.1007/s12559-018-9615-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the current big data era, naive implementations of well-known learning algorithms cannot efficiently and effectively deal with large datasets. Random forests (RFs) are a popular ensemble-based method for classification. RFs have been shown to be effective in many different real-world classification problems and are commonly considered one of the best learning algorithms in this context. In this paper, we develop an RF implementation called ReForeSt, which, unlike the currently available solutions, can distribute data on available machines in two different ways to optimize the computational and memory requirements of RF with arbitrarily large datasets ranging from millions of samples to millions of features. A recently proposed improved RF formulation called random rotation ensembles can be used in conjunction with model selection to automatically tune the RF hyperparameters. We perform an extensive experimental evaluation on a wide range of large datasets and several environments with different numbers of machines and numbers of cores per machine. Results demonstrate that ReForeSt, in comparison to other state-of-the-art alternatives such as MLlib, is less computationally intensive, more memory efficient, and more effective.
Keyword:
Random forest
Random rotation ensembles
Model selection
Big data
Apache Spark
Memory efficiency
Computational efficiency
Open source software
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
1.6K
被引数:
3.6K
机构
引用论文
分享收藏Train Delay Prediction Systems: A Big Data Analytics Perspective列车延误预测系统: 大数据分析视角.png)
BIG DATA RESEARCH
BIG DATA RESEARCHIF4.2
PREAI
分享收藏
查看更多内容