Personalized Clustering via Targeted Representation Learning

Authors

  • Xiwen Geng Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China School of Information, Renmin University of China
  • Suyun Zhao Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China School of Information, Renmin University of China
  • Yixin Yu School of Statistics, Remin University of China
  • Borui Peng School of Statistics, Remin University of China
  • Pan Du Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China School of Information, Renmin University of China
  • Hong Chen Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China School of Information, Renmin University of China
  • Cuiping Li Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China School of Information, Renmin University of China
  • Mengdie Wang Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China School of Information, Renmin University of China

DOI:

https://doi.org/10.1609/aaai.v39i16.33845

Abstract

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., must-link or 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.

Downloads

Published

2025-04-11

How to Cite

Geng, X., Zhao, S., Yu, Y., Peng, B., Du, P., Chen, H., … Wang, M. (2025). Personalized Clustering via Targeted Representation Learning. Proceedings of the AAAI Conference on Artificial Intelligence, 39(16), 16790–16798. https://doi.org/10.1609/aaai.v39i16.33845

Issue

Section

AAAI Technical Track on Machine Learning II