Local algorithms for interactive clustering

Pranjal Awasthi, Maria Balcan, Konstantin Voevodski
Proceedings of the 31st International Conference on Machine Learning, PMLR 32(2):550-558, 2014.

Abstract

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.

Cite this Paper

BibTeX
@InProceedings{pmlr-v32-awasthi14, title = {Local algorithms for interactive clustering}, author = {Awasthi, Pranjal and Balcan, Maria and Voevodski, Konstantin}, booktitle = {Proceedings of the 31st International Conference on Machine Learning}, pages = {550--558}, year = {2014}, editor = {Xing, Eric P. and Jebara, Tony}, volume = {32}, number = {2}, series = {Proceedings of Machine Learning Research}, address = {Bejing, China}, month = {22--24 Jun}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v32/awasthi14.pdf}, url = {https://proceedings.mlr.press/v32/awasthi14.html}, abstract = {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.} }
Endnote
%0 Conference Paper %T Local algorithms for interactive clustering %A Pranjal Awasthi %A Maria Balcan %A Konstantin Voevodski %B Proceedings of the 31st International Conference on Machine Learning %C Proceedings of Machine Learning Research %D 2014 %E Eric P. Xing %E Tony Jebara %F pmlr-v32-awasthi14 %I PMLR %P 550--558 %U https://proceedings.mlr.press/v32/awasthi14.html %V 32 %N 2 %X 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.
RIS
TY - CPAPER TI - Local algorithms for interactive clustering AU - Pranjal Awasthi AU - Maria Balcan AU - Konstantin Voevodski BT - Proceedings of the 31st International Conference on Machine Learning DA - 2014/06/18 ED - Eric P. Xing ED - Tony Jebara ID - pmlr-v32-awasthi14 PB - PMLR DP - Proceedings of Machine Learning Research VL - 32 IS - 2 SP - 550 EP - 558 L1 - http://proceedings.mlr.press/v32/awasthi14.pdf UR - https://proceedings.mlr.press/v32/awasthi14.html 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. ER -
APA
Awasthi, P., Balcan, M. & Voevodski, K.. (2014). Local algorithms for interactive clustering. Proceedings of the 31st International Conference on Machine Learning, in Proceedings of Machine Learning Research 32(2):550-558 Available from https://proceedings.mlr.press/v32/awasthi14.html.

Related Material