54 citations · 113 across the 6 of their papers we have counts for
3 papers · 1 filter
Local algorithms for interactive clustering
Pranjal Awasthi, Maria-Florina Balcan, Konstantin Voevodski
We study the design of interactive clustering algorithms for data sets satisfying natural stability assumptions. Our algorithms start with any initial clustering and only make loca…
Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function
Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2
We study the problem of efficiently clustering protein sequences in a limited information setting. We assume that we do not know the distances between the sequences in advance, and…
Efficient Clustering with Limited Distance Information
Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model w…