Stage-wise training with neighbor resampling improves KGCN and RippleNet on most tested datasets and helps KGCN converge at higher graph hops, though a few Recall@K entries drop.
RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
To address the sparsity and cold start problem of collaborative filtering, researchers usually make use of side information, such as social networks or item attributes, to improve recommendation performance. This paper considers the knowledge graph as the source of side information. To address the limitations of existing embedding-based and path-based methods for knowledge-graph-aware recommendation, we propose Ripple Network, an end-to-end framework that naturally incorporates the knowledge graph into recommender systems. Similar to actual ripples propagating on the surface of water, Ripple Network stimulates the propagation of user preferences over the set of knowledge entities by automatically and iteratively extending a user's potential interests along links in the knowledge graph. The multiple "ripples" activated by a user's historically clicked items are thus superposed to form the preference distribution of the user with respect to a candidate item, which could be used for predicting the final clicking probability. Through extensive experiments on real-world datasets, we demonstrate that Ripple Network achieves substantial gains in a variety of scenarios, including movie, book and news recommendation, over several state-of-the-art baselines.
fields
cs.IR 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
GraphSW: a training protocol based on stage-wise training for GNN-based Recommender Model
Stage-wise training with neighbor resampling improves KGCN and RippleNet on most tested datasets and helps KGCN converge at higher graph hops, though a few Recall@K entries drop.