Sublinear-time approximation for clustering via random sampling

被引:0
|
作者
Czumaj, A [1 ]
Sohler, C
机构
[1] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA
[2] Univ Gesamthsch Paderborn, Heinz Nixdorf Inst, D-33102 Paderborn, Germany
[3] Univ Gesamthsch Paderborn, Dept Comp Sci, D-33102 Paderborn, Germany
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum k-clustering, and balanced k-median. For all these problems we consider the following simple sampling scheme: select a small sample set of points uniformly at random from V and then run some approximation algorithm on this sample set to compute an approximation of the best possible clustering of this set. Our main technical contribution is a significantly strengthened analysis of the approximation guarantee by this scheme for the clustering problems. The main motivation behind our analyses was to design sublinear-time algorithms for clustering problems. Our second contribution is the development of new approximation algorithms for the aforementioned clustering problems. Using our random sampling approach we obtain for the first time approximation algorithms that have the running time independent of the input size, and depending on k and the diameter of the metric space only.
引用
收藏
页码:396 / 407
页数:12
相关论文
共 50 条
  • [1] Sublinear-time approximation algorithms for clustering via random sampling
    Czumaj, Artur
    Sohler, Christian
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2007, 30 (1-2) : 226 - 256
  • [2] Sublinear Time Eigenvalue Approximation via Random Sampling
    Bhattacharjee, Rajarshi
    Dexter, Gregory
    Drineas, Petros
    Musco, Cameron
    Ray, Archan
    [J]. ALGORITHMICA, 2024, 86 (06) : 1764 - 1829
  • [3] Sublinear Time Eigenvalue Approximation via Random Sampling
    Bhattacharjee, Rajarshi
    Dexter, Gregory
    Drineas, Petros
    Musco, Cameron
    Ray, Archan
    [J]. arXiv, 2021,
  • [4] Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
    Aliakbarpour, Maryam
    Biswas, Amartya Shankha
    Gouleakis, Themis
    Peebles, John
    Rubinfeld, Ronitt
    Yodpinyanee, Anak
    [J]. ALGORITHMICA, 2018, 80 (02) : 668 - 697
  • [5] Sublinear-Time Clustering Oracle for Signed Graphs
    Neumann, Stefan
    Peng, Pan
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [6] A sublinear-time approximation scheme for bin packing
    Batu, Tugkan
    Berenbrink, Petra
    Sohler, Christian
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5082 - 5092
  • [7] Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
    Maryam Aliakbarpour
    Amartya Shankha Biswas
    Themis Gouleakis
    John Peebles
    Ronitt Rubinfeld
    Anak Yodpinyanee
    [J]. Algorithmica, 2018, 80 : 668 - 697
  • [8] Differentially-Private Sublinear-Time Clustering
    Blocki, Jeremiah
    Grigorescu, Elena
    Mukherjee, Tamalika
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 332 - 337
  • [9] Improved approximation guarantees for sublinear-time Fourier algorithms
    Iwen, Mark A.
    [J]. APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2013, 34 (01) : 57 - 82
  • [10] Sublinear-time approximation of Euclidean minimum spanning tree
    Czumaj, A
    Ergün, F
    Fortnow, L
    Magen, A
    Newman, I
    Rubinfeld, R
    Sohler, C
    [J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 813 - 822