关键词: 随机森林模型, 不平衡大数据分类, SVM 支持向量机, 反 k 近邻法, CART 决策树 

Abstract: In response to the problem of poor classification performance faced by current imbalanced big data classification algorithms, a random forest model based imbalanced big data classification algorithm is proposed. Firstly, the SVM(Support Vector Machine) algorithm is used to filter information on imbalanced big data, and then the anti k-nearest neighbor method is used to detect and eliminate outliers. The singularity of the covariance matrix in imbalanced big data is removed through incremental principal component analysis. And based on the entropy method, weight analysis is carried out to extract imbalanced big data feature information. The CART (Classification and Regression Trees) decision tree is used as the base classifier for imbalanced big data, and a random forest decision tree classifier is constructed. The extracted imbalanced big data feature information is input into the classifier to achieve imbalanced big data classification. The experimental results show that the proposed algorithm has good sampling performance, high classification accuracy, high stability, and high performance for imbalanced big data. 

Key words: stochastic forest model, unbalanced big data classification, support vector machine( SVM), Anti k-nearest neighbor method, classification and regression trees(CART) decision tree