A Modified Binary Particle Swarm Optimization for Selecting the Small Subset of Informative Genes From Gene Expression Data

被引:61
作者
Mohamad, Mohd Saberi [1 ]
Omatu, Sigeru [2 ]
Deris, Safaai [1 ]
Yoshioka, Michifumi [3 ]
机构
[1] Univ Teknologi Malaysia, Artificial Intelligence & Bioinformat Res Grp, Fac Comp Sci & Informat Syst, Skudai 81310, Johore, Malaysia
[2] Osaka Inst Technol, Dept Elect Informat & Commun Engn, Osaka 5358585, Japan
[3] Osaka Prefecture Univ, Dept Comp Sci & Intelligent Syst, Sakai, Osaka 5998531, Japan
来源
IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE | 2011年 / 15卷 / 06期
关键词
Binary particle swarm optimization; gene expression data; gene selection; hybrid approach;
D O I
10.1109/TITB.2011.2167756
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Gene expression data are expected to be of significant help in the development of efficient cancer diagnoses and classification platforms. In order to select a small subset of informative genes from the data for cancer classification, recently, many researchers are analyzing gene expression data using various computational intelligence methods. However, due to the small number of samples compared to the huge number of genes (high dimension), irrelevant genes, and noisy genes, many of the computational methods face difficulties to select the small subset. Thus, we propose an improved (modified) binary particle swarm optimization to select the small subset of informative genes that is relevant for the cancer classification. In this proposed method, we introduce particles' speed for giving the rate at which a particle changes its position, and we propose a rule for updating particle's positions. By performing experiments on ten different gene expression datasets, we have found that the performance of the proposed method is superior to other previous related works, including the conventional version of binary particle swarm optimization (BPSO) in terms of classification accuracy and the number of selected genes. The proposed method also produces lower running times compared to BPSO.
引用
收藏
页码:813 / 822
页数:10
相关论文
共 17 条
[1]  
[Anonymous], BIOL GUIDE ANAL DNA
[2]   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
[3]  
Engelbrecht A.P., 2006, PROCEEDING IEEE SWAR, P48
[4]  
Engelbrecht AP., 2005, Fundamentals of computational swarm intelligence
[5]  
Kennedy J., 1995, 1995 IEEE International Conference on Neural Networks Proceedings (Cat. No.95CH35828), P1942, DOI 10.1109/ICNN.1995.488968
[6]  
Kennedy J, 1997, IEEE SYS MAN CYBERN, P4104, DOI 10.1109/ICSMC.1997.637339
[7]   Optimal search-based gene subset selection for gene array cancer classification [J].
Li, Jiexun ;
Su, Hua ;
Chen, Hsinchun ;
Futscher, Bernard W. .
IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE, 2007, 11 (04) :398-405
[8]   Gene selection using hybrid particle swarm optimization and genetic algorithm [J].
Li, Shutao ;
Wu, Xixian ;
Tan, Mingkui .
SOFT COMPUTING, 2008, 12 (11) :1039-1048
[9]   Selecting informative genes from microarray data by using hybrid methods for cancer classification [J].
Mohamad M.S. ;
Omatu S. ;
Deris S. ;
Misman M.F. ;
Yoshioka M. .
Artificial Life and Robotics, 2009, 13 (2) :414-417
[10]  
Mohamad MS, 2009, INT J INNOV COMPUT I, V5, P2189