arXiv:2412.13690cs.LG2024-12AAAI被引 8

让用户用少量标注指导聚类方向,让结果更符合个人偏好。

Personalized Clustering via Targeted Representation Learning

  • 通过用户交互获取关键约束对,动态优化表示学习
  • 仅需少量查询(如5-10对)即可显著提升聚类效果
  • 适合需要个性化结果的场景,如推荐、用户分群

传统聚类旨在发现数据中固有的分组结构,但该结构未必符合用户偏好。本文提出一种个性化聚类方法,通过与用户交互获取少量任务信息(如必须共现或不能共现对),引导聚类方向。我们主动选择最难聚类和最易误判的样本对进行查询,以最大化信息增益。结合注意力机制与约束对比损失,学习针对性的表示,从而实现个性化聚类。理论上,证明了个性化聚类的风险被紧密界控,说明主动查询能有效降低聚类风险。实验表明,该方法在多种任务与数据集上表现优异,即使仅有少量查询(如5–10对)也能取得良好效果。

原文摘要 · Abstract (English)

Clustering traditionally aims to reveal a natural grouping structure within unlabeled data. However, this structure may not always align with users' preferences. In this paper, we propose a personalized clustering method that explicitly performs targeted representation learning by interacting with users via modicum task information (e.g., $\textit{must-link}$ or $\textit{cannot-link}$ pairs) to guide the clustering direction. We query users with the most informative pairs, i.e., those pairs most hard to cluster and those most easy to miscluster, to facilitate the representation learning in terms of the clustering preference. Moreover, by exploiting attention mechanism, the targeted representation is learned and augmented. By leveraging the targeted representation and constrained contrastive loss as well, personalized clustering is obtained. Theoretically, we verify that the risk of personalized clustering is tightly bounded, guaranteeing that active queries to users do mitigate the clustering risk. Experimentally, extensive results show that our method performs well across different clustering tasks and datasets, even when only a limited number of queries are available.

个性化聚类主动学习表示学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。