> Detailanzeige

Fomin, Fedor V. [VerfasserIn]; Golovach, Petr A. [VerfasserIn]; Inamdar, Tanmay [VerfasserIn]; Purohit, Nidhi [VerfasserIn]; Saurabh, Saket [VerfasserIn] ; Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Nidhi Purohit and Saket Saurabh [MitwirkendeR]

Exact Exponential Algorithms for Clustering Problems

Literatur-
verwaltung

Zur
Merkliste

Lösche von
Merkliste

Per Whatsapp teilen

Schließen

Merkliste



Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
  • Medientyp: Sonstige Veröffentlichung; Elektronischer Konferenzbericht; E-Artikel
  • Titel: Exact Exponential Algorithms for Clustering Problems
  • Beteiligte: Fomin, Fedor V. [VerfasserIn]; Golovach, Petr A. [VerfasserIn]; Inamdar, Tanmay [VerfasserIn]; Purohit, Nidhi [VerfasserIn]; Saurabh, Saket [VerfasserIn]
  • Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
  • Sprache: Englisch
  • DOI: https://doi.org/10.4230/LIPIcs.IPEC.2022.13
  • Schlagwörter: clustering ; k-median ; exact algorithms ; k-means
  • Entstehung:
  • Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Beschreibung: In this paper we initiate a systematic study of exact algorithms for some of the well known clustering problems, namely k-MEDIAN and k-MEANS. In k-MEDIAN, the input consists of a set X of n points belonging to a metric space, and the task is to select a subset C ⊆ X of k points as centers, such that the sum of the distances of every point to its nearest center is minimized. In k-MEANS, the objective is to minimize the sum of squares of the distances instead. It is easy to design an algorithm running in time max_{k ≤ n} {n choose k} n^𝒪(1) = 𝒪^*(2ⁿ) (here, 𝒪^*(⋅) notation hides polynomial factors in n). In this paper we design first non-trivial exact algorithms for these problems. In particular, we obtain an 𝒪^*((1.89)ⁿ) time exact algorithm for k-MEDIAN that works for any value of k. Our algorithm is quite general in that it does not use any properties of the underlying (metric) space - it does not even require the distances to satisfy the triangle inequality. In particular, the same algorithm also works for k-Means. We complement this result by showing that the running time of our algorithm is asymptotically optimal, up to the base of the exponent. That is, unless the Exponential Time Hypothesis fails, there is no algorithm for these problems running in time 2^o(n)⋅n^𝒪(1). Finally, we consider the "facility location" or "supplier" versions of these clustering problems, where, in addition to the set X we are additionally given a set of m candidate centers (or facilities) F, and objective is to find a subset of k centers from F. The goal is still to minimize the k-Median/k-Means/k-Center objective. For these versions we give a 𝒪(2ⁿ (mn)^𝒪(1)) time algorithms using subset convolution. We complement this result by showing that, under the Set Cover Conjecture, the "supplier" versions of these problems do not admit an exact algorithm running in time 2^{(1-ε) n} (mn)^𝒪(1).
  • Zugangsstatus: Freier Zugang