Comparative Study of Data Cluster Analysis for Microarray

International Journal of Computer Trends and Technology (IJCTT)          
© - Issue 2012 by IJCTT Journal
Volume-3 Issue-3                           
Year of Publication : 2012
Authors :Lokesh Kumar Sharma, Sourabh Rungta


Lokesh Kumar Sharma, Sourabh Rungta "Comparative Study of Data Cluster Analysis for Microarray"International Journal of Computer Trends and Technology (IJCTT),V3(3):353-358 Issue 2012 .ISSN Published by Seventh Sense Research Group.

Abstract: -Microarray has been a popular method for representing biological data. Microarray technology allows biologists to monitor genome-wide patterns of gene expression in a high-throughput fashion. Clustering the biological sequences according to their components may reveal the biological functionality among the sequences. Data cluster analysis is an important task in microarray data. There is no clustering algorithm that can be universally used to solve all problems. Therefore in this paper comparative study of data cluster analysis for microarray is presented. Here the most popular cluster algorithms that can be applied for microarray data are discussed. The uncertainty of data, optimization and density estimation are considered for comparison.


[1] A. L. Tarca, R. Romero, and S. Draghici, "Analysis of microarray experiments of gene expression profiling",American Journal of Obstetrics and Gynecology (2006) 195, pp. 373–88.
[2] C. Escudero et al., "Classification of Gene Expression Profiles: Comparison of k-means and expectation maximization algorithms", IEEE Computer Society, 2008, pp. 831-836.
[3] D. Dembele and P. Kastner, "Fuzzy C-means method for clustering microarray data", Bioinformatics, Vol. 19, Issue 8, 2003, pp. 973-980.
[4] E. Naghieh and Y. Peng, “Microarray Gene Expression Data Mining: Clustering Analysis Review”, Techniques, 2009.
[5] J. Sander, M. Ester, H. P. Kriegel and X. Xu, “Density- Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications”, Journal of Data Mining and Knowledge Discovery, Kluwer Academic Publishers vol. 2, 1998 pp. 169-194.
[6] K. Krishna and M. Murty, “Genetic K-Means Algorithm”, IEEE Transactions on Systems Man. and Cybernetics vol. 29, NO. 3, 1999, pp. 433-439.
[7] L. Kaufman and P. J. Rousseeuw, “Finding Group in Data: an Introduction to Cluster Analysis”, John Wiley and Sons, 1990.
[8] L. Raczynski, J. Wozniak, T. Rubel and K. Zaremba,"Application of Density Based Clustering to Microarray Data Analysis", Int. Journal of Electronics and Telecommunications, 2010, Vol. 56, No. 3, pp. 281- 286.
[9] M. Ester, H. P. Kriegel, J. Sander and X. Xu, “A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, In: Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining (KDD’96), Portland, 2006, AAAI Press 291-316.
[10] M. Zhang et al., "A fuzzy C-means algorithm using a correlation metrics and gene ontology", IEEE 19th Int. Conf. on Pattern Recognition, 2008. pp. 1-4.

KeywordsMicroarray Data, Data Cluster Analysis, Bioinformatics.