返回
A Hyper Learning Binary Dragonfly Algorithm for Feature Selection: A COVID-19 Case Study
DOI:10.1016/j.knosys.2020.106553.png)
摘要
En 中文
The rapid expansion of information science has caused the issue of the curse of dimensionality, which will negatively affect the performance of the machine learning model. Feature selection is typically considered as a pre-processing mechanism to find an optimal subset of features from a given set of all features in the data mining process. In this article, a novel Hyper Learning Binary Dragonfly Algorithm (HLBDA) is proposed as a wrapper-based method to find an optimal subset of features for a given classification problem. HLBDA is an enhanced version of the Binary Dragonfly Algorithm (BDA) in which a hyper learning strategy is used to assist the algorithm to escape local optima and improve searching behavior. The proposed HLBDA is compared with eight algorithms in the literature. Several assessment indicators are employed to evaluate and compare the effectiveness of these methods over twenty-one datasets from the University of California Irvine (UCI) repository and Arizona State University. Also, the proposed method is applied to a coronavirus disease (COVID-19) dataset. The results demonstrate the superiority of HLBDA in increasing classification accuracy and reducing the number of selected features.(2) (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Binary Dragonfly Algorithm
Feature selection
Data mining
Optimization
Classification
Algorithm
Binary Optimization
Particle Swarm Optimization
Combinatorial Optimization
Artificial Intelligence
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
Chaotic dragonfly algorithm: an improved metaheuristic algorithm for feature selection混沌蜻蜓算法: 一种改进的元启发式特征选择算法
APPLIED INTELLIGENCE
IF3.5

