Bioinformatics Vol. 19 no. 16 2003
pages 2131-2140
© 2003 Oxford University Press
An unsupervised hierarchical dynamic self-organizing approach to cancer class discovery and marker gene identification in microarray data
1 Mechatronics Research Group, Department of Mechanical and Manufacturing Engineering, University of Melbourne, Victoria, Australia 3010 and 2 School of Veterinary Science, University of Melbourne, Victoria, Australia 3010
Received on October 29, 2003
; revised on April 2, 2003
; accepted on April 17, 2003
Motivation: Current Self-Organizing Maps (SOMs) approaches to gene expression pattern clustering require the user to predefine the number of clusters likely to be expected. Hierarchical clustering methods used in this area do not provide unique partitioning of data. We describe an unsupervised dynamic hierarchical self-organizing approach, which suggests an appropriate number of clusters, to perform class discovery and marker gene identification in microarray data. In the process of class discovery, the proposed algorithm identifies corresponding sets of predictor genes that best distinguish one class from other classes. The approach integrates merits of hierarchical clustering with robustness against noise known from self-organizing approaches.
Results: The proposed algorithm applied to DNA microarray data sets of two types of cancers has demonstrated its ability to produce the most suitable number of clusters. Further, the corresponding marker genes identified through the unsupervised algorithm also have a strong biological relationship to the specific cancer class. The algorithm tested on leukemia microarray data, which contains three leukemia types, was able to determine three major and one minor cluster. Prediction models built for the four clusters indicate that the prediction strength for the smaller cluster is generally low, therefore labelled as uncertain cluster. Further analysis shows that the uncertain cluster can be subdivided further, and the subdivisions are related to two of the original clusters. Another test performed using colon cancer microarray data has automatically derived two clusters, which is consistent with the number of classes in data (cancerous and normal).
Availability: JAVA software of dynamic SOM tree algorithm is available upon request for academic use.
Supplementary information: A comparison of rectangular and hexagonal topologies for GSOM is available from http://www.mame.mu.oz.au/mechatronics/journalinfo/Hsu2003supp.pdf
Contact: alhs{at}mame.mu.oz.au