Building Clusters with Lower-Bounded Sizes
Abu-Khzam, Faisal N.; Bazgan, Cristina; Casel, Katrin; Fernau, Henning (2016), Building Clusters with Lower-Bounded Sizes, in Hong, Seok-Hee, 27th International Symposium on Algorithms and Computation, ISAAC 2016, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik : Wadern (Germany), p. 148:1–148:12. 10.4230/LIPIcs.ISAAC.2016.148
TypeCommunication / Conférence
Conference title27th International Symposium on Algorithms and Computation, ISAAC 2016
Book title27th International Symposium on Algorithms and Computation, ISAAC 2016
Book authorHong, Seok-Hee
MetadataShow full item record
Author(s)Abu-Khzam, Faisal N.
Lebanese American University [LAU]
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)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.
Subjects / KeywordsClustering; Approximation Algorithms; Complexity; Matching
Showing items related by title and author.
Abu-Khzam, Faisal N.; Bazgan, Cristina; Chopin, Morgan; Fernau, Henning (2016) Article accepté pour publication ou publié
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis (2016) Communication / Conférence