{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:06:18Z","timestamp":1775912778427,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520056","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1629-1642","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Explainable\n            <i>k<\/i>\n            -means: don\u2019t be greedy, plant bigger trees!"],"prefix":"10.1145","author":[{"given":"Konstantin","family":"Makarychev","sequence":"first","affiliation":[{"name":"Northwestern University, USA"}]},{"given":"Liren","family":"Shan","sequence":"additional","affiliation":[{"name":"Northwestern University, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Aggarwal Ankit","unstructured":"Ankit Aggarwal , Amit Deshpande , and Ravi Kannan . 2009. Adaptive sampling for k-means clustering . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques . Springer , 15\u201328. Ankit Aggarwal, Amit Deshpande, and Ravi Kannan. 2009. Adaptive sampling for k-means clustering. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, 15\u201328."},{"key":"e_1_3_2_1_2_1","article-title":"Better guarantees for k-means and euclidean k-median by primal-dual algorithms","volume":"49","author":"Ahmadian Sara","year":"2019","unstructured":"Sara Ahmadian , Ashkan Norouzi-Fard , Ola Svensson , and Justin Ward . 2019 . Better guarantees for k-means and euclidean k-median by primal-dual algorithms . SIAM J. Comput. , 49 , 4 (2019), FOCS17\u201397. Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, and Justin Ward. 2019. Better guarantees for k-means and euclidean k-median by primal-dual algorithms. SIAM J. Comput., 49, 4 (2019), FOCS17\u201397.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"e_1_3_2_1_4_1","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA). 1027\u20131035","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii . 2007 . k-means++ the advantages of careful seeding . In ACM-SIAM Symposium on Discrete Algorithms (SODA). 1027\u20131035 . David Arthur and Sergei Vassilvitskii. 2007. k-means++ the advantages of careful seeding. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 1027\u20131035."},{"key":"e_1_3_2_1_5_1","unstructured":"Pranjal Awasthi Moses Charikar Ravishankar Krishnaswamy and Ali Kemal Sinop. 2015. The hardness of approximation of euclidean k-means. arXiv preprint arXiv:1502.03316.  Pranjal Awasthi Moses Charikar Ravishankar Krishnaswamy and Ali Kemal Sinop. 2015. The hardness of approximation of euclidean k-means. arXiv preprint arXiv:1502.03316."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316318"},{"key":"e_1_3_2_1_7_1","unstructured":"Dimitris Bertsimas Agni Orfanoudaki and Holly Wiberg. 2018. Interpretable clustering via optimal trees. arXiv preprint arXiv:1812.00539.  Dimitris Bertsimas Agni Orfanoudaki and Holly Wiberg. 2018. Interpretable clustering via optimal trees. arXiv preprint arXiv:1812.00539."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.105"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2375327"},{"key":"e_1_3_2_1_10_1","volume-title":"Classification and regression trees","author":"Breiman Leo","unstructured":"Leo Breiman , Jerome H Friedman , Richard A Olshen , and Charles J Stone . 2017. Classification and regression trees . Routledge . Leo Breiman, Jerome H Friedman, Richard A Olshen, and Charles J Stone. 2017. Classification and regression trees. Routledge."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.101"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746569"},{"key":"e_1_3_2_1_13_1","volume-title":"The hardness of k-means clustering. Department of Computer Science and Engineering","author":"Dasgupta Sanjoy","unstructured":"Sanjoy Dasgupta . 2008. The hardness of k-means clustering. Department of Computer Science and Engineering , University of California , San Diego . Sanjoy Dasgupta. 2008. The hardness of k-means clustering. Department of Computer Science and Engineering, University of California, San Diego."},{"key":"e_1_3_2_1_14_1","volume-title":"International Conference on Machine Learning. 7055\u20137065","author":"Dasgupta Sanjoy","year":"2020","unstructured":"Sanjoy Dasgupta , Nave Frost , Michal Moshkovitz , and Cyrus Rashtchian . 2020 . Explainable k-Means and k-Medians Clustering . In International Conference on Machine Learning. 7055\u20137065 . Sanjoy Dasgupta, Nave Frost, Michal Moshkovitz, and Cyrus Rashtchian. 2020. Explainable k-Means and k-Medians Clustering. In International Conference on Machine Learning. 7055\u20137065."},{"key":"e_1_3_2_1_15_1","unstructured":"Ron Elber. 2004. KDD-Cup. http:\/\/osmot.cs.cornell.edu\/kddcup\/  Ron Elber. 2004. KDD-Cup. http:\/\/osmot.cs.cornell.edu\/kddcup\/"},{"key":"e_1_3_2_1_16_1","volume-title":"Almost Tight Approximation Algorithms for Explainable Clustering. In ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Esfandiari Hossein","year":"2022","unstructured":"Hossein Esfandiari , Vahab Mirrokni , and Shyam Narayanan . 2022 . Almost Tight Approximation Algorithms for Explainable Clustering. In ACM-SIAM Symposium on Discrete Algorithms (SODA). Hossein Esfandiari, Vahab Mirrokni, and Shyam Narayanan. 2022. Almost Tight Approximation Algorithms for Explainable Clustering. In ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-013-0129-3"},{"key":"e_1_3_2_1_18_1","unstructured":"Nave Frost Michal Moshkovitz and Cyrus Rashtchian. 2020. ExKMC: Expanding Explainable k-Means Clustering. arXiv preprint arXiv:2006.02399.  Nave Frost Michal Moshkovitz and Cyrus Rashtchian. 2020. ExKMC: Expanding Explainable k-Means Clustering. arXiv preprint arXiv:2006.02399."},{"key":"e_1_3_2_1_19_1","unstructured":"Buddhima Gamlath Xinrui Jia Adam Polak and Ola Svensson. 2021. Nearly-Tight and Oblivious Algorithms for Explainable Clustering. In Advances in Neural Information Processing Systems.  Buddhima Gamlath Xinrui Jia Adam Polak and Ola Svensson. 2021. Nearly-Tight and Oblivious Algorithms for Explainable Clustering. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2022.106251"},{"key":"e_1_3_2_1_21_1","volume-title":"International Conference on Machine Learning.","author":"Laber Eduardo","year":"2021","unstructured":"Eduardo Laber and Lucas Murtinho . 2021 . On the price of explainability for some clustering problems . In International Conference on Machine Learning. Eduardo Laber and Lucas Murtinho. 2021. On the price of explainability for some clustering problems. In International Conference on Machine Learning."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2016.11.009"},{"key":"e_1_3_2_1_23_1","volume-title":"Foundations and advances in data mining","author":"Liu Bing","unstructured":"Bing Liu , Yiyuan Xia , and Philip S Yu. 2005. Clustering via decision tree construction . In Foundations and advances in data mining . Springer , 97\u2013124. Bing Liu, Yiyuan Xia, and Philip S Yu. 2005. Clustering via decision tree construction. In Foundations and advances in data mining. Springer, 97\u2013124."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316350"},{"key":"e_1_3_2_1_26_1","unstructured":"Konstantin Makarychev Yury Makarychev Maxim Sviridenko and Justin Ward. 2016. A Bi-Criteria Approximation Algorithm for k-Means. Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques.  Konstantin Makarychev Yury Makarychev Maxim Sviridenko and Justin Ward. 2016. A Bi-Criteria Approximation Algorithm for k-Means. Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques."},{"key":"e_1_3_2_1_27_1","volume-title":"Improved Guarantees for k-means++ and k-means++ Parallel. Advances in Neural Information Processing Systems, 33","author":"Makarychev Konstantin","year":"2020","unstructured":"Konstantin Makarychev , Aravind Reddy , and Liren Shan . 2020. Improved Guarantees for k-means++ and k-means++ Parallel. Advances in Neural Information Processing Systems, 33 ( 2020 ). Konstantin Makarychev, Aravind Reddy, and Liren Shan. 2020. Improved Guarantees for k-means++ and k-means++ Parallel. Advances in Neural Information Processing Systems, 33 (2020)."},{"key":"e_1_3_2_1_28_1","volume-title":"International Conference on Machine Learning. 7358\u20137367","author":"Makarychev Konstantin","year":"2021","unstructured":"Konstantin Makarychev and Liren Shan . 2021 . Near-optimal Algorithms for Explainable k-Medians and k-Means . In International Conference on Machine Learning. 7358\u20137367 . Konstantin Makarychev and Liren Shan. 2021. Near-optimal Algorithms for Explainable k-Medians and k-Means. In International Conference on Machine Learning. 7358\u20137367."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022643204877"},{"key":"e_1_3_2_1_30_1","volume-title":"Programs for Machine Learning. In International Conference on Machine Learning. 252\u2013259","author":"Quinlan J. Ross","year":"1993","unstructured":"J. Ross Quinlan . 1993 . C4. 5 , Programs for Machine Learning. In International Conference on Machine Learning. 252\u2013259 . J. Ross Quinlan. 1993. C4. 5, Programs for Machine Learning. In International Conference on Machine Learning. 252\u2013259."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375627.3375843"},{"key":"e_1_3_2_1_32_1","first-page":"604","article-title":"A constant-factor bi-criteria approximation guarantee for k-means++","volume":"29","author":"Wei Dennis","year":"2016","unstructured":"Dennis Wei . 2016 . A constant-factor bi-criteria approximation guarantee for k-means++ . Advances in Neural Information Processing Systems , 29 (2016), 604 \u2013 612 . Dennis Wei. 2016. A constant-factor bi-criteria approximation guarantee for k-means++. Advances in Neural Information Processing Systems, 29 (2016), 604\u2013612.","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520056","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:15Z","timestamp":1750188675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":32,"alternative-id":["10.1145\/3519935.3520056","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520056","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}