A framework for feature selection in clustering.
We consider the problem of clustering observations using a potentially large set of features. One might expect that the true underlying clusters present in the data differ only with respect to a small fraction of the features, and will be missed if one clusters the observations using the full set of features. We propose a novel framework for sparse clustering, in which one clusters the observations using an adaptively chosen subset of the features. The method uses a lasso-type penalty to select the features. We use this framework to develop simple methods for sparse K-means and sparse hierarchical clustering. A single criterion governs both the selection of the features and the resulting clusters. These approaches are demonstrated on simulated data and on genomic data sets.
Witten
Daniela M
DM
Tibshirani
Robert
R
Bioinformatics. 2001 Jun;17(6):520-5
11395428
Nature. 1999 Oct 21;401(6755):788-91
10548103
Biometrics. 2009 Sep;65(3):701-9
19210744
Nature. 2000 Aug 17;406(6797):747-52
10963602
Biometrics. 2008 Jun;64(2):440-8
17970821
Nature. 2005 Oct 27;437(7063):1299-320
16255080
Proc Natl Acad Sci U S A. 2007 Apr 3;104(14):5959-64
17389406
Biostatistics. 2006 Apr;7(2):286-301
16301308
Proc Natl Acad Sci U S A. 1998 Dec 8;95(25):14863-8
9843981
Nat Genet. 2006 Aug;38(8):904-9
16862161
Biostatistics. 2008 Jul;9(3):467-83
18093965
Biostatistics. 2009 Jul;10(3):515-34
19377034
Bioinformatics. 2002 Mar;18(3):413-22
11934740
Nature. 2007 Oct 18;449(7164):851-61
17943122
Electron J Stat. 2008;2:168-212
19920875
Bioinformatics. 2002 Feb;18(2):275-86
11847075