Gene expression data analysis with the clustering method based on an improved quantum-behaved Particle Swarm Optimization

被引:60
作者
Sun, Jun [1 ]
Chen, Wei [1 ]
Fang, Wei [1 ]
Wun, Xiaojun [1 ]
Xu, Wenbo [1 ]
机构
[1] Jiangnan Univ, Key Lab Adv Proc Control Light Ind, Minist Educ, Dept Comp Sci & Technol, Wuxi 214122, Jiangsu, Peoples R China
关键词
Gene expression data; Clustering; Particle Swarm Optimization (PSO); Quantum-behaved Particle Swarm Optimization (QPSO); K-MEANS ALGORITHM; CONVERGENCE; PATTERNS;
D O I
10.1016/j.engappai.2011.09.017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Microarray technology has been widely applied in study of measuring gene expression levels for thousands of genes simultaneously. In this technology, gene cluster analysis is useful for discovering the function of gene because co-expressed genes are likely to share the same biological function. Many clustering algorithms have been used in the field of gene clustering. This paper proposes a new scheme for clustering gene expression datasets based on a modified version of Quantum-behaved Particle Swarm Optimization (QPSO) algorithm, known as the Multi-Elitist QPSO (MEQPSO) model. The proposed clustering method also employs a one-step K-means operator to effectively accelerate the convergence speed of the algorithm. The MEQPSO algorithm is tested and compared with some other recently proposed PSO and QPSO variants on a suite of benchmark functions. Based on the computer simulations, some empirical guidelines have been provided for selecting the suitable parameters of MEQPSO clustering. The performance of MEQPSO clustering algorithm has been extensively compared with several optimization-based algorithms and classical clustering algorithms over several artificial and real gene expression datasets. Our results indicate that MEQPSO clustering algorithm is a promising technique and can be widely used for gene clustering. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:376 / 391
页数:16
相关论文
共 65 条
[1]   A modified fuzzy C-means algorithm for bias field estimation and segmentation of MRI data [J].
Ahmed, MN ;
Yamany, SM ;
Mohamed, N ;
Farag, AA ;
Moriarty, T .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 2002, 21 (03) :193-199
[2]   Using selection to improve particle swarm optimization [J].
Angeline, PJ .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :84-89
[3]  
[Anonymous], 2001, CURRENT TOPICS COMPU
[4]   An improved algorithm for clustering gene expression data [J].
Bandyopadhyay, Sanghamitra ;
Mukhopadhyay, Anirban ;
Maulik, Ujjwal .
BIOINFORMATICS, 2007, 23 (21) :2859-2865
[5]  
Ben-Dor A., 1999, 3 ANN INT C COMP MOL
[6]   Defining a standard for particle swarm optimization [J].
Bratton, Daniel ;
Kennedy, James .
2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, :120-+
[7]  
Clerc M., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1951, DOI 10.1109/CEC.1999.785513
[8]   The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73
[9]   A quantum particle swarm optimizer with chaotic mutation operator [J].
Coelho, Leandro dos Santos .
CHAOS SOLITONS & FRACTALS, 2008, 37 (05) :1409-1418
[10]   Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems [J].
Coelho, Leandro dos Santos .
EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (02) :1676-1683