An enhancement of binary particle swarm optimization for gene selection in classifying cancer classes

被引:34
作者
Mohamad, Mohd Saberi [1 ]
Omatu, Sigeru [2 ]
Deris, Safaai [1 ]
Yoshioka, Michifumi [3 ]
Abdullah, Afnizanfaizal [1 ]
Ibrahim, Zuwairie [4 ]
机构
[1] Univ Teknol Malaysia, Fac Comp Sci & Informat Syst, Artificial Intelligence & Bioinformat Res Grp, Skudai 81310, Johor, Malaysia
[2] Osaka Inst Technol, Dept Elect Informat & Commun Engn, Osaka 5358585, Japan
[3] Osaka Prefecture Univ, Grad Sch Engn, Dept Comp Sci & Intelligent Syst, Sakai, Osaka 5998531, Japan
[4] Univ Malaysia Pahang, Fac Elect & Elect Engn, Pekan 26600, Pahang, Malaysia
关键词
Particle Swarm Optimization; Classification Accuracy; Gene Expression Data; Sigmoid Function; Gene Subset;
D O I
10.1186/1748-7188-8-15
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: Gene expression data could likely be a momentous help in the progress of proficient cancer diagnoses and classification platforms. Lately, many researchers analyze gene expression data using diverse computational intelligence methods, for selecting a small subset of informative genes from the data for cancer classification. Many computational methods face difficulties in selecting small subsets due to the small number of samples compared to the huge number of genes (high-dimension), irrelevant genes, and noisy genes. Methods: We propose an enhanced binary particle swarm optimization to perform the selection of small subsets of informative genes which is significant for cancer classification. Particle speed, rule, and modified sigmoid function are introduced in this proposed method to increase the probability of the bits in a particle's position to be zero. The method was empirically applied to a suite of ten well-known benchmark gene expression data sets. Results: The performance of the proposed method proved to be 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 requires lower computational time compared to BPSO.
引用
收藏
页数:11
相关论文
共 19 条
[1]  
[Anonymous], BIOL GUIDE ANAL DNA
[2]  
[Anonymous], 2011, J COMPUTATIONAL BIOL
[3]   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
[4]   Tabu Search and Binary Particle Swarm Optimization for Feature Selection Using Microarray Data [J].
Chuang, Li-Yeh ;
Yang, Cheng-Huei ;
Yang, Cheng-Hong .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2009, 16 (12) :1689-1703
[5]  
Engelbrecht AP., 2005, Fundamentals of computational swarm intelligence
[6]   A comparison of methods for multiclass support vector machines [J].
Hsu, CW ;
Lin, CJ .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2002, 13 (02) :415-425
[7]  
Kennedy J, 1997, IEEE SYS MAN CYBERN, P4104, DOI 10.1109/ICSMC.1997.637339
[8]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[9]   Gene selection using hybrid particle swarm optimization and genetic algorithm [J].
Li, Shutao ;
Wu, Xixian ;
Tan, Mingkui .
SOFT COMPUTING, 2008, 12 (11) :1039-1048
[10]   Survival associated pathway identification with group Lp penalized global AUC maximization [J].
Liu, Zhenqiu ;
Magder, Laurence S. ;
Hyslop, Terry ;
Mao, Li .
ALGORITHMS FOR MOLECULAR BIOLOGY, 2010, 5