Ripplenet: Propagating user preferences on the knowledge graph for recommender systems

H Wang, F Zhang, J Wang, M Zhao, W Li… - Proceedings of the 27th …, 2018 - dl.acm.org
Proceedings of the 27th ACM international conference on information and …, 2018dl.acm.org
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 RippleNet, an end-to-
end framework that naturally incorporates the knowledge graph into recommender systems …
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 RippleNet, an end-to-end framework that naturally incorporates the knowledge graph into recommender systems. Similar to actual ripples propagating on the water, RippleNet 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 RippleNet achieves substantial gains in a variety of scenarios, including movie, book and news recommendation, over several state-of-the-art baselines.
ACM Digital Library