Novel clustering algorithm for microarray expression data in a truncated SVD space

62Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

Abstract

Motivation: This paper introduces the application of a novel clustering method to microarray expression data. Its first stage involves compression of dimensions that can be achieved by applying SVD to the gene-sample matrix in microarray problems. Thus the data (samples or genes) can be represented by vectors in a truncated space of low dimensionality, 4 and 5 in the examples studied here. We find it preferable to project all vectors onto the unit sphere before applying a clustering algorithm. The clustering algorithm used here is the quantum clustering method that has one free scale parameter. Although the method is not hierarchical, it can be modified to allow hierarchy in terms of this scale parameter. Results: We apply our method to three data sets. The results are very promising. On cancer cell data we obtain a dendrogram that reflects correct groupings of cells. In an AML/ALL data set we obtain very good clustering of samples into four classes of the data. Finally, in clustering of genes in yeast cell cycle data we obtain four groups in a problem that is estimated to contain five families.

Cite

CITATION STYLE

APA

Horn, D., & Axel, I. (2003). Novel clustering algorithm for microarray expression data in a truncated SVD space. Bioinformatics, 19(9), 1110–1115. https://doi.org/10.1093/bioinformatics/btg053

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free