Sparse Convex Clustering

ABSTRACT

Convex clustering, a convex relaxation of k-means clustering and hierarchical clustering, has drawn recent attentions since it nicely addresses the instability issue of traditional nonconvex clustering methods. Although its computational and statistical properties have been recently studied, the performance of convex clustering has not yet been investigated in the high-dimensional clustering scenario, where the data contains a large number of features and many of them carry no information about the clustering structure. In this article, we demonstrate that the performance of convex clustering could be distorted when the uninformative features are included in the clustering. To overcome it, we introduce a new clustering method, referred to as Sparse Convex Clustering, to simultaneously cluster observations and conduct feature selection. The key idea is to formulate convex clustering in a form of regularization, with an adaptive group-lasso penalty term on cluster centers. To optimally balance the trade-off between the cluster fitting and sparsity, a tuning criterion based on clustering stability is developed. Theoretically, we obtain a finite sample error bound for our estimator and further establish its variable selection consistency. The effectiveness of the proposed method is examined through a variety of numerical experiments and a real data application. Supplementary material for this article is available online.

KEYWORDS:

• Convex clustering
• Finite sample error
• Group LASSO
• High-dimensionality
• Sparsity

Supplementary Materials

All technical details for update steps of S-AMA, proofs of Theorems 1–3, and degrees of freedom are included in supplementary material.

Acknowledgments

The authors thank the editor, the associate editor, and two reviewers for their helpful comments and suggestions that substantially improve this article.