Abstract

As an important task in data mining, feature selection can improve the performance of classification by eliminating the redundant or irrelevant features in original data. It is mainly divided into filter method and wrapper method, and each one has its own advantages. To make full use of the advantages of two methods, in this paper, an interactive filter-wrapper multi-objective evolutionary algorithm, named GR-MOEA is proposed, where guiding and repairing strategies are used to select feature subsets with high quality. To be specific, a wrapper population and a filter population are evolved simultaneously in the proposed algorithm. To utilize the merits of two populations, an interactive scheme is designed, which includes a wrapper to filter guiding strategy and a filter to wrapper repairing strategy. The guide strategy is to use the good solutions in the wrapper population to steer the filter population towards a better direction. While in the repairing strategy, some features in the wrapper population are repaired by the useful information in filter population, which can avoid the trapping of local optimum in wrapper population. To further enhance the performance of GR-MOEA, two effective initialization strategies are also developed. Empirical studies are conducted by comparing the proposed algorithm with several state-of-the-art on different datasets, and the experimental results demonstrate the superiority of GR-MOEA over the comparison methods in obtaining the feature subsets with higher qualities.

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.