Fast iterative gene clustering based on information theoretic criteria for selecting the cluster structure.
Grouping of genes into clusters according to their expression levels is important for deriving biological information, e.g., on gene functions based on microarray and other related analyses. The paper introduces the selection of the number of clusters based on the minimum description length (MDL) principle for the selection of the number of clusters in gene expression data. The main feature of the new method is the ability to evaluate in a fast way the number of clusters according to the sound MDL principle, without exhaustive evaluations over all possible partitions of the gene set. The estimation method can be used in conjunction with various clustering algorithms. A recent clustering algorithm using principal component analysis, the "gene shaving" (GS) procedure, can be modified to make use of the new MDL estimation method, replacing the Gap statistics originally used in GS algorithm. The resulting clustering algorithm is shown to perform better than GS-Gap and CEM (classification expectation maximization), in the simulations using artificial data. The proposed method is applied to B-cell differentiation data, and the resulting clusters are compared with those found by self-organizing maps (SOM).
Giurcăneanu
Ciprian Doru
CD
Institute of Signal Processing, Tampere University of Technology, P. O. Box 553, FIN-33101 Tampere, Finland.
Tăbuş
Ioan
I
Astola
Jaakko
J
Ollila
Juha
J
Vihinen
Mauno
M
D000465:Algorithms; D001402:B-Lymphocytes / Q000166:cytology / Q000502:physiology; D002454:Cell Differentiation; D016000:Cluster Analysis; D019295:Computational Biology; D030541:Databases, Genetic; D020869:Gene Expression Profiling / Q000706:statistics & numerical data; D006801:Humans; D007257:Information Theory; D008957:Models, Genetic; D005810:Multigene Family; D011338:Probability Theory