← 返回论文检索
The ACM Web Conference 2026Track 9: User Modeling, Personalization and Recommendation

Line Graphs Are Here! Unlock a Simple Solution for Data Sparsity and Class Imbalance in Recommender System

Junming Zhou, Hao Zhong 0007, Shupeng Li, Zhengyang Wu 0001, Yong Tang 0001, Ronghua Lin

PDF 由论文原始站点提供,PaperCompass 不保存论文文件。DOI 10.1145/3774904.3792292 ↗

摘要

The persistent challenges of data sparsity and class imbalance have long limited the development of recommender systems. Fortunately, line graph theory offers a novel perspective to overcome these issues. By transforming the user-item interaction bipartite graph into a line graph, the problems of data sparsity and class imbalance are elegantly reformulated as those of insufficient labeled nodes and imbalanced label distribution in the line graph domain. This reformulation allows us to directly apply mature techniques from node classification and imbalanced graph learning to address these core challenges. Inspired by this insight, we propose a Line Graph Data Augmentation (LGDA) strategy, which features two distinct characteristics. Firstly, it is a plug-and-play module that resolves data sparsity and imbalance without modifying the underlying recommendation framework. Secondly, it employs a targeted augmentation and confidence filtering mechanism to generate high-quality, balanced augmented data. Extensive experiments on four real-world datasets validate that LGDA effectively alleviates data sparsity and class imbalance, leading to significant improvements in both recommendation performance and system robustness.