Electronic Journal of Statistics
- Electron. J. Statist.
- Volume 6 (2012), 148-167.
Regularized k-means clustering of high-dimensional data and its asymptotic consistency
K-means clustering is a widely used tool for cluster analysis due to its conceptual simplicity and computational efficiency. However, its performance can be distorted when clustering high-dimensional data where the number of variables becomes relatively large and many of them may contain no information about the clustering structure. This article proposes a high-dimensional cluster analysis method via regularized k-means clustering, which can simultaneously cluster similar observations and eliminate redundant variables. The key idea is to formulate the k-means clustering in a form of regularization, with an adaptive group lasso penalty term on cluster centers. In order to optimally balance the trade-off between the clustering model fitting and sparsity, a selection criterion based on clustering stability is developed. The asymptotic estimation and selection consistency of the regularized k-means clustering with diverging dimension is established. The effectiveness of the regularized k-means clustering is also demonstrated through a variety of numerical experiments as well as applications to two gene microarray examples. The regularized clustering framework can also be extended to the general model-based clustering.
Electron. J. Statist. Volume 6 (2012), 148-167.
First available in Project Euclid: 3 February 2012
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Sun, Wei; Wang, Junhui; Fang, Yixin. Regularized k-means clustering of high-dimensional data and its asymptotic consistency. Electron. J. Statist. 6 (2012), 148--167. doi:10.1214/12-EJS668. https://projecteuclid.org/euclid.ejs/1328280901