A new feature selection algorithm based on fuzzy-pathfinder optimization

被引:0
|
作者
Zandvakili A. [1 ]
Mansouri N. [2 ]
Javidi M.M. [2 ]
机构
[1] Department of Computer Science, Shahid Bahonar University of Kerman, Kerman
[2] Faculty of Shahid, Bahonar University of Kerman, Kerman
关键词
Feature selection; Fuzzy logic; Meta-heuristic; Pathfinder optimization;
D O I
10.1007/s00521-024-10043-2
中图分类号
学科分类号
摘要
Data mining and machine learning require feature selection because features can dramatically improve model performance. In contrast, there are no polynomial solutions for selecting a subset feature. It is possible to achieve this by using meta-heuristic algorithms, specifically population-based algorithms that are able to provide a subset of features that is optimal and not exact. Meta-heuristic algorithms face challenges such as staying in local minima, easily falling into local optimum, weakly global searchability, premature convergence, and slow convergence speeds. However, recent research has limitations such as high complexity and weak initialization. In order to overcome these limitations, a three-stage model is proposed. In the first stage, the correlation of features and the correlation of features with class are considered during feature selection and used to create the initial population in the pathfinder optimization algorithm (PFA). PFA is a population-based algorithm and has some drawbacks, in the last iterations, the fluctuation rate (A) and vibration vector (ε) parameters converge to 0, and finding a new solution is impossible. As a second stage, a fuzzy inference system is designed to adjust these parameters adaptively and is called fuzzy-pathfinder optimization (FPO). In the third stage, FPO is used to select relevant features based on classification error, proportion of selected features, and redundancy. Finally, different algorithms such as simulated annealing (SA), differential evolutionary (DE), genetic algorithm (GA), particle swarm optimization (PSO), PFA, estimation of distribution algorithm (EDA), and symmetrical uncertainty criterion (SUC-PSO) are used for comparison. Based on the results, the proposed model is able to reach an average accuracy of 96% on average. Based on a comparison of the proposed algorithm with SA, DE, GA, PSO, PFA, EDA, and SUC-PSO, the objective function is improved by 17.3%, 5.6%, 3.0%, 4.5%, 5.0%, 0.5%, and 1.2%, respectively. The use of comprehensive objective functions, the adaptive adjustment of parameters, and the creation of a targeted initial population are key strengths of FPO. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.
引用
收藏
页码:17585 / 17614
页数:29
相关论文
共 50 条
  • [31] A Feature Selection Algorithm Based on Genetic Algorithm and Ordinal Optimization for Regression Problems
    Wang, Zhaojie
    Shen, Zhen
    Gao, Feng
    Sun, Mu
    Li, Junda
    Zhou, Qian
    2022 IEEE 18TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2022, : 1609 - 1616
  • [32] A neuro fuzzy algorithm for feature subset selection
    Chakraborty, B
    Chakraborty, G
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (09): : 2182 - 2188
  • [33] A neuro fuzzy algorithm for feature subset selection
    Chakraborty, B.
    Chakraborty, G.
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2001, E84-A (09) : 2182 - 2188
  • [34] Feature selection in a fuzzy student sectioning algorithm
    Amintoosi, M
    Haddadnia, J
    PRACTICE AND THEORY OF AUTOMATED TIMETABLING V, 2005, 3616 : 147 - 160
  • [35] An improved pathfinder algorithm (ASDR-PFA) based on adaptation of search dimensional ratio for solving global optimization problems and optimal feature selection
    Mahapatra, Ajit Kumar
    Panda, Nibedan
    Pattanayak, Binod Kumar
    PROGRESS IN ARTIFICIAL INTELLIGENCE, 2023, 12 (04) : 323 - 348
  • [36] An improved pathfinder algorithm (ASDR-PFA) based on adaptation of search dimensional ratio for solving global optimization problems and optimal feature selection
    Ajit Kumar Mahapatra
    Nibedan Panda
    Binod Kumar Pattanayak
    Progress in Artificial Intelligence, 2023, 12 : 323 - 348
  • [37] Fuzzy-based hunger games search algorithm for global optimization and feature selection using medical data
    Houssein, Essam H.
    Hosney, Mosa E.
    Mohamed, Waleed M.
    Ali, Abdelmgeid A.
    Younis, Eman M. G.
    NEURAL COMPUTING & APPLICATIONS, 2023, 35 (07): : 5251 - 5275
  • [38] Fuzzy-based hunger games search algorithm for global optimization and feature selection using medical data
    Essam H. Houssein
    Mosa E. Hosney
    Waleed M. Mohamed
    Abdelmgeid A. Ali
    Eman M. G. Younis
    Neural Computing and Applications, 2023, 35 : 5251 - 5275
  • [39] A New Fuzzy-rough Feature Selection Algorithm for Mammographic Risk Analysis
    Guo, Qian
    Qu, Yanpeng
    Deng, Ansheng
    Yang, Longzhi
    2016 12TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY (ICNC-FSKD), 2016, : 934 - 939
  • [40] SVM parameters and feature selection optimization based on improved whale algorithm
    Guo H.
    Fu J.-D.
    Li Z.-D.
    Yan Y.
    Li X.
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2023, 53 (10): : 2952 - 2963