Paralleled random forest algorithm based on MapReduce(MR_RF) which constructing trees on partitions is a classic ensemble algorithm for big data classification.However
when encountering imbalanced big data
its performance will decrease with the tendency of positive samples misclassified because of the low density of positive samples themselves and the algorithms global optimal criteria for choosing split points.In this paper
An improved paralleled random forest called SBWMR_RF is proposed.It adopts stratified bootstrap to increase the minority during sampling.At the same time
cost-sensitive thought is applied through the key steps of tree construction
modify the distribution of the minority.The experiments prove that SBWMR_RF can effectively classify unbalanced big data especially in extremely unbalanced data scenario without overfitting but high speedup.
关键词
Keywords
references
Kamienski C, Kelner J, Mariz D, et al. A stratified traffic sampling methodology for seeing the big picture[J]. Computer Networks the International Journal of Computer % Telecommunications Networking, 2008, 52(14): 2677-2689. DOI: 2677
Chawla N V, Cieslak D A, Hall L O, et al. Automatically countering imbalance and its empirical relationship to cost[J]. Data Mining % Knowledge Discovery, 2008, 17(2): 225-252. DOI: 225
Wang S, Yao X. Diversity analysis on imbalanced data sets by using ensemble models[C]//IEEE Symposium on Computational Intelligence and Data Mining. Nashville, TN, USA, 2009: 535-548.
Breiman L. Random forest[J]. Machine Learning, 2001, 45(1): 5-32. DOI: 5
López V, Fernández A, García S, et al. An insight into classification with imbalanced data: Empirical results and current trends on using data intrinsic characteristics[J]. Information Sciences, 2013, 250(11): 113-141. DOI: 113
Genuer R, Poggi J M, Tuleau Malot C, et al. Random forests for big data[J]. arXiv preprint arXiv: 1511.08327, 2015.
Chen C, Breiman L. Using random forest to learn imbalanced data[J]. Telkomnika Indonesian Journal of Electrical Engineering, 2004, 45(1): 5-32. DOI: 5