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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.