TY - GEN
T1 - Local algorithms for interactive clustering
AU - Awasthi, Pranjal
AU - Balcan, Maria Fiorina
AU - Voevodski, Konstantin
N1 - Publisher Copyright: Copyright © (2014) by the International Machine Learning Society (IMLS) All rights reserved.
PY - 2014
Y1 - 2014
N2 - 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 local changes in each step; both are desirable features in many applications. We show that in this constrained setting one can still design provably efficient algorithms that produce accurate clusterings. We also show that our algorithms perform well on real-world data.
AB - 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 local changes in each step; both are desirable features in many applications. We show that in this constrained setting one can still design provably efficient algorithms that produce accurate clusterings. We also show that our algorithms perform well on real-world data.
UR - http://www.scopus.com/inward/record.url?scp=84919928721&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84919928721&partnerID=8YFLogxK
M3 - Conference contribution
T3 - 31st International Conference on Machine Learning, ICML 2014
SP - 1946
EP - 1954
BT - 31st International Conference on Machine Learning, ICML 2014
PB - International Machine Learning Society (IMLS)
T2 - 31st International Conference on Machine Learning, ICML 2014
Y2 - 21 June 2014 through 26 June 2014
ER -