Comparing Swarm Intelligence Algorithms for Dimension Reduction in Machine Learning

被引:12
|
作者
Kicska, Gabriella [1 ]
Kiss, Attila [1 ,2 ]
机构
[1] Eotvos Lorand Univ, Dept Informat Syst, H-1117 Budapest, Hungary
[2] J Selye Univ, Dept Informat, Komarno 94501, Slovakia
关键词
swarm intelligence; feature selection; dimensionality reduction; machine learning; comparative analysis; FEATURE-SELECTION; OPTIMIZATION;
D O I
10.3390/bdcc5030036
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nowadays, the high-dimensionality of data causes a variety of problems in machine learning. It is necessary to reduce the feature number by selecting only the most relevant of them. Different approaches called Feature Selection are used for this task. In this paper, we propose a Feature Selection method that uses Swarm Intelligence techniques. Swarm Intelligence algorithms perform optimization by searching for optimal points in the search space. We show the usability of these techniques for solving Feature Selection and compare the performance of five major swarm algorithms: Particle Swarm Optimization, Artificial Bee Colony, Invasive Weed Optimization, Bat Algorithm, and Grey Wolf Optimizer. The accuracy of a decision tree classifier was used to evaluate the algorithms. It turned out that the dimension of the data can be reduced about two times without a loss in accuracy. Moreover, the accuracy increased when abandoning redundant features. Based on our experiments GWO turned out to be the best. It has the highest ranking on different datasets, and its average iteration number to find the best solution is 30.8. ABC obtained the lowest ranking on high-dimensional datasets.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] Hybrid Swarm Intelligence Algorithms with Ensemble Machine Learning for Medical Diagnosis
    Al-Tashi, Qasem
    Rais, Helmi
    Abdulkadir, Said Jadid
    [J]. 2018 4TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCES (ICCOINS), 2018,
  • [2] Advanced Machine Learning Swarm Intelligence Algorithms in Atmospheric Pollutants Prediction
    Asklany, Somia
    Othmen, Salwa
    Mansouri, Wahida
    [J]. INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2024, 19 (04): : 1005 - 1018
  • [3] Developmental Swarm Intelligence: Developmental Learning Perspective of Swarm Intelligence Algorithms
    Shi, Yuhui
    [J]. INTERNATIONAL JOURNAL OF SWARM INTELLIGENCE RESEARCH, 2014, 5 (01) : 36 - 54
  • [4] A Voting Approach for Comparing Several Swarm Intelligence Algorithms
    Mogos, Andrei-Horia
    Mogos, Bianca
    Florea, Adina Magda
    [J]. 2015 20TH INTERNATIONAL CONFERENCE ON CONTROL SYSTEMS AND COMPUTER SCIENCE, 2015, : 287 - 293
  • [5] A COMPARISON ANALYSIS OF SWARM INTELLIGENCE ALGORITHMS FOR ROBOT SWARM LEARNING
    Fan, Jiaqi
    Hu, Mengqi
    Chu, Xianghua
    Yang, Dong
    [J]. 2017 WINTER SIMULATION CONFERENCE (WSC), 2017, : 3042 - 3053
  • [6] Dimension Reduction With Extreme Learning Machine
    Kasun, Liyanaarachchi Lekamalage Chamara
    Yang, Yan
    Huang, Guang-Bin
    Zhang, Zhengyou
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2016, 25 (08) : 3906 - 3918
  • [7] INCREMENTAL SOCIAL LEARNING IN SWARM INTELLIGENCE ALGORITHMS FOR OPTIMIZATION
    de Oca, Marco A. Montes
    [J]. NCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NEURAL COMPUTATION THEORY AND APPLICATIONS, 2011, : IS19 - IS19
  • [8] INCREMENTAL SOCIAL LEARNING IN SWARM INTELLIGENCE ALGORITHMS FOR OPTIMIZATION
    de Oca, Marco A. Montes
    [J]. ECTA 2011/FCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION THEORY AND APPLICATIONS AND INTERNATIONAL CONFERENCE ON FUZZY COMPUTATION THEORY AND APPLICATIONS, 2011,
  • [9] Improving and comparing performance of machine learning classifiers optimized by swarm intelligent algorithms for code smell detection
    Jain, Shivani
    Saha, Anju
    [J]. Science of Computer Programming, 2024, 237
  • [10] Business intelligence using machine learning algorithms
    Morteza Hamzehi
    Soodeh Hosseini
    [J]. Multimedia Tools and Applications, 2022, 81 : 33233 - 33251