AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

The Cluster Description Problem - Complexity Results, Formulations and Approximations

Ian Davidson, Antoine Gourru, S Ravi

NeurIPS 2018 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 11 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
add cover-or-forget (ignore up to I instances) to the basic ILP (ablation)Cluster description ILP · Twitter 1000 users, 2 communitiesfeasibilityImproved
add Together/Apart composition constraints derived from hashtag co-occurrence (ablation)Cover-or-forget ILP · Twitter 1000 users, 2 communitiesdescription consistency (qualitative)Improved
increase number of nodes (and clusters) from 1000 to 5000Cover-or-forget ILP · Twitter scalabilitysolver time (s): 0.5 -> 88.1Hurt
increase number of tags from 25 to 136 (5000 nodes, k=32) (ablation)Cover-or-forget ILP · Twitter scalabilitysolver time (s): 232.1 -> 88.1Improved
increase number of tags from 25 to 136 (ablation)Cover-or-forget ILP · Twitter scalabilitynodes forgotten: 783 -> 123Improved

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