Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms

09/20/2022
by   Ian Davidson, et al.
11

Explainable AI (XAI) is an important developing area but remains relatively understudied for clustering. We propose an explainable-by-design clustering approach that not only finds clusters but also exemplars to explain each cluster. The use of exemplars for understanding is supported by the exemplar-based school of concept definition in psychology. We show that finding a small set of exemplars to explain even a single cluster is computationally intractable; hence, the overall problem is challenging. We develop an approximation algorithm that provides provable performance guarantees with respect to clustering quality as well as the number of exemplars used. This basic algorithm explains all the instances in every cluster whilst another approximation algorithm uses a bounded number of exemplars to allow simpler explanations and provably covers a large fraction of all the instances. Experimental results show that our work is useful in domains involving difficult to understand deep embeddings of images and text.

READ FULL TEXT

page 13

page 22

research
02/28/2020

Explainable k-Means and k-Medians Clustering

Clustering is a popular form of unsupervised learning for geometric data...
research
08/24/2022

Four Algorithms for Correlation Clustering: A Survey

In the Correlation Clustering problem, we are given a set of objects wit...
research
03/10/2021

Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves

We study subtrajectory clustering under the Fréchet distance. Given one ...
research
12/08/2020

Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique

Packing problems constitute an important class of optimization problems,...
research
06/03/2020

ExKMC: Expanding Explainable k-Means Clustering

Despite the popularity of explainable AI, there is limited work on effec...
research
05/29/2019

Clustering without Over-Representation

In this paper we consider clustering problems in which each point is end...
research
02/06/2020

Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability

Improving the explainability of the results from machine learning method...

Please sign up or login with your details

Forgot password? Click here to reset