A pareto-based ensemble of feature selection algorithms

被引:31
|
作者
Hashemi, Amin [1 ]
Dowlatshahi, Mohammad Bagher [1 ]
Nezamabadi-pour, Hossein [2 ]
机构
[1] Lorestan Univ, Fac Engn, Dept Comp Engn, Khorramabad, Iran
[2] Shahid Bahonar Univ Kerman, Dept Elect Engn, Kerman, Iran
关键词
Ensemble feature selection; Pareto-based method; Bi-objective optimization; Crowding distance; GRAVITATIONAL SEARCH ALGORITHM; EVOLUTIONARY ALGORITHM; OPTIMIZATION;
D O I
10.1016/j.eswa.2021.115130
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, ensemble feature selection is modeled as a bi-objective optimization problem regarding features' relevancy and redundancy degree. The proposed method, which is called PEFS, first uses the modeled biobjective optimization problem to find the non-dominated features based on the decision matrix constructed by different feature selection algorithms. In the second step, the found non-dominated features are sorted using the crowding distance in the bi-objective space. These sorted features remove from the feature space, and the process of finding the non-dominated features will continue until all the features are sorted. To illustrate the optimality and efficiency of the proposed method, we have compared our approach with some ensemble feature selection methods and basic algorithms used in the ensemble process. The results show that our method in terms of accuracy and F-score is superior to other similar methods and performs in a short running-time.
引用
收藏
页数:16
相关论文
共 50 条
  • [31] Multi-objective optimization for the reliable pollution-routing problem with cross-dock selection using Pareto-based algorithms
    Tirkolaee, Erfan Babaee
    Goli, Alireza
    Faridnia, Amin
    Soltani, Mehdi
    Weber, Gerhard-Wilhelm
    JOURNAL OF CLEANER PRODUCTION, 2020, 276
  • [32] Pareto-based optimization of part orientation in stereolithography
    Nezhad, A. Sanati
    Barazandeh, F.
    Rahimi, A. R.
    Vatani, M.
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2010, 224 (B10) : 1591 - 1598
  • [33] Pareto-based negotiation in distributed multidisciplinary design
    Guarneri, Paolo
    Wiecek, Margaret M.
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2016, 53 (04) : 657 - 671
  • [34] Dynamic Feature Selection based on Pareto Front Optimization
    Jesus, Jhoseph
    Canuto, Anne
    Araujo, Daniel
    2018 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2018,
  • [35] A Pareto-Based Sparse Subspace Learning Framework
    Luo, Juanjuan
    Jiao, Licheng
    Liu, Fang
    Yang, Shuyuan
    Ma, Wenping
    IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (11) : 3859 - 3872
  • [36] Peptide identification via constrained multi-objective optimization: Pareto-based genetic algorithms
    Malard, JM
    Heredia-Langner, A
    Cannon, WR
    Mooney, R
    Baxter, DJ
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2005, 17 (14): : 1687 - 1704
  • [37] PARETO-BASED ENERGY CONTROL FOR THE HEVC ENCODER
    Penny, Wagner
    Machado, Italo
    Porto, Marcelo
    Agostini, Luciano
    Zatt, Bruno
    2016 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2016, : 814 - 818
  • [38] Pareto-based optimization of sparse dynamical systems
    Ducci, Gianmarco
    Kouyate, Maryke
    Reuter, Karsten
    Scheurer, Christoph
    JOURNAL OF CHEMICAL PHYSICS, 2025, 162 (11):
  • [39] Correction to: A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms
    Erfan Babaee Tirkolaee
    Alireza Goli
    Selma Gütmen
    Gerhard-Wilhelm Weber
    Katarzyna Szwedzka
    Annals of Operations Research, 2024, 332 : 1215 - 1215
  • [40] Ensemble Based Feature Selection With Hybrid Model
    Demir, Ceylan
    Ozogur-Akyuz, Sureyya
    Goksel, Izzet
    29TH IEEE CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS (SIU 2021), 2021,