|国家预印本平台
首页|Enhancing Graph-based Recommendations with Majority-Voting LLM-Rerank Augmentation

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

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

来源:Arxiv_logoArxiv
英文摘要

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

计算技术、计算机技术

Minh-Anh Nguyen,Bao Nguyen,Ha Lan N. T.,Tuan Anh Hoang,Duc-Trong Le,Dung D. Le.Enhancing Graph-based Recommendations with Majority-Voting LLM-Rerank Augmentation[EB/OL].(2025-08-06)[2025-08-11].https://arxiv.org/abs/2507.21563.点此复制

评论