Almost Tight Approximation Algorithms for Explainable Clustering

Almost Tight Approximation Algorithms for Explainable Clustering

1 July 2021

Hossein Esfandiari

Vahab Mirrokni

Shyam Narayanan

Papers citing "Almost Tight Approximation Algorithms for Explainable Clustering"

12 / 12 papers shown

Title
Decision Trees for Interpretable Clusters in Mixture Models and Deep Representations Maximilian Fleissner Maedeh Zarvandi D. Ghoshdastidar 34 1 0 03 Nov 2024
Interpretable Clustering: A Survey Lianyu Hu Mudi Jiang Junjie Dong Xinying Liu Zengyou He 28 1 0 01 Sep 2024
Towards Explainable Clustering: A Constrained Declarative based Approach Mathieu Guilbert Christel Vrain Thi-Bich-Hanh Dao 21 3 0 26 Mar 2024
Explaining Kernel Clustering via Decision Trees Maximilian Fleissner L. C. Vankadara D. Ghoshdastidar FAtt 40 4 0 15 Feb 2024
Impossibility of Depth Reduction in Explainable Clustering Cheng-Hao Deng Surya Teja Gavva S. KarthikC. Parth Patel Adarsh Srinivasan 21 1 0 04 May 2023
The computational complexity of some explainable clustering problems E. Laber 25 4 0 20 Aug 2022
Shallow decision trees for explainable $k$ -means clustering E. Laber Lucas Murtinho F. Oliveira 24 24 0 29 Dec 2021
How to Find a Good Explanation for Clustering? Sayan Bandyapadhyay F. Fomin P. Golovach W. Lochet Nidhi Purohit Kirill Simonov 21 33 0 13 Dec 2021
Explainable k-means. Don't be greedy, plant bigger trees! K. Makarychev Liren Shan 22 22 0 04 Nov 2021
Near-optimal Algorithms for Explainable k-Medians and k-Means K. Makarychev Liren Shan 25 25 0 02 Jul 2021
Nearly-Tight and Oblivious Algorithms for Explainable Clustering Buddhima Gamlath Xinrui Jia Adam Polak O. Svensson 21 23 0 30 Jun 2021
Near-Optimal Explainable $k$ -Means for All Dimensions Moses Charikar Lunjia Hu 23 18 0 29 Jun 2021