On the price of explainability for some clustering problems

5 January 2021

Papers citing "On the price of explainability for some clustering problems"

19 / 19 papers shown

Title
Decision Trees for Interpretable Clusters in Mixture Models and Deep Representations Maximilian Fleissner Maedeh Zarvandi D. Ghoshdastidar 29 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
GLANCE: Global Actions in a Nutshell for Counterfactual Explainability Ioannis Emiris Dimitris Fotakis G. Giannopoulos Dimitrios Gunopulos Loukas Kavouras ... D. Rontogiannis Dimitris Sacharidis Nikolaos Theologitis Dimitrios Tomaras Konstantinos Tsopelas CML FAtt 28 1 0 29 May 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 34 4 0 15 Feb 2024
The Computational Complexity of Concise Hypersphere Classification E. Eiben R. Ganian Iyad A. Kanj S. Ordyniak Stefan Szeider 37 1 0 12 Dec 2023
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
XClusters: Explainability-first Clustering Hyunseung Hwang Steven Euijong Whang 23 5 0 22 Sep 2022
The computational complexity of some explainable clustering problems E. Laber 20 4 0 20 Aug 2022
Shallow decision trees for explainable $k$ -means clustering E. Laber Lucas Murtinho F. Oliveira 21 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 19 33 0 13 Dec 2021
Explainable k-means. Don't be greedy, plant bigger trees! K. Makarychev Liren Shan 19 22 0 04 Nov 2021
Near-optimal Algorithms for Explainable k-Medians and k-Means K. Makarychev Liren Shan 20 25 0 02 Jul 2021
Almost Tight Approximation Algorithms for Explainable Clustering Hossein Esfandiari Vahab Mirrokni Shyam Narayanan 18 18 0 01 Jul 2021
Nearly-Tight and Oblivious Algorithms for Explainable Clustering Buddhima Gamlath Xinrui Jia Adam Polak O. Svensson 18 23 0 30 Jun 2021
Near-Optimal Explainable $k$ -Means for All Dimensions Moses Charikar Lunjia Hu 23 18 0 29 Jun 2021
Connecting Interpretability and Robustness in Decision Trees through Separation Michal Moshkovitz Yao-Yuan Yang Kamalika Chaudhuri 25 22 0 14 Feb 2021
Learning to Generate Fair Clusters from Demonstrations Sainyam Galhotra Sandhya Saisubramanian S. Zilberstein FaML 13 9 0 08 Feb 2021
Born-Again Tree Ensembles Thibaut Vidal Toni Pacheco Maximilian Schiffer 54 53 0 24 Mar 2020