Comparison of clustering approaches for gene expression data
2013 (English)In: Frontiers in Artificial Intelligence and Applications, IOS Press , 2013, Vol. 257, 55-64 p.Conference paper (Refereed)
Clustering algorithms have been used to divide genes into groups according to the degree of their expression similarity. Such a grouping may suggest that the respective genes are correlated and/or co-regulated, and subsequently indicates that the genes could possibly share a common biological role. In this paper, four clustering algorithms are investigated: k-means, cut-clustering, spectral and expectation-maximization. The algorithms are benchmarked against each other. The performance of the four clustering algorithms is studied on time series expression data using Dynamic TimeWarping distance in order to measure similarity between gene expression profiles. Four different cluster validation measures are used to evaluate the clustering algorithms: Connectivity and Silhouette Index for estimating the quality of clusters, Jaccard Index for evaluating the stability of a cluster method and Rand Index for assessing the accuracy. The obtained results are analyzed by Friedman's test and the Nemenyi post-hoc test. K-means is demonstrated to be significantly better than the spectral clustering algorithm under the Silhouette and Rand validation indices.
Place, publisher, year, edition, pages
IOS Press , 2013. Vol. 257, 55-64 p.
Dynamic time warping, Gene expression data, Graph-based clustering algorithm, Minimum cut clustering, Partitioning algorithm
IdentifiersURN: urn:nbn:se:bth-6357DOI: 10.3233/978-1-61499-330-8-55ISI: 000343477100007Local ID: oai:bth.se:forskinfoF6F6EAEE6B2430D2C1257CA600374AA9OAI: oai:DiVA.org:bth-6357DiVA: diva2:833855
Scandinavian Conference on Artificial Intelligence SCAI 2013