ClusterRAG: Cluster-Based Collaborative Filtering for Personalized Retrieval-Augmented Generation

• URL: http://arxiv.org/abs/2605.18769v1
• Date: Tue, 14 Apr 2026 01:52:09 GMT
• Title: ClusterRAG: Cluster-Based Collaborative Filtering for Personalized Retrieval-Augmented Generation
• Abstract summary: ClusterRAG is a Cluster-Based Collaborative Filtering for Personalized Retrieval-Augmented Generation.<n>It represents users through their profile documents, organizes users into semantically coherent clusters using density-based clustering.<n>It performs retrieval at both the cluster and document levels via cluster-level similarity and fine-grained ranking.
• Score: 1.5499426028105903
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Personalized Retrieval-Augmented Generation (RAG) relies on accurately selecting user-relevant documents. In practice, existing RAG approaches often suffer from high retrieval costs and overlook that collaborative signals from similar users can enhance personalized generation for the current user. We propose ClusterRAG, a Cluster-Based Collaborative Filtering for Personalized Retrieval-Augmented Generation. ClusterRAG represents users through their profile documents, organizes users into semantically coherent clusters using density-based clustering, and performs retrieval at both the cluster and document levels via cluster-level similarity and fine-grained ranking. Extensive experiments on the LaMP benchmark demonstrate that jointly leveraging the target user's profile and profiles from top similar users consistently yields the best performance across diverse tasks. Further analysis shows that ClusterRAG integrates seamlessly with different dense retrievers and rankers, and remains effective when paired with both fine-tuned and zero-shot language models.

Related papers

• One-Shot Hierarchical Federated Clustering [51.490181220883905]
  This paper introduces an efficient one-shot hierarchical Federated Clustering framework.<n>It performs client-end distribution exploration and server-end distribution aggregation.<n>It turns out that the complex cluster distributions across clients can be efficiently explored.
  arXiv  Detail & Related papers  (2026-01-10T02:58:33Z)
• ESMC: MLLM-Based Embedding Selection for Explainable Multiple Clustering [79.69917150582633]
  Multi-modal large language models (MLLMs) can be leveraged to achieve user-driven clustering.<n>Our method first discovers that MLLMs' hidden states of text tokens are strongly related to the corresponding features.<n>We also employ a lightweight clustering head augmented with pseudo-label learning, significantly enhancing clustering accuracy.
  arXiv  Detail & Related papers  (2025-11-30T04:36:51Z)
• Agent-Centric Personalized Multiple Clustering with Multi-Modal LLMs [40.38930402847949]
  We propose an agent-centric personalized clustering framework.<n>Agents traverse a relational graph to search for clusters based on user interests.<n>Results show that the proposed method achieves NMI scores of 0.9667 and 0.9481 on the Card Order and Card Suits benchmarks.
  arXiv  Detail & Related papers  (2025-03-28T08:45:15Z)
• Personalized Clustering via Targeted Representation Learning [12.685373069492448]
  Clustering traditionally aims to reveal a natural grouping structure within unlabeled data.<n>We propose a personalized clustering method that explicitly performs targeted representation learning.
  arXiv  Detail & Related papers  (2024-12-18T10:28:51Z)
• Organizing Unstructured Image Collections using Natural Language [37.16101036513514]
  We introduce the task of Open-ended Semantic Multiple Clustering (OpenSMC), which aims to automatically discover clustering criteria from large, unstructured image collections.<n>Our framework, X-Cluster: eXploratory Clustering, treats text as a reasoning proxy, and groups images into meaningful clusters per criterion.<n>X-Cluster effectively reveals meaningful partitions and enables downstream applications such as bias discovery and social media image popularity analysis.
  arXiv  Detail & Related papers  (2024-10-07T17:21:46Z)
• Revealing and Utilizing In-group Favoritism for Graph-based Collaborative Filtering [9.067610121749777]
  We compute co-clusters of users and items with co-clustering algorithms and add CFworks for each cluster to extract the in-group favoritism. We experimented real world datasets considering two aspects: Finding the number of groups divided according to in-group preference, and measuring the quantity of improvement.
  arXiv  Detail & Related papers  (2024-04-23T06:43:58Z)
• Cluster-based Graph Collaborative Filtering [55.929052969825825]
  Graph Convolution Networks (GCNs) have succeeded in learning user and item representations for recommendation systems. Most existing GCN-based methods overlook the multiple interests of users while performing high-order graph convolution. We propose a novel GCN-based recommendation model, termed Cluster-based Graph Collaborative Filtering (ClusterGCF)
  arXiv  Detail & Related papers  (2024-04-16T07:05:16Z)
• Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
  We propose a new deep graph clustering method termed Reinforcement Graph Clustering. In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework. In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
  arXiv  Detail & Related papers  (2023-08-13T18:12:28Z)
• Large Language Models Enable Few-Shot Clustering [88.06276828752553]
  We show that large language models can amplify an expert's guidance to enable query-efficient, few-shot semi-supervised text clustering. We find incorporating LLMs in the first two stages can routinely provide significant improvements in cluster quality.
  arXiv  Detail & Related papers  (2023-07-02T09:17:11Z)
• Overcoming Data Sparsity in Group Recommendation [52.00998276970403]
  Group recommender systems should be able to accurately learn not only users' personal preferences but also preference aggregation strategy. In this paper, we take Bipartite Graphding Model (BGEM), the self-attention mechanism and Graph Convolutional Networks (GCNs) as basic building blocks to learn group and user representations in a unified way.
  arXiv  Detail & Related papers  (2020-10-02T07:11:19Z)
• Search Result Clustering in Collaborative Sound Collections [17.48516881308658]
  We propose a graph-based approach using audio features for clustering diverse sound collections obtained when querying large online databases. We show that using a confidence measure for discarding inconsistent clusters improves the quality of the partitions.
  arXiv  Detail & Related papers  (2020-04-08T13:08:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.