Novel Clustering Algorithm for Microarray Expression Data in A Truncated SVD Space


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. AVAILABILITY Software is available as Matlab programs at

DOI: 10.1093/bioinformatics/btg053

Extracted Key Phrases

2 Figures and Tables


Citations per Year

60 Citations

Semantic Scholar estimates that this publication has 60 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Horn2003NovelCA, title={Novel Clustering Algorithm for Microarray Expression Data in A Truncated SVD Space}, author={David Horn and Inon Axel}, journal={Bioinformatics}, year={2003}, volume={19 9}, pages={1110-5} }