Revisiting Neighborhood-based Link Prediction for Collaborative Filtering
Hao-Ming Fu, Patrick Poirson, Kwot Sin Lee, Chen Wang

TL;DR
This paper introduces a simple, non-deep learning link prediction model for collaborative filtering that significantly outperforms current GNN-based methods by focusing on local graph structures without node modeling.
Contribution
It proposes a new linkage score and an iterative degree update process for bipartite graphs, emphasizing link prediction over node embedding in recommendation systems.
Findings
Over 60% improvement in Recall and NDCG on Amazon-Book.
Outperforms state-of-the-art GNN-based CF models on four benchmarks.
Demonstrates the effectiveness of simple link prediction methods in recommendation tasks.
Abstract
Collaborative filtering (CF) is one of the most successful and fundamental techniques in recommendation systems. In recent years, Graph Neural Network (GNN)-based CF models, such as NGCF [31], LightGCN [10] and GTN [9] have achieved tremendous success and significantly advanced the state-of-the-art. While there is a rich literature of such works using advanced models for learning user and item representations separately, item recommendation is essentially a link prediction problem between users and items. Furthermore, while there have been early works employing link prediction for collaborative filtering [5, 6], this trend has largely given way to works focused on aggregating information from user and item nodes, rather than modeling links directly. In this paper, we propose a new linkage (connectivity) score for bipartite graphs, generalizing multiple standard link prediction methods.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Neural Network · LightGCN
