Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

VoteGCL: Enhancing Graph-based Recommendations with Majority-Voting LLM-Rerank Augmentation

About

Recommendation systems often suffer from data sparsity caused by limited user-item interactions, which degrade their performance and amplify popularity bias in real-world scenarios. This paper proposes a novel data augmentation framework that leverages Large Language Models (LLMs) and item textual descriptions to enrich interaction data. By few-shot prompting LLMs multiple times to rerank items and aggregating the results via majority voting, we generate high-confidence synthetic user-item interactions, supported by theoretical guarantees based on the concentration of measure. To effectively leverage the augmented data in the context of a graph recommendation system, we integrate it into a graph contrastive learning framework to mitigate distributional shift and alleviate popularity bias. Extensive experiments show that our method improves accuracy and reduces popularity bias, outperforming strong baselines.

Minh-Anh Nguyen, Bao Nguyen, Ha Lan N.T., Tuan Anh Hoang, Duc-Trong Le, Dung D. Le• 2025

Related benchmarks

TaskDatasetResultRank
Graph RecommendationMovieLens 100k
Recall@108.86
10
Graph RecommendationMovieLens 1M
R@100.0928
10
Graph RecommendationYelp 2018
R@104.87
10
Graph RecommendationAmazon Scientific
R@1013.85
10
Showing 4 of 4 rows

Other info

Follow for update