Interactive Correlation Clustering with Existential Cluster Constraints
Rico Angell, Nicholas Monath, Nishant Yadav, Andrew McCallum
Abstract
We consider the problem of clustering with user feedback. Existing methods express constraints about the input data points, most commonly through must-link and cannot-link constraints on data point pairs. In this paper, we introduce existential cluster constraints: a new form of feedback where users indicate the features of desired clusters. Specifically, users make statements about the existence of a cluster having (and not having) particular features. Our approach has multiple advantages: (1) constraints on clusters can express user intent more efficiently than point pairs; (2) in cases where the users' mental model is of the desired clusters, it is more natural for users to express cluster-wise preferences; (3) it functions even when privacy restrictions prohibit users from seeing raw data. In addition to introducing existential cluster constraints, we provide an inference algorithm for incorporating our constraints into the output clustering. Finally, we demonstrate empirically that our proposed framework facilitates more accurate clustering with dramatically fewer user feedback inputs.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 45ffe647-5ca4-4747-9284-8ab908e03067Cited by top-tier papers2
- Personalized Clustering via Targeted Representation LearningXiwen Geng, Suyun Zhao, Yixin Yu, Borui Peng et al.AAAI 2025 · 6 citations
- Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and SketchingRico Angell, Andrew McCallumICML 2024 · 4 citations
Related papers
- Optimized Algorithms for Text Clustering with LLM-Generated ConstraintsChaoqi Jia, Weihong Wu, Longkun Guo, Zhigang Lu et al.AAAI 2026
- Deep Conditional Gaussian Mixture Model for Constrained ClusteringLaura Manduchi, Kieran Chin-Cheong, Holger Michel, Sven Wellmann et al.NeurIPS 2021 · 40 citations
- Discovering New Intents via Constrained Deep Adaptive Clustering with Cluster RefinementTing-En Lin, Hua Xu, Hanlei ZhangAAAI 2020 · 127 citations
- Efficient Constrained K-center Clustering with Background KnowledgeLongkun Guo, Chaoqi Jia, Kewen Liao, Zhigang Lu et al.AAAI 2024 · 3 citations
- Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise ConstraintsBrian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan et al.AAAI 2021 · 25 citations
