返回
Scalable and Parallel Boosting with MapReduce
DOI:10.1109/TKDE.2011.208.png)
摘要
En 中文
In this era of data abundance, it has become critical to process large volumes of data at much faster rates than ever before. Boosting is a powerful predictive model that has been successfully used in many real-world applications. However, due to the inherent sequential nature, achieving scalability for boosting is nontrivial and demands the development of new parallelized versions which will allow them to efficiently handle large-scale data. In this paper, we propose two parallel boosting algorithms, ADABOOST.PL and LOGITBOOST.PL, which facilitate simultaneous participation of multiple computing nodes to construct a boosted ensemble classifier. The proposed algorithms are competitive to the corresponding serial versions in terms of the generalization performance. We achieve a significant speedup since our approach does not require individual computing nodes to communicate with each other for sharing their data. In addition, the proposed approach also allows for preserving privacy of computations in distributed environments. We used MapReduce framework to implement our algorithms and demonstrated the performance in terms of classification accuracy, speedup and scaleup using a wide variety of synthetic and real-world data sets.
Keyword:
Boosting
parallel algorithms
classification
distributed computing
MapReduce
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
BioGRID: a general repository for interaction datasetsBioGRID: 交互数据集的通用存储库
NUCLEIC ACIDS RESEARCH
IF13.1
Characterization of polymer matrix and low melting point solder for anisotropic conductive film各向异性导电膜用聚合物基体及低熔点焊料的表征
Systematic review of animal-based indicators to measure thermal, social, and immune-related stress in pigs
PLOS ONE
IF0

