Feature subset selection using multimodal multiobjective differential evolution

被引:10
|
作者
Agrawal, Suchitra [1 ]
Tiwari, Aruna [1 ]
Yaduvanshi, Bhaskar [1 ]
Rajak, Prashant [1 ]
机构
[1] Indian Inst Technol Indore, Dept Comp Sci & Engn, Indore 453552, India
关键词
Multimodal multiobjective optimization; Differential evolution; Feature subset selection; Probability initialization; Stagnated convergence archive; OPTIMIZATION; INFORMATION;
D O I
10.1016/j.knosys.2023.110361
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The main aim of feature subset selection is to find the minimum number of required features to perform classification without affecting the accuracy. It is one of the useful real-world applications for different types of classification datasets. Different feature subsets may achieve similar classification accuracy, which can help the user to select the optimal features. There are two main objectives involved in selecting a feature subset: minimizing the number of features and maximizing the accuracy. However, most of the existing studies do not consider multiple feature subsets of the same size. In this paper, we have proposed an algorithm for multimodal multiobjective optimization based on differential evolution with respect to the feature subset selection problem. We have proposed the probability initialization method to identify the selected features with equal distribution in the search space. We have also proposed a niching technique to explore the search space and exploit the nearby solutions. Further, we have proposed a convergence archive to locate and store the optimal feature subsets. Exhaustive experimentation has been conducted on different datasets with varying characteristics to identify multiple feature subsets. We have also proposed an evaluation metric for the quantitative comparison of the proposed algorithm with the existing algorithms. Results have also been compared with existing algorithms in the objective space and in terms of classification accuracy, which shows the effectiveness of the proposed algorithm.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:13
相关论文
共 50 条
  • [41] Feature subset selection using granular information
    Roychowdhury, S
    JOINT 9TH IFSA WORLD CONGRESS AND 20TH NAFIPS INTERNATIONAL CONFERENCE, PROCEEDINGS, VOLS. 1-5, 2001, : 2041 - 2045
  • [42] Acceleration of Feature Subset Selection using CUDA
    Yang, Jun
    Jing, Si-Yuan
    2018 14TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2018, : 140 - 144
  • [43] A Framework of Gene Subset Selection Using Multiobjective Evolutionary Algorithm
    Li, Yifeng
    Ngom, Alioune
    Rueda, Luis
    PATTERN RECOGNITION IN BIOINFORMATICS, 2012, 7632 : 38 - 48
  • [44] On multiobjective selection for multimodal optimization
    Wessing, Simon
    Preuss, Mike
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2016, 63 (03) : 875 - 902
  • [45] A Differential Evolution Approach to Feature Selection and Instance Selection
    Wang, Jiaheng
    Xue, Bing
    Gao, Xiaoying
    Zhang, Mengjie
    PRICAI 2016: TRENDS IN ARTIFICIAL INTELLIGENCE, 2016, 9810 : 588 - 602
  • [46] Incorporation of multimodal multiobjective optimization in designing a filter based feature selection technique
    Jha, Kanchan
    Saha, Sriparna
    APPLIED SOFT COMPUTING, 2021, 98 (98)
  • [47] On multiobjective selection for multimodal optimization
    Simon Wessing
    Mike Preuss
    Computational Optimization and Applications, 2016, 63 : 875 - 902
  • [48] Evolution of the random subset feature selection algorithm for classification problem
    SabbaghGol, Hamed
    Saadatfar, Hamid
    Khazaiepoor, Mahdi
    KNOWLEDGE-BASED SYSTEMS, 2024, 285
  • [49] Subset Selection for Evolutionary Multiobjective Optimization
    Gu, Yu-Ran
    Bian, Chao
    Li, Miqing
    Qian, Chao
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2024, 28 (02) : 403 - 417
  • [50] Accelerating differential evolution based on a subset-to-subset survivor selection operator
    Jinglei Guo
    Zhijian Li
    Shengxiang Yang
    Soft Computing, 2019, 23 : 4113 - 4130