Abstract

To address the limitations of current classification prediction models, an algorithm DPC-ASMOTE-IRF for Clustering by fast search and find of density peaks (DPC) with adaptive SMOTE (ASMOTE) coupled with improved random forest (IRF) is proposed. The algorithm first introduces in the data processing stage DPC clustering algorithm to cluster the samples, and proposes ASMOTE oversampling technique to process a minority class of samples to get relatively balanced samples. In the algorithm stage, the model’s overall classification performance for unbalanced data is improved by assigning weights to each decision tree in the random forest through the classification accuracy. The experimental results show that the classification performance indexes of the proposed method are all improved compared with similar classification experimental models.

Details

Title
A clustered oversampling coupled random forest classification method
Author
Wei-Peng, An 1 ; Gao, Feng 1 ; Xin-Xin Shang 2 

 School of Computer Science and Technology, Henan Polytechnic University , Jiaozuo, 454002 , China 
 School of Accounting, Zhengzhou Business University , Zhengzhou, 451400 , China 
First page
012016
Publication year
2022
Publication date
Jul 2022
Publisher
IOP Publishing
ISSN
17426588
e-ISSN
17426596
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2695508878
Copyright
Published under licence by IOP Publishing Ltd. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.