Show simple item record

Building Clusters with Lower-Bounded Sizes

hal.structure.identifierLebanese American University [LAU]
dc.contributor.authorAbu-Khzam, Faisal N.*
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorBazgan, Cristina*
hal.structure.identifier
dc.contributor.authorCasel, Katrin*
hal.structure.identifier
dc.contributor.authorFernau, Henning*
dc.date.accessioned2017-01-11T10:36:47Z
dc.date.available2017-01-11T10:36:47Z
dc.date.issued2016
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/16148
dc.descriptionin Leibniz International Proceedings in Informatics (LIPICS), vol. 64en
dc.language.isoenen
dc.subjectClusteringen
dc.subjectApproximation Algorithmsen
dc.subjectComplexityen
dc.subjectMatchingen
dc.subject.ddc003en
dc.subject.classificationjelC.C4.C44en
dc.titleBuilding Clusters with Lower-Bounded Sizesen
dc.typeCommunication / Conférence
dc.description.abstractenClassical 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.en
dc.identifier.citationpages148:1–148:12en
dc.relation.ispartoftitle27th International Symposium on Algorithms and Computation, ISAAC 2016en
dc.relation.ispartofeditorHong, Seok-Hee
dc.relation.ispartofpublnameSchloss Dagstuhl--Leibniz-Zentrum fuer Informatiken
dc.relation.ispartofpublcityWadern (Germany)en
dc.relation.ispartofdate2016
dc.contributor.countryeditoruniversityotherLEBANON
dc.contributor.countryeditoruniversityotherGERMANY
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn978-3-95977-026-2en
dc.relation.conftitle27th International Symposium on Algorithms and Computation, ISAAC 2016en
dc.relation.confdate2016-12
dc.relation.confcitySydneyen
dc.relation.confcountryAustraliaen
dc.relation.forthcomingnonen
dc.identifier.doi10.4230/LIPIcs.ISAAC.2016.148en
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewednonen
dc.relation.Isversionofjnlpeerreviewednonen
dc.date.updated2017-01-11T10:27:42Z
hal.identifierhal-01431796*
hal.version1*
hal.update.actionupdateFiles*
hal.update.actionupdateMetadata*
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

Thumbnail
Name:
LIPIcs-ISAAC-2016-4.pdf
Size:
499.9Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record