Weight-based search to find clusters around medians in subspaces - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Weight-based search to find clusters around medians in subspaces

Abstract

There exist several clustering paradigms, leading to different techniques that are complementary in the analyst toolbox, each having its own merits and interests. Among these techniques, the K-medians approach is recognized as being robust to noise and outliers, and is an important optimization task with many different applications (e.g., facility location). In the context of subspace clustering, several paradigms have been investigated (e.g., centroid-based, cell-based), while the median-based approach has received less attention. Moreover, using standard subspace clustering outputs (e.g., centroids, medoids) there is no straightforward procedure to compute the cluster membership that optimizes the dispersion around medians. This paper advocates for the use of median-based subspace clustering as a complementary tool. Indeed, it shows that such an approach exhibits satisfactory quality clusters when compared to well-established paradigms, while medians have still their own interests depending on the user application (robustness to noise/outliers and location optimality). This paper shows that a weight-based hill climbing algorithm using a stochastic local exploration step can be sufficient to produce the clusters.
Fichier principal
Vignette du fichier
prelim_subcmedians.pdf (687.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01869974 , version 1 (07-09-2018)

Identifiers

  • HAL Id : hal-01869974 , version 1

Cite

Sergio Peignier, Christophe Rigotti, Anthony Rossi, Guillaume Beslon. Weight-based search to find clusters around medians in subspaces. SAC 2018 - ACM Symposium On Applied Computing, Apr 2018, Pau, France. pp.1-10. ⟨hal-01869974⟩
171 View
195 Download

Share

Gmail Facebook X LinkedIn More