Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Comparison of clustering approaches for gene expression data
Blekinge Institute of Technology, School of Computing.ORCID iD: 0000-0002-8929-7220
Blekinge Institute of Technology, School of Computing.
2013 (English)In: Frontiers in Artificial Intelligence and Applications, IOS Press , 2013, Vol. 257, p. 55-64Conference paper, Published paper (Refereed)
Abstract [en]

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, p. 55-64
Keywords [en]
Dynamic time warping, Gene expression data, Graph-based clustering algorithm, Minimum cut clustering, Partitioning algorithm
National Category
Software Engineering
Identifiers
URN: urn:nbn:se:bth-6357DOI: 10.3233/978-1-61499-330-8-55ISI: 000343477100007Local ID: oai:bth.se:forskinfoF6F6EAEE6B2430D2C1257CA600374AA9OAI: oai:DiVA.org:bth-6357DiVA, id: diva2:833855
Conference
Scandinavian Conference on Artificial Intelligence SCAI 2013
Available from: 2015-05-25 Created: 2014-03-25 Last updated: 2021-03-31Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Borg, AntonLavesson, NiklasBoeva, Veselka

Search in DiVA

By author/editor
Borg, AntonLavesson, NiklasBoeva, Veselka
By organisation
School of Computing
Software Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 260 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf