Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 31103

Select areas to restrict search in scientific publication database:
A Cuckoo Search with Differential Evolution for Clustering Microarray Gene Expression Data
A DNA microarray technology is a collection of microscopic DNA spots attached to a solid surface. Scientists use DNA microarrays to measure the expression levels of large numbers of genes simultaneously or to genotype multiple regions of a genome. Elucidating the patterns hidden in gene expression data offers a tremendous opportunity for an enhanced understanding of functional genomics. However, the large number of genes and the complexity of biological networks greatly increase the challenges of comprehending and interpreting the resulting mass of data, which often consists of millions of measurements. It is handled by clustering which reveals the natural structures and identifying the interesting patterns in the underlying data. In this paper, gene based clustering in gene expression data is proposed using Cuckoo Search with Differential Evolution (CS-DE). The experiment results are analyzed with gene expression benchmark datasets. The results show that CS-DE outperforms CS in benchmark datasets. To find the validation of the clustering results, this work is tested with one internal and one external cluster validation indexes.
Digital Object Identifier (DOI):


[1] U. Alon, N. Barkai, D.A. Notterman, K. Gish, S. Ybarra, D. Mack, and A.J. Levine, “Broad Patterns of Gene Expression Revealed by Clustering Analysis of Tumor and Normal Colon Tissues Probed by Oligonucleotide Array”, In Proc. of the Natl. Acad. Sci. U.S.A., Vol. 96, No. 12, pp. 6745-6750, 1999.
[2] C. Ding, “Analysis of Gene Expression Profiles: Class Discovery and Leaf Ordering”, In Proc. of the Int. Conf. Comput. Mol. Biol. (RECOMB), Berlin, Germany, pp. 27-136, 2002.
[3] A.K. Jain, M.N. Murty, and P.J. Flynn, “Data Clustering: A Review”, ACM Comput. Surv., Vol. 31, pp. 264-323, 1999.
[4] A. Ben-Dor, R. Shamir, and Z. Yakhini, “Clustering Gene Expression Patterns”, J. Comput. Biol., Vol. 6, No 3, pp. 281-297, 1999.
[5] X.S. Yang, & S. Deb, “Cuckoo search via Levy flights” Proc. of World Congress on Nat. & Biologically Inspired Comput., pp. 210 – 214, 2009.
[6] F. Fazel, L. Ganming, L. Ziying, “Evaluation and optimization of clustering in gene expression data analysis”, BMC Bioinf., Vol. 20, No. 10, pp. 1535-1545, 2004.
[7] L. Nazareth, P. Tseng, “Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search”, Comput. Optim. Appl, Vol. 22, no. 1, pp. 133–144, 2002.
[8] D. G. Vito, G. Raffaele, L. B. Giosu, R. Alessandra, and S. Davide, “GenClust: A genetic algorithm for clustering gene expression data”, BMC Bioinf., Vol. 280, No.6, pp. 1-11, 2005.
[9] P.C.H. Ma, K.C.C. Chan, X. Yao, and D.K.Y. Chiu, “An evolutionary clustering algorithm for gene expression microarray data analysis”, IEEE Trans. Evol. Comput., Vol. 10, No. 3, pp. 296-314, 2006.
[10] R. Kustra, “A factor analysis model for functional genomics”, BMC Bioinf., Vol. 216, No. 7, pp. 1-13, 2006.
[11] G. Kerr, H. J. Ruskin, M. Crane, and P. Doolan, “Techniques for clustering gene expression data”, Comput. Biol. Med., Vol. 38, pp. 283–293, 2007.
[12] D. Zhihua, W. Yiwei, J. Zhen, “PK-means: A new algorithm for gene clustering”, Comput. Biol. Chem., Vol. 32, pp.243-247, 2008.
[13] L. Wei, B. Wang, G. Jarka, M. Elaine, and Z. Jian, “A novel methodology for finding the regulation on gene expression data”, Proc. Nat. Sci., Vol. 19, pp. 267-272, 2009.
[14] Rui Xu and D.C. Wunsch,” Clustering Algorithms in Biomedical Research: A Review”, IEEE Rev. Biomed. Eng., Vol. 3, pp. 120 – 154, 2010.
[15] Sajid Nagi, D.K. Bhattacharyya, and J.K. Kalita, “Subspace Clustering in Gene Expression Data Analysis: A Survey, in Machine Intelligence: Recent Advances”, Narosa Publ., Delhi, pp. 211-219, 2011.
[16] J. Jacinth Salome and R.M. Suresh, “Efficient Clustering for Gene Expression Data”, Int. J. Comput. Appl., Vol. 47, pp. 30-35, 2012.
[17] P. A. Jaskowiak and R.J.G.B Campello, “Comparing correlation coefficients as dissimilarity measures for cancer classification in gene expression data”, Proc. Braz. Symp. Bioinf. Brasilia. Braz, pp. 1-8, 2011.
[18] N. Arulanand, S. Subramanian and K. Premalatha “An Enhanced Cuckoo Search for Optimization of Bloom Filter in Spam Filtering,” Global J. comp. Scie. Tech., vol. 12, no. 1, Jan. 2012.
[19] N. Arulanand, S. Subramanian and K. Premalatha “A Comparison study of cuckoo-bat search for Optimization of Bloom Filter in Spam Filtering,” Int. J. Bio-Inspired Comput., vol. 4, no. 2, pp.89-99, June 2012.
[20] X.S. Yang, and S. Deb, “Engineering optimisation by Cuckoo search” Int. J. Math. Modeil. Numer. optim., vol. 1, no. 4, pp. 330-343, Dec. 2010.
[21] P. Spellman, G. Sherlock, M.Q. Zhang, V.R. Iyer, K. Anders, M.B. Eisen, P.O. Brown, D. Botstein, and Futcher, (1998) “Comprehensive identification of cell cycle regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization”, Mol. Biol. Cell, Vol. 9, pp - 3273-3297, 1998.
[22] P. Gray, W.E. Hart, L. Painton, C. Phillips, M. Trahan, and J. Wagner, “A Survey of Global Optimization Methods”, Tech. Rep., Sandia Nat. Lab, 2000.
[23] L. Hubert, P. Arabie, P. “Comparing partitions” Journal of Classification, 2:193–218, 1985.
[24] Kuncheva, I. Ludmila, Hadjitodorov, T. Stefan, “Using Diversity in Cluster Ensembles” IEEE SMC Int. Conf. on Sys., pp. 345-353, 2004.
Vol:15 No:03 2021Vol:15 No:02 2021Vol:15 No:01 2021
Vol:14 No:12 2020Vol:14 No:11 2020Vol:14 No:10 2020Vol:14 No:09 2020Vol:14 No:08 2020Vol:14 No:07 2020Vol:14 No:06 2020Vol:14 No:05 2020Vol:14 No:04 2020Vol:14 No:03 2020Vol:14 No:02 2020Vol:14 No:01 2020
Vol:13 No:12 2019Vol:13 No:11 2019Vol:13 No:10 2019Vol:13 No:09 2019Vol:13 No:08 2019Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007