Effective memetic algorithm for multilabel feature selection using hybridization-based communication
- Authors
- Seo, Wangduk; Park, Minwoo; Kim, Dae-Won; Lee, Jaesung
- Issue Date
- Sep-2022
- Publisher
- Elsevier Ltd
- Keywords
- Feature subset refinement; Memetic algorithm; Memetic communication process; Multilabel feature selection
- Citation
- Expert Systems with Applications, v.201
- Journal Title
- Expert Systems with Applications
- Volume
- 201
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/57804
- DOI
- 10.1016/j.eswa.2022.117064
- ISSN
- 0957-4174
1873-6793
- Abstract
- Multilabel feature selection, which is used to select features relevant to multiple labels, has demonstrated its effectiveness in prediction time and learning accuracy. A memetic algorithm that uses a feature subset refining process has been verified to outperform existing genetic algorithms in identifying an optimal feature subset. However, as the refinement process is consistently applied to all solutions of feature subsets, similar feature subsets can be over-produced, thereby limiting the synergy of hybridization. Here, we propose an evolutionary multilabel feature selection algorithm that searches the final feature subset using multiple populations to prevent limiting the synergy of hybridization. A new hybridization-based communication process refines solutions originated from each best solution of multiple populations, then, randomly distributes the produced solutions. With this approach, the proposed method circumvents the degradation of search capability and keeps the synergy of hybridization. Our experimental results indicate that the proposed method could identify better feature subsets than conventional methods. © 2022
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > Department of Artificial Intelligence > 1. Journal Articles
- College of Software > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.