13/04/2021

Large scale k-median clustering for stable clustering instances

Konstantin Voevodski

Keywords:

Abstract Paper Similar Papers

Abstract: We study the problem of computing a good k-median clustering in a parallel computing environment. We design an efficient algorithm that gives a constant-factor approximation to the optimal solution for stable clustering instances. The notion of stability that we consider is resilience to perturbations of the distances between the points. Our computational experiments show that our algorithm works well in practice - we are able to find better clusterings than Lloyd’s algorithm and a centralized coreset construction using samples of the same size.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at AISTATS 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 14:46 
 0
 0
 0
 0
 4:58 
 0
 0
 0
 0
 19:28 
 0
 0
 0
 0
 8:38 
 0
 0
 0
 0
 3:20 
 0
 0
 0
 0
 9:26 
 0
 0
 0
 0
 5:05 
 0
 0
 0
 0
 15:47 
 0
 0
 0
 0
 5:03 
 0
 0
 1
 1
 14:52 
 0
 0
 0
 0
 15:31 
 0
 0
 0
 0
 3:08 
 0
 0
 0
 0
 17:56 
 0
 0
 0
 0
 10:22 
 0
 0
 0
 0
 13:45 
 0
 0
 0
 0
 14:02 
 0
 0
 0
 0
 3:02 
 0
 0
 0
 0
 3:17 
 0
 0
 0
 0
 15:58 
 0
 0
 0
 0
 3:12 
 0
 0
 0
 0
 5:18 
 0
 0
 0
 0
 11:51 
 0
 0
 0
 0
 8:28 
 0
 0
 0
 0
 14:49 
 0
 1
 0
 0
 11:54 
 0
 0
 0
 0
 15:20 
 0
 0
 0
 0
 14:43 
 0
 0
 0
 0
 2:52 
 0
 0
 0
 0
 3:13 
 0
 0
 0
 0
 10:54 
 0
 0
 0
 0
 20:09 
 0
 0
 0
 0
 15:15 
 0
 0
 0
 0
 10:41 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 14:49 
 0
 0
 0
 0
 15:04 
 0
 0
 0
 0
 13:28 
 0
 0
 0
 0
 5:53 
 0
 0
 0
 0
 17:26 
 0
 0
 0
 0
 3:13