Papers › RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems

RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems

9 Mar 2018arXiv:1803.03467archive 2025-07-28

Hongwei Wang, Fuzheng Zhang, Jialin Wang, Miao Zhao, Wenjie Li, Xing Xie, Minyi Guo

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.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1803.03467")

Code

Syntology Ran 1 of 7 code samples harvested from 3 repositories linked to this paper; 6 have no recorded run. Of those that ran: 1 ran · honoured contract.

By repository: official repository: 3 samples from 1 repository, 0 ran; community (archive-listed): 4 samples from 2 repositories, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

hwwang55/RippleNet officialmentioned in papermentioned on GitHubtfMIT report
Hank-Kuo/RippleNet mentioned on GitHubpytorch report
Jessinra/GDP-RippleNet mentioned on GitHubtf report
Jessinra/GDP-RippleNet-Ori mentioned on GitHubtf report
ZJJHYM/RippleNet mentioned on GitHubtfMIT report
johnnyjana730/MVIN mentioned on GitHubtf report
qibinc/RippleNet-PyTorch mentioned on GitHubpytorch report
sdu-wjh/icws2020 mentioned on GitHubtfMIT report
tezignlab/RippleNet-TF2 mentioned on GitHubtfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 1 ran; 1 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
6unverified

Licence: 1 of the 7 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

dataset_split hwwang55/RippleNet/src/data_loader.py official repository unverified MIT (permissive) · 3807a263b7505930 · report
load_data hwwang55/RippleNet/src/data_loader.py official repository unverified MIT (permissive) · 27c466797c997173 · report
load_rating hwwang55/RippleNet/src/data_loader.py official repository unverified MIT (permissive) · c526b09d6c58d0dc · report
evaluation Hank-Kuo/RippleNet/evaluate.py community (archive-listed) ran · honoured contract no licence file found · pointer only · a863327019290a51 · report
dataset_split sdu-wjh/icws2020/src/data_loader.py community (archive-listed) unverified MIT (permissive) · cfb25fac458f2b48 · report
load_data sdu-wjh/icws2020/src/data_loader.py community (archive-listed) unverified MIT (permissive) · 0cd23296b20e4497 · report
load_rating sdu-wjh/icws2020/src/data_loader.py community (archive-listed) unverified MIT (permissive) · bd6a37c39c9dc99d · report

Tasks

Click-Through Rate PredictionCollaborative FilteringNews RecommendationRecommendation Systems

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Click-Through Rate Prediction Bing News RippleNet AUC 0.678 #5 of 7 Archive leaderboard report
Click-Through Rate Prediction Bing News RippleNet Accuracy 63.2 #5 of 7 Archive leaderboard report
Click-Through Rate Prediction Book-Crossing RippleNet AUC 0.729 #2 of 2 Archive leaderboard report
Click-Through Rate Prediction Book-Crossing RippleNet Accuracy 0.662 #2 of 2 Archive leaderboard report
Click-Through Rate Prediction MovieLens 1M RippleNet AUC 0.921 #3 of 6 Archive leaderboard report
Click-Through Rate Prediction MovieLens 1M RippleNet Accuracy 84.4 #3 of 6 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections