Compact NSGA-II for Multi-objective Feature Selection
<|reference_start|>Compact NSGA-II for Multi-objective Feature Selection: Feature selection is an expensive challenging task in machine learning and data mining aimed at removing irrelevant and redundant features. This contributes to an improvement in classification accuracy, as well as the budget and memory requirements for classification, or any other post-processing task conducted after feature selection. In this regard, we define feature selection as a multi-objective binary optimization task with the objectives of maximizing classification accuracy and minimizing the number of selected features. In order to select optimal features, we have proposed a binary Compact NSGA-II (CNSGA-II) algorithm. Compactness represents the population as a probability distribution to enhance evolutionary algorithms not only to be more memory-efficient but also to reduce the number of fitness evaluations. Instead of holding two populations during the optimization process, our proposed method uses several Probability Vectors (PVs) to generate new individuals. Each PV efficiently explores a region of the search space to find non-dominated solutions instead of generating candidate solutions from a small population as is the common approach in most evolutionary algorithms. To the best of our knowledge, this is the first compact multi-objective algorithm proposed for feature selection. The reported results for expensive optimization cases with a limited budget on five datasets show that the CNSGA-II performs more efficiently than the well-known NSGA-II method in terms of the hypervolume (HV) performance metric requiring less memory. The proposed method and experimental results are explained and analyzed in detail.<|reference_end|>
@article{miyandoab2024compact,
    title={Compact NSGA-II for Multi-objective Feature Selection},
    author={Sevil Zanjani Miyandoab, Shahryar Rahnamayan, Azam Asilian Bidgoli},
    journal={2023 IEEE International Conference on Systems, Man, and
  Cybernetics (SMC), pp. 3868-3875. IEEE, 2023},
    year={2024},
    doi={10.1109/SMC53992.2023.10394458},
    archivePrefix={arXiv},
    eprint={2402.12625},
    primaryClass={cs.LG cs.NE}
}