Clustering to the Fewest Clusters Under Intra-Cluster Dissimilarity Constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Clustering to the Fewest Clusters Under Intra-Cluster Dissimilarity Constraints

Abstract

This paper introduces the equiwide clustering problem, where valid partitions must satisfy intra-cluster dissimilarity constraints. Unlike most existing clustering algorithms, equiwide clustering relies neither on density nor on a predefined number of expected classes, but on a dissimilarity threshold. Its main goal is to ensure an upper bound on the error induced by ultimately replacing any object with its cluster representative. Under this constraint, we then primarily focus on minimizing the number of clusters, along with potential sub-objectives. We argue that equiwide clustering is a sound clustering problem, and discuss its relationship with other optimization problems, existing and novel implementations as well as approximation strategies. We review and evaluate suitable clustering algorithms to identify trade-offs between the various practical solutions for this clustering problem.
Fichier principal
Vignette du fichier
eqw_ictai2021.pdf (146.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03356000 , version 1 (27-09-2021)

Identifiers

Cite

Jennie Andersen, Brice Chardin, Mohamed Tribak. Clustering to the Fewest Clusters Under Intra-Cluster Dissimilarity Constraints. Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, Nov 2021, Athens, Greece. ⟨10.1109/ICTAI52525.2021.00036⟩. ⟨hal-03356000⟩
103 View
108 Download

Altmetric

Share

Gmail Facebook X LinkedIn More