A new filter feature selection algorithm for classification task by ensembling pearson correlation coefficient and mutual information

• Published in: Engineering applications of artificial intelligence Vol. 131; p. 107865
• Main Authors: Gong, Huanhuan, Li, Yanying, Zhang, Jiaoni, Zhang, Baoshuang, Wang, Xialin
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.05.2024
• Subjects: Classification; Feature selection; Filter model; Mutual information; Pearson correlation coefficient; Feature selection; Filter model; Mutual information; Classification; Pearson correlation coefficient
• ISSN: 0952-1976; 1873-6769
• DOI: 10.1016/j.engappai.2024.107865

Feature selection is widely used in various fields as a key means of data dimension reduction. The existing feature selection algorithms only use one linear or nonlinear correlation indicator when evaluating variables relationships, which lacks diversity. Considering the complexity of the relationship between features, a novel feature selection evaluation function CONMI is constructed, which ensembles Pearson correlation coefficient (liner) and normalized mutual information (non-linear) to comprehensively portrays the dependencies between features and class variables. We further propose the CONMI_FS algorithm based on CONMI, which selects the optimal subset of features that has high correlation with the class variables and low redundancy between the selected features. CONMI_FS is compared with four methods on 20 datasets and evaluated by reduction rate, classification accuracy, precision and recall metrics on KNN, SVM and DT classifiers. The experimental results show that CONMI_FS obtains the highest reduction rate of 80.04%, and achieves the best classification accuracy on KNN and SVM classifiers, which are 88.83% and 88.98%, respectively. These results indicate that CONMI_FS has good competitiveness.