Deoscillated Graph Collaborative Filtering
Zhiwei Liu, Lin Meng, Fei Jiang, Jiawei Zhang, Philip S. Yu

TL;DR
DGCF is a novel graph-based collaborative filtering model that addresses oscillation and locality issues in high-order information propagation, improving recommendation accuracy.
Contribution
The paper introduces cross-hop propagation and locality-adaptive layers to effectively model high-order signals and solve oscillation problems in bipartite graphs.
Findings
DGCF outperforms existing methods on real-world datasets.
It effectively resolves oscillation issues in bipartite graph propagation.
DGCF adaptively learns local factors for improved recommendations.
Abstract
Collaborative Filtering (CF) signals are crucial for a Recommender System~(RS) model to learn user and item embeddings. High-order information can alleviate the cold-start issue of CF-based methods, which is modelled through propagating the information over the user-item bipartite graph. Recent Graph Neural Networks~(GNNs) propose to stack multiple aggregation layers to propagate high-order signals. However, the oscillation problem, varying locality of bipartite graph, and the fix propagation pattern spoil the ability of multi-layer structure to propagate information. The oscillation problem results from the bipartite structure, as the information from users only propagates to items. Besides oscillation problem, varying locality suggests the density of nodes should be considered in the propagation process. Moreover, the layer-fixed propagation pattern introduces redundant information…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Graph Neural Networks · Topic Modeling
