title: Penalized model-based clustering with unconstrained covariance matrices.
abstract: Clustering is one of the most useful tools for high-dimensional analysis, e.g., for microarray data. It becomes challenging in presence of a large number of noise variables, which may mask underlying clustering structures. Therefore, noise removal through variable selection is necessary. One effective way is regularization for simultaneous parameter estimation and variable selection in model-based clustering. However, existing methods focus on regularizing the mean parameters representing centers of clusters, ignoring dependencies among variables within clusters, leading to incorrect orientations or shapes of the resulting clusters. In this article, we propose a regularized Gaussian mixture model permitting a treatment of general covariance matrices, taking various dependencies into account. At the same time, this approach shrinks the means and covariance matrices, achieving better clustering and variable selection. To overcome one technical challenge in estimating possibly large covariance matrices, we derive an E-M algorithm utilizing the graphical lasso (Friedman et al 2007) for parameter estimation. Numerical examples, including applications to microarray gene expression data, demonstrate the utility of the proposed method.
authors.affiliation: Division of Biostatistics, School of Public Health, University of Minnesota zhoux292@umn.edu.
authors.forename: Hui
authors.initials: H
authors.lastname: Zhou
authors.forename: Wei
authors.initials: W
authors.lastname: Pan
authors.forename: Xiaotong
authors.initials: X
authors.lastname: Shen
references.citation: Bioinformatics. 2010 Feb 15;26(4):501-8
references.pmid: 20031967
references.citation: Bioinformatics. 2007 Aug 1;23(15):1945-51
references.pmid: 17540680
references.citation: Biostatistics. 2008 Jul;9(3):432-41
references.pmid: 18079126
references.citation: Bioinformatics. 2006 Oct 1;22(19):2405-12
references.pmid: 16882653
references.citation: Comput Biol Chem. 2005 Feb;29(1):37-46
references.pmid: 15680584
references.citation: Proc Natl Acad Sci U S A. 2003 Sep 16;100(19):10623-8
references.pmid: 12963823
references.citation: Pediatr Nephrol. 2004 Oct;19(10):1145-7
references.pmid: 15258844
references.citation: Ann Appl Stat. 2009 Jun 1;3(2):521-541
references.pmid: 21643444
references.citation: Proc Natl Acad Sci U S A. 1998 Dec 8;95(25):14863-8
references.pmid: 9843981
references.citation: Bioinformatics. 2006 Oct 1;22(19):2388-95
references.pmid: 16870935
references.citation: Nat Genet. 1999 Jul;22(3):281-5
references.pmid: 10391217
references.citation: BMC Bioinformatics. 2006 Sep 07;7:407
references.pmid: 16959042
references.citation: Bioinformatics. 2006 Apr 1;22(7):795-801
references.pmid: 16434443
references.citation: J Bioinform Comput Biol. 2007 Aug;5(4):875-93
references.pmid: 17787061
references.citation: Electron J Stat. 2008;2:168-212
references.pmid: 19920875
references.citation: Biometrics. 2010 Sep;66(3):793-804
references.pmid: 19912170
references.citation: Biometrics. 2008 Jun;64(2):440-8
references.pmid: 17970821
references.citation: Bioinformatics. 2002 Mar;18(3):413-22
references.pmid: 11934740
references.citation: Int J Cancer. 2002 Apr 20;98(6):895-9
references.pmid: 11948469
references.citation: Biometrics. 2008 Sep;64(3):921-930
references.pmid: 18162109
references.citation: Bioinformatics. 2007 Sep 1;23(17):2247-55
references.pmid: 17597097
references.citation: Science. 1999 Oct 15;286(5439):531-7
references.pmid: 10521349