A performance analysis of clustering based algorithms for the microarray gene expression data

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    Current advancements in microarray technology permit simultaneous observing of the expression levels of huge number of genes over various time points. Microarrays have obtained amazing implication in the field of bioinformatics. It includes an ordered set of huge different Deoxyribonucleic Acid (DNA) sequences that can be used to measure both DNA as well as Ribonucleic Acid (RNA) dissimilarities. The Gene Expression (GE) summary aids in understanding the basic cause of gene activities, the growth of genes, determining recent disorders like cancer and as well analysing their molecular pharmacology. Clustering is a significant tool applied for analyzing such microarray gene expression data.  It has developed into a greatest part of gene expression analysis. Grouping the genes having identical expression patterns is known as gene clustering. A number of clustering algorithms have been applied for the analysis of microarray gene expression data. The aim of this paper is to analyze the precision level of the microarray data by using various clustering algorithms.


  • Keywords

    Microarray Technology, Gene Expression Data, Clustering Algorithms.

  • References

      [1] Sherlock G, “Analysis of large-scale Gene Expression Data”, Curr. Opin. Immunol., Vol.12, (2000), pp. 201–205,.

      [2] Segal E, Friedman N, Kaminski N, Regev A & Koller D, “From signatures to models: understanding cancer using microarrays”, Nature Genetics, Vol.37, (2005), pp.38-45,.

      [3] Mann AK & Kaur N, “Survey paper on clustering techniques”, Ijsetr, Vol.2, No. 4, (2013), pp.803–806.

      [4] Lipschultz RJ, Fodor SPA, Gingeras TR & Lockhar DJ, ‘High density synthetic oligonucleotide arrays’, Suppl Nat. Genet., Vol.21, (1999), pp.20-24.

      [5] Bowtell DDL, ‘Options available from start to finish- for obtaining expression data by microarray’, Nature, Vol.21, (1999), pp.25-32.

      [6] Tavazoie S, Hughes D, Campbell MJ, Cho RJ & Church GM, ‘Systematic determination of genetic network architecture’, Nature Genet, (1999), pp.281–285.

      [7] Yogita R & Harish R, ‘A Study of Hierarchical Clustering Algorithm’, International Journal of Information and Computation Technology, Vol.3, No.11, (2013), pp.1225-1232.

      [8] Kaufman L & Rousseeuw PJ, Finding Groups in Data, Wiley, (1990).

      [9] Zahra Z, Amirhossein H & Ali MN, “Computational methodologies for analyzing, modeling and controlling gene regulatory networks”, Biomedical Engineering and Computational Biology, Vol.2, (2010), pp.47–62.

      [10] Dey L & Mukhopadhyay A, ‘Microarray Gene Expression Data Clustering using PSO based K-means Algorithm’, Proceedings of the International Conference Advanced Computing, Communication and Networks, (2011), pp.587-591.

      [11] Kohonen T, ‘The self-organizing map’, Proc. IEEE, Vol.78, No.9, (1990), pp.1464–1480.

      [12] Vesanto J & Alhoniemi E, ‘Clustering of the Self Organizing Map’, IEEE Transactions on Neural Networks, Vol.11, (2000), pp.586–600.

      [13] Ester M, Kriegel HP, Sander J & Xu X, ‘A density-based algorithm for discovering clusters in large spatial databases with noise’, Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, (1996), pp.226–231.

      [14] Adriano M, Maribel, Y & Sofia C, “Density based clustering algorithms”, DBSCAN and SNN, (2005).

      [15] Huang Z, “A fast clustering algorithm to cluster very large categorical data sets in data mining”, Proceedings of the SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery. Tucson, (1997), pp.146-151.

      [16] Hinneburg A & Keim D, “An efficient approach to clustering in large multimedia databases with noise”, American Association for Artificial Intelligence, (1998), pp.58-65.

      [17] Zhang T, Ramakrishnan R & Livny M, “BIRCH An efficient data clustering method for very large databases”, SIGMOD International Conference on Management of Data, (1996), pp.103-114.




Article ID: 12172
DOI: 10.14419/ijet.v7i2.21.12172

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.