Abstract

Feature selection is a crucial aspect of data preprocessing because of the significant effect of redundant features on classification performance and the extensive computational resources required. Evolutionary algorithm-based feature-selection methods have shown remarkable results in determining the optimal feature subset. To further enhance classification performance, this paper proposes a novel multi-population differential evolution approach for feature selection with mutual information ranking (MI-MPODE). Firstly, population preprocessing guided by mutual information is employed to reduce the dimensionality of the initial feature space. Then, the feature subset obtained from mutual information serves as the initial population for MI-MPODE. MI-MPODE incorporates a novel multi-population information-sharing mechanism, with common individuals from three layers contributing to inter-subpopulation information sharing. Additionally, an individual enhancement strategy is proposed to handle the variations of individuals in the population, and a Lens imaging opposition-based learning method is adopted to improve the algorithm’s optimization capability. MI-MPODE is compared with several state-of-the-art evolutionary algorithm-based feature selection methods through experimental comparisons. The results show that MI-MPODE outperforms all comparison algorithms on more than half of the datasets, with a significant reduction in the number of features used, demonstrating a significant advantage over competitors.

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.