A Binary Multi-Objective Chimp Optimizer With Dual Archive for Feature Selection in the Healthcare Domain

被引:21
作者
Piri, Jayashree [1 ]
Mohapatra, Puspanjali [1 ]
Pradhan, Manas Ranjan [2 ]
Acharya, Biswaranjan [3 ]
Patra, Tapas Kumar [4 ]
机构
[1] Int Inst Informat Technol, Dept CSE, Bhubaneswar 751029, India
[2] Skyline Univ Coll, Sharjah, U Arab Emirates
[3] Kalinga Inst Ind Technol Deemed Univ, Bhubaneswar 751024, India
[4] Coll Engn & Technol, Bhubaneswar 751029, India
关键词
Optimization; Task analysis; Medical diagnostic imaging; Medical services; Filtering theory; Licenses; Filtering algorithms; Chimp optimization; classification; healthcare; data mining; feature selection; multi-objective; PARTICLE SWARM OPTIMIZATION; GENETIC ALGORITHM; MUTUAL INFORMATION; CLASSIFICATION; SEARCH; PREDICTION; HARMONY;
D O I
10.1109/ACCESS.2021.3138403
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Medical datasets frequently include vast feature sets with numerous features that are related to one another. As a result, the curse of dimensionality affects learning from a medical dataset to discover significant characteristics, making it necessary to minimize the feature set. Feature selection (FS) is a major step in classification and also in reducing the dimension. This study attempts a novel Binary Multi-objective Chimp Optimization Algorithm (BMOChOA) with dual archive and k-nearest neighbors (KNN) classifier for mining relevant aspects from medical data. In this research, 12 versions of BMOChOA are implemented based on the group information and types of chaotic functions used. The best Pareto front obtained from suggested BMOChOA variations is compared with three benchmark multi-objective FS methods by taking 14 popular medical datasets of variable dimensions. By analyzing the experimental outputs using four multi-objective performance evaluators, it is found that the proposed FS method is superior in finding the best trade-off between the two objective functions: the number of features and classification performance.
引用
收藏
页码:1756 / 1774
页数:19
相关论文
共 99 条
[81]   A hybrid model using teaching-learning-based optimization and Salp swarm algorithm for feature selection and classification in digital mammography [J].
Thawkar, Shankar .
JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2021, 12 (09) :8793-8808
[82]   Chaotic Atom Search Optimization for Feature Selection [J].
Too, Jingwei ;
Abdullah, Abdul Rahim .
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2020, 45 (08) :6063-6079
[83]   A New Quadratic Binary Harris Hawk Optimization for Feature Selection [J].
Too, Jingwei ;
Abdullah, Abdul Rahim ;
Saad, Norhashimah Mohd .
ELECTRONICS, 2019, 8 (10)
[84]   Classification and Feature Selection Method for Medical Datasets by Brain Storm Optimization Algorithm and Support Vector Machine [J].
Tuba, Eva ;
Strumberger, Ivana ;
Bezdan, Timea ;
Bacanin, Nebojsa ;
Tuba, Milan .
7TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT (ITQM 2019): INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT BASED ON ARTIFICIAL INTELLIGENCE, 2019, 162 :307-315
[85]   Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection [J].
Tubishat, Mohammad ;
Idris, Norisma ;
Shuib, Liyana ;
Abushariah, Mohammad A. M. ;
Mirjalili, Seyedali .
EXPERT SYSTEMS WITH APPLICATIONS, 2020, 145
[86]   Feature selection for face recognition based on multi-objective evolutionary wrappers [J].
Vignolo, Leandro D. ;
Milone, Diego H. ;
Scharcanski, Jacob .
EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (13) :5077-5084
[87]   DIRECT METHOD OF NONPARAMETRIC MEASUREMENT SELECTION [J].
WHITNEY, AW .
IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (09) :1100-&
[88]  
Wolpert D. H., 1997, IEEE Transactions on Evolutionary Computation, V1, P67, DOI 10.1109/4235.585893
[89]  
Xue B., 2014, 2014 ANN C GEN EV CO, P83
[90]   A Survey on Evolutionary Computation Approaches to Feature Selection [J].
Xue, Bing ;
Zhang, Mengjie ;
Browne, Will N. ;
Yao, Xin .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (04) :606-626