AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

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

Prathyush Sambaturu, Aparna Gupta, Ian Davidson, S. S. Ravi, Anil Vullikanti, Andrew Warren

AAAI 2020 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 7 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use cluster-specific coverage requirements instead of total coverageCover-or-forget cluster descriptions · Flickr, cost of 3 tagscoverage balance across clusters: almost 90% for C2; 57% for C1Improved
Add pair-of-tags features to the tag set (ablation)Cluster descriptions · Some datasetsfeasibilityImproved
Add pair-of-tags features to the tag set (ablation)Cluster descriptions · Feasible datasetsdescription costNo clear effect
Use Round for cluster descriptionRound · Multiple datasets, k=2coverage approximation ratio: always ≥ 0.8, and >0.9 in most casesImproved
Use Round rather than ILPCluster description · Large datasetsscalability by data matrix size: 10^8 entries versus more than 10^6 entriesImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy