Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2018

Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework

Résumé

Classical clustering problems search for a partition of objects into a fixed number of clusters. In many scenarios, however, the number of clusters is not known or necessarily fixed. Further, clusters are sometimes only considered to be of significance if they have a certain size. We discuss clustering into sets of minimum cardinality k without a fixed number of sets and present a general model for these types of problems. This general framework allows the comparison of different measures to assess the quality of a clustering. We specifically consider nine quality-measures and classify the complexity of the resulting problems with respect to k. Further, we derive some polynomial-time solvable cases for k=2 with connections to matching-type problems which, among other graph problems, then are used to compute approximations for larger values of k.
Fichier non déposé

Dates et versions

hal-02408730 , version 1 (13-12-2019)

Identifiants

Citer

Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau. Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica, 2018, 80 (9), ⟨10.1007/s00453-017-0374-5⟩. ⟨hal-02408730⟩
36 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More