Computer Science ›› 2021, Vol. 48 ›› Issue (11A): 93-101.doi: 10.11896/jsjkx.210100067

• Intelligent Computing • Previous Articles     Next Articles

Hybrid Artificial Chemical Reaction Optimization with Wolf Colony Algorithm for Feature Selection

ZHANG Ya-chuan1, LI Hao1, SONG Chen-ming2, BU Rong-jing1, WANG Hai-ning1, KANG Yan1   

  1. 1 School of Software,Yunnan University,Kunming 650500,China
    2 School of Software,Xi'an Jiaotong University,Xi'an 710000,China
  • Online:2021-11-10 Published:2021-11-12
  • About author:ZHANG Ya-chuan,born in 1996,postgraduate.Her main research interests include swarm intelligence optimization and data mining.
    KANG Yan,born in 1972,Ph.D,associate professor. Her main research interests include transfer learning,deep learning and integrated learning.
  • Supported by:
    National Natural Science Foundation of China(61762092),Yunnan Key Laboratory of Software Engineering Open Fund Project(2017SE204),Yunnan Major Science and Technology Project(202002AB080001) and Material Genetic Engineering-Metcloud Based Integrated Computing Function Module Computing Software Development(2019CLJY06).

Abstract: Wrapper feature selection is a data preprocessing method for reducing original dataset dimensionality by screening the most informative features to maximize the classification accuracy synchronously.In order to improve the wrapper feature selection ability,this paper proposes a hybrid artificial chemical reaction wolf colony optimization algorithm for selecting feature-ACR-WCA.First,ACR-WCA algorithm adopts natural strategy,imitates the search strategy of wolves,so can quickly approach the solution space.Secondly,in order to deal with data features effectively,the S-shaped transfer function is used to deal with binary features in the initialization stage.Then the fitness function of the algorithm is given by combining classification accuracy and the number of features.Meanwhile,the method uses K-Nearest Neighbor (KNN) classifier for training and tested data by K-fold cross-validation to overcome the over fitting problem.The experiments are trained based on 21 famous and different dimensionality dataset,and compared with four traditional methods and three nearly methods.Experimental results show that the algorithm is efficient and reliable.It can select the most features for classifications tasks with high accuracy.

Key words: Artificial chemical reaction optimization, Classification, Feature selection, Optimization, Wolf colony algorithm

CLC Number: 

  • TP391
[1]ZHONG X,MA Z P,ZHANG B.Overview of Data Mining[J].Pattern Recognition and Artificial Intelligence,2001(1):50-57.
[2]HAN J W,KAMBER M.Data mining concepts and techniques[M].Beijing:China Machine Press,2012.
[3]WU H S,ZHANG F M,WU L S.New swarm intelligence algorithm-wolf pack algorithm[J].Systems Engineering and Electronics,2013(11):204-212.
[4]KENNEDY J,EBERHART R C.Particle swarm optimization[C]//Proc IEEE International Conference on Neural Networks.IV,Perth,Australia,1995:1942-1948.
[5]HOLLAND J H.Adaptation in natural and artificial system[M].Ann Ar-bor:The University of Michigan Press,1975:68-73.
[6]LAM A Y S,LI V O K.Cheical-Reaction-Inspired Metaheuristic for Optimization[J].IEEE Transactions on Evolutionary Computation,2010,14(3):381-399.
[7]KOZODOI N,LESSMANN S,PAPAKONSTANTINOU K,et al.A multi- objective approach for profit-driven feature selection in credit scoring[J].Decision Support Systems,2019,120:106-117.
[8]HE X,CAI D,NIYOGI P.Laplacian score for feature selection[C]//Advances in Neural Information Processing Systems.2006:507-514.
[9]ARAUZO-AZOFRA A,BENITEZ J M,CASTRO J L.A feature set measure based on relief[C]//Proceedings of the fifth international conference on Recent Advances in Soft Computing.2004:104-109.
[10]SHI W F,HU X G,YU K.K-part Lasso based on feature selection algorithm for high-dimensional data[J].Computer Engineeringand Application,2012,48(1):157-161.
[11]WANG Q T,Application of meta heuristic algorithm in discrete location[D].Nanjing:Nanjing University of Aeronautics and Astronautics,2010.
[12]BEYER H G,SCHWEFEL H P.Evolution strategies- A comprehensive introduction[J].Natural Computing,2002,1(1):3-52.
[13]KOZA J R.Genetic programming as a means for programming computers by natural selection[J].Statistics and Computing,1994,4(2):87-112.
[14]DORIGO M,BIRATTARI M,STÜTZLE T.Ant Colony Optimization[J].IEEE Computational Intelligence Magazine,2006,1(4):28-39.
[15]YANG X S.Firefly Algorithm,Stochastic Test Functions andDesign Optimisation[J].International Journal of Bio Inspired Computation,2010,2(2):78-84.
[16]KIRKPATRICK S,GELATT C D,VECCHI M P.Optimization by simulated annealing[J].Science,1983,220(4598):671-680.
[17]RASHEDI E,NEZAMABADI-POUR H,SARYAZDIS.GSA:a Gravitational Search Algorithm[J].Information Sciences,2009,179(13):2232-2248.
[18]GEEM Z W,KIM J H,LOGANATHANG V.A New Heuristic Optimization Algorithm:Harmony Search[J].Simulation,2001,2(2):60-68.
[19]KAVEH A,KHAYATAZADM.A new meta-heuristic method:Ray Optimization[J].Computers & Structures,2012,112-113(DEC.):283-294.
[20]ATASHPAZ-GARGARI E,LUCAS C.Imperialist competitivealgorithm:An algorithm for optimization inspired by imperialistic competition[C]//IEEE Congress on Evolutionary Computation.IEEE,2008.
[21]KASHAN A H.League Championship Algorithm:A New Algorithm for Numerical Function Optimization[C]//International Conference of Soft Computing and Pattern Recognition.Malacca,2009:43-48.
[22]GHORBANI N,BABAEI E.Exchange market algorithm[J].Applied Soft Computing Journal,2014,19:177-187.
[23]ALATAS B.ACROA:Artificial Chemical Reaction Optimization Algorithm for global optimization[J].Expert Systems with Applications,2011,38(10):13170-13180.
[24]BECHIKH S,CHAABANI A,BEN SAID L.An EfficientChemical Reaction Optimization Algorithm for Multiobjective Optimization[J].IEEE Trans. Cybern,2015,45(10):2051-2064.
[25]TRUONG T K,LI K,XU Y.Chemical reaction optimizationwith greedy strategy for the 0-1 knapsack problem[M].Elsevier Science Publishers B.V.,2013.
[26]MORADI P,GHOLAMPOUR M.A hybrid particle swarm optimization for feature subset selection by integrating a novel local search strategy[J].Applied Soft Computing,2016,43(C):117-130.
[27]YU H,ZHAO N,WANG P,et al.Chaos-enhanced synchronized bat optimizer[J].Applied Mathematical Modelling,2019,77.
[28]MAFARJA M M,MIRJALILI S.Hybrid Whale OptimizationAlgorithm with simulated annealing for feature selection[J].Neurocomputing,2017,260:302-312.
[29]KENNEDY J,EBERHART R C.Particle Swarm Optimization[C]//Procedings of IEEE Conference on Neural Networks.Perth:IEEE,1995:1942-1948.
[30]YANG X S.Flower Pollination Algorithm for Global Optimiza-tion[C]//International Conference on Unconventional Compu-
ting and Natural Computation.Berlin:Springer,2012.
[31]MIRJALILI S,MIRJALILI S M,YANG X S.Binary bat algorithm[J].Neural Computing & Applications,2014,25(3):663-618.
[32]MIRJALILI S,MIRJALILI S M,HATAMLOU A.Multi-Verse Optimizer:a nature-inspired algorithm for global optimization[J].Neural Computing and Applications,2015,27(2):495-513.
[33]SOUZA R C T D,COELHO L D S,MACEDO C A D,et al.A V-Shaped Binary Crow Search Algorithm for Feature Selection[C]//2018 IEEE Congress on Evolutionary Computation(CEC).IEEE,2018.
[34]HUSSIEN A G,HASSANIEN A E,HOUSSEIN E H,et al.S-shaped Binary Whale Optimization Algorithm for Feature Selection[M]//Recent Trends in Signal and Image Processing.Berlin:Springer,2019:79-87.
[35]ABDEL-BASSET M,EL-SHAHAT D,EL-HENAWY I,et al.A new fusion of grey wolf optimizer algorithm with a two-phase mutation for feature selection[J].Expert Systems with Applications,2020,139:112824.
[1] LU Chen-yang, DENG Su, MA Wu-bin, WU Ya-hui, ZHOU Hao-hao. Federated Learning Based on Stratified Sampling Optimization for Heterogeneous Clients [J]. Computer Science, 2022, 49(9): 183-193.
[2] CHEN Zhi-qiang, HAN Meng, LI Mu-hang, WU Hong-xin, ZHANG Xi-long. Survey of Concept Drift Handling Methods in Data Streams [J]. Computer Science, 2022, 49(9): 14-32.
[3] ZHOU Xu, QIAN Sheng-sheng, LI Zhang-ming, FANG Quan, XU Chang-sheng. Dual Variational Multi-modal Attention Network for Incomplete Social Event Classification [J]. Computer Science, 2022, 49(9): 132-138.
[4] LI Qi-ye, XING Hong-jie. KPCA Based Novelty Detection Method Using Maximum Correntropy Criterion [J]. Computer Science, 2022, 49(8): 267-272.
[5] HAO Zhi-rong, CHEN Long, HUANG Jia-cheng. Class Discriminative Universal Adversarial Attack for Text Classification [J]. Computer Science, 2022, 49(8): 323-329.
[6] WU Hong-xin, HAN Meng, CHEN Zhi-qiang, ZHANG Xi-long, LI Mu-hang. Survey of Multi-label Classification Based on Supervised and Semi-supervised Learning [J]. Computer Science, 2022, 49(8): 12-25.
[7] LI Bin, WAN Yuan. Unsupervised Multi-view Feature Selection Based on Similarity Matrix Learning and Matrix Alignment [J]. Computer Science, 2022, 49(8): 86-96.
[8] WANG Can, LIU Yong-jian, XIE Qing, MA Yan-chun. Anchor Free Object Detection Algorithm Based on Soft Label and Sample Weight Optimization [J]. Computer Science, 2022, 49(8): 157-164.
[9] TAN Ying-ying, WANG Jun-li, ZHANG Chao-bo. Review of Text Classification Methods Based on Graph Convolutional Network [J]. Computer Science, 2022, 49(8): 205-216.
[10] YAN Jia-dan, JIA Cai-yan. Text Classification Method Based on Information Fusion of Dual-graph Neural Network [J]. Computer Science, 2022, 49(8): 230-236.
[11] CHEN Jun, HE Qing, LI Shou-yu. Archimedes Optimization Algorithm Based on Adaptive Feedback Adjustment Factor [J]. Computer Science, 2022, 49(8): 237-246.
[12] WANG Bing, WU Hong-liang, NIU Xin-zheng. Robot Path Planning Based on Improved Potential Field Method [J]. Computer Science, 2022, 49(7): 196-203.
[13] TANG Feng, FENG Xiang, YU Hui-qun. Multi-task Cooperative Optimization Algorithm Based on Adaptive Knowledge Transfer andResource Allocation [J]. Computer Science, 2022, 49(7): 254-262.
[14] ZHAO Dong-mei, WU Ya-xing, ZHANG Hong-bin. Network Security Situation Prediction Based on IPSO-BiLSTM [J]. Computer Science, 2022, 49(7): 357-362.
[15] GAO Zhen-zhuo, WANG Zhi-hai, LIU Hai-yang. Random Shapelet Forest Algorithm Embedded with Canonical Time Series Features [J]. Computer Science, 2022, 49(7): 40-49.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!