A penalized criterion for selecting the number of clusters for K-medians
From MaRDI portal
Publication:89462
DOI10.48550/ARXIV.2209.03597arXiv2209.03597MaRDI QIDQ89462FDOQ89462
Sobihan Surendran, Antoine Godichon-Baggioni, Antoine Godichon-Baggioni, Sobihan Surendran
Publication date: 8 September 2022
Abstract: Clustering is a usual unsupervised machine learning technique for grouping the data points into groups based upon similar features. We focus here on unsupervised clustering for contaminated data, i.e in the case where K-medians should be preferred to K-means because of its robustness. More precisely, we concentrate on a common question in clustering: how to chose the number of clusters? The answer proposed here is to consider the choice of the optimal number of clusters as the minimization of a risk function via penalization. In this paper, we obtain a suitable penalty shape for our criterion and derive an associated oracle-type inequality. Finally, the performance of this approach with different types of K-medians algorithms is compared on a simulation study with other popular techniques. All studied algorithms are available in the R package Kmedians on CRAN.
Cited In (1)
This page was built for publication: A penalized criterion for selecting the number of clusters for K-medians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q89462)
