Abstract

When dealing with large-scale datasets, high-dimensional feature selection plays a crucial role in improving the performance and interpretability of machine learning models. However, it still faces the problems of the “dimensionality curse” and high computational cost in dealing with high-dimensional datasets. In this paper, we develop a dual-module hybrid feature selection algorithm based on correlation filtering and a multi-objective evolutionary algorithm based on dynamic variation distance (HMOFS-CFDVD), which aims to reduce the computational cost of high-dimensional features and search space. Firstly, a coarse-grained feature filtering method based on correlation is proposed, enabling the algorithm to quickly identify potentially better feature subsets in the later stages. After that, a fine-grained feature selection is further implemented based on the multi-objective evolutionary algorithm with sample variation distance to obtain a high-quality feature subset. This stage incorporates a novel population initialization method with self-regulation, an adaptive evolution strategy, an optimal sample selection mechanism based on dynamic sample distance, and an improved diversity mechanism to enhance the evolutionary performance. Moreover, the feature relevance metric is introduced as a third objective to improve the overall algorithm's performance. Experimental results on 12 high-dimensional feature datasets demonstrate that the proposed HMOFS-CFDVD achieves high accuracy and produces a smaller subset of features.

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.