Skip to main content
Article
A Roadmap of Clustering Algorithms: Finding a Match for a Biomedical Application
Briefings in Bioinformatics (2009)
  • Bill Andreopoulos, Technische Universitaet Dresden
  • Aijun An, York University
  • Xiaogang Wang, York University
  • Michael Schroeder, Technische Universitaet Dresden
Abstract
Clustering is ubiquitously applied in bioinformatics with hierarchical clustering and k-means partitioning being the most popular methods. Numerous improvements of these two clustering methods have been introduced, as well as completely different approaches such as grid-based, density-based and model-based clustering. For improved bioinformatics analysis of data, it is important to match clusterings to the requirements of a biomedical application. In this article, we present a set of desirable clustering features that are used as evaluation criteria for clustering algorithms. We review 40 different clustering algorithms of all approaches and datatypes. We compare algorithms on the basis of desirable clustering features, and outline algorithms' benefits and drawbacks as a basis for matching them to biomedical applications.
Keywords
  • clustering,
  • protein,
  • gene expression,
  • interactome,
  • network,
  • bioinformatics
Disciplines
Publication Date
May, 2009
DOI
10.1093/bib/bbn058
Publisher Statement
SJSU users: use the following link to login and access the article via SJSU databases.
Citation Information
Bill Andreopoulos, Aijun An, Xiaogang Wang and Michael Schroeder. "A Roadmap of Clustering Algorithms: Finding a Match for a Biomedical Application" Briefings in Bioinformatics Vol. 10 Iss. 3 (2009) p. 297 - 314
Available at: http://works.bepress.com/william-andreopoulos/14/