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

02/06/2020
by   Prathyush Sambaturu, et al.
0

Improving the explainability of the results from machine learning methods has become an important research goal. Here, we study the problem of making clusters more interpretable by extending a recent approach of [Davidson et al., NeurIPS 2018] for constructing succinct representations for clusters. Given a set of objects S, a partition π of S (into clusters), and a universe T of tags such that each element in S is associated with a subset of tags, the goal is to find a representative set of tags for each cluster such that those sets are pairwise-disjoint and the total size of all the representatives is minimized. Since this problem is NP-hard in general, we develop approximation algorithms with provable performance guarantees for the problem. We also show applications to explain clusters from datasets, including clusters of genomic sequences that represent different threat levels.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/18/2022

Towards Practical Explainability with Cluster Descriptors

With the rapid development of machine learning, improving its explainabi...
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
07/09/2019

r-Gather Clustering and r-Gathering on Spider: FPT Algorithms and Hardness

We consider min-max r-gather clustering problem and min-max r-gathering ...
research
08/17/2021

Learning to Cluster via Same-Cluster Queries

We study the problem of learning to cluster data points using an oracle ...
research
05/14/2018

Algorithms and Complexity of Range Clustering

We introduce a novel criterion in clustering that seeks clusters with li...
research
09/20/2022

Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms

Explainable AI (XAI) is an important developing area but remains relativ...
research
09/14/2023

Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering

Given a set of points labeled with k labels, we introduce the heat map s...

Please sign up or login with your details

Forgot password? Click here to reset