Regularized K-means through hard-thresholding

DOI10.48550/ARXIV.2010.00950MaRDI QIDQ100789arXivFDO

Authors Jakob Raymaekers, Ruben Zamar

Publication date 2 October 2020

Abstract: We study a framework of regularized $K$-means methods based on direct penalization of the size of the cluster centers. Different penalization strategies are considered and compared through simulation and theoretical analysis. Based on the results, we propose HT $K$-means, which uses an $el{l}_0$ penalty to induce sparsity in the variables. Different techniques for selecting the tuning parameter are discussed and compared. The proposed method stacks up favorably with the most popular regularized $K$-means methods in an extensive simulation study. Finally, HT $K$-means is applied to several real data examples. Graphical displays are presented and used in these examples to gain more insight into the datasets.

Cited in

(1)

• clusterHD

This page was built for publication: Regularized K-means through hard-thresholding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q100789)