Hybrid Binary Imperialist Competition Algorithm and Tabu Search Approach for Feature Selection Using Gene Expression Data

被引:7
作者
Wang, Shuaiqun [1 ]
Aorigele [2 ]
Kong, Wei [1 ]
Zeng, Weiming [1 ]
Hong, Xiaomin [1 ]
机构
[1] Shanghai Maritime Univ, Informat Engn Coll, Shanghai 201306, Peoples R China
[2] Toyama Univ, Fac Engn, Toyama 9308555, Japan
关键词
PARTICLE SWARM OPTIMIZATION;
D O I
10.1155/2016/9721713
中图分类号
Q81 [生物工程学(生物技术)]; Q93 [微生物学];
学科分类号
071005 ; 0836 ; 090102 ; 100705 ;
摘要
Gene expression data composed of thousands of genes play an important role in classification platforms and disease diagnosis. Hence, it is vital to select a small subset of salient features over a large number of gene expression data. Lately, many researchers devote themselves to feature selection using diverse computational intelligence methods. However, in the progress of selecting informative genes, many computational methods face difficulties in selecting small subsets for cancer classification due to the huge number of genes ( high dimension) compared to the small number of samples, noisy genes, and irrelevant genes. In this paper, we propose a new hybrid algorithm HICATS incorporating imperialist competition algorithm ( ICA) which performs global search and tabu search ( TS) that conducts fine-tuned search. In order to verify the performance of the proposed algorithm HICATS, we have tested it on 10 well-known benchmark gene expression classification datasets with dimensions varying from 2308 to 12600. The performance of our proposed method proved to be superior to other related works including the conventional version of binary optimization algorithm in terms of classification accuracy and the number of selected genes.
引用
收藏
页数:12
相关论文
共 22 条
[1]  
Alshamlan H. M., 2002, COMPUTATIONAL BIOL C, V56, P49
[2]   mRMR-ABC: A Hybrid Gene Selection Algorithm for Cancer Classification Using Microarray Gene Expression Profiling [J].
Alshamlan, Hala ;
Badr, Ghada ;
Alohali, Yousef .
BIOMED RESEARCH INTERNATIONAL, 2015, 2015
[3]  
[Anonymous], 2014, P 1 INT C ADV DATA I, DOI DOI 10.1007/978-981-4585-18-7_44
[4]  
Atashpaz-Gargari E, 2007, IEEE C EVOL COMPUTAT, P4661, DOI 10.1109/cec.2007.4425083
[5]   Improved binary PSO for feature selection using gene expression data [J].
Chuang, Li-Yeh ;
Chang, Hsueh-Wei ;
Tu, Chung-Jui ;
Yang, Cheng-Hong .
COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2008, 32 (01) :29-38
[6]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[7]   On the learnability and design of output codes for multiclass problems [J].
Crammer, K ;
Singer, Y .
MACHINE LEARNING, 2002, 47 (2-3) :201-233
[8]  
Dasarathy B, 1991, NN CONCEPTS TECHNIQU
[9]  
Feilotter H., 2002, AM J HUM GENET, V71, P1483
[10]   FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO ARTIFICIAL-INTELLIGENCE [J].
GLOVER, F .
COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (05) :533-549