Papers › Knowledge Graph Convolutional Networks for Recommender Systems

Knowledge Graph Convolutional Networks for Recommender Systems

18 Mar 2019arXiv:1904.12575archive 2025-07-28

Hongwei Wang, Miao Zhao, Xing Xie, Wenjie Li, Minyi Guo

To alleviate sparsity and cold start problem of collaborative filtering based recommender systems, researchers and engineers usually collect attributes of users and items, and design delicate algorithms to exploit these additional information. In general, the attributes are not isolated but connected with each other, which forms a knowledge graph (KG). In this paper, we propose Knowledge Graph Convolutional Networks (KGCN), an end-to-end framework that captures inter-item relatedness effectively by mining their associated attributes on the KG. To automatically discover both high-order structure information and semantic information of the KG, we sample from the neighbors for each entity in the KG as their receptive field, then combine neighborhood information with bias when calculating the representation of a given entity. The receptive field can be extended to multiple hops away to model high-order proximity information and capture users' potential long-distance interests. Moreover, we implement the proposed KGCN in a minibatch fashion, which enables our model to operate on large datasets and KGs. We apply the proposed model to three datasets about movie, book, and music recommendation, and experiment results demonstrate that our approach outperforms strong recommender baselines.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 5 code samples harvested from 2 repositories linked to this paper: 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 4 samples from 1 repository, 2 ran (2 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 1 sample from 1 repository, 1 ran (0 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

hwwang55/KGCN officialmentioned in papermentioned on GitHubtfMITSyntology: 4 samples, 2 ran (0 instrument-failed) · 2 unverified report
KanchiShimono/KGCN mentioned on GitHubtfSyntology: not harvested report
Ki-Seki/KGCN-pytorch-updated mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (1 instrument-failed) · 0 unverified report
johnnyjana730/MVIN mentioned on GitHubtfSyntology: not harvested report
mostsuperman/KGCN-ML mentioned on GitHubtfMITSyntology: not harvested report
mostsuperman/test mentioned on GitHubtfMITSyntology: not harvested report
youngch12/Cluster_KGCN mentioned on GitHubtfMITSyntology: not harvested report
zzaebok/KGCN-pytorch mentioned on GitHubpytorchSyntology: not harvested 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

5 samples harvested: 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
2ran
2unverified

Licence: 1 of the 5 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 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

hwwang55/KGCN official repository 4 samples, 2 ran (0 instrument-failed) · 2 unverified
dataset_split in 12 papers src/data_loader.py ran MIT (permissive) · 65918cd1d6b5d811 · report fixture: signature rating_np:ndarray/2/float, args:Args/0/? · returned tuple · level recorded 2026-09-25
get_layer_id in 7 papers src/aggregators.py ran fingerprinted MIT (permissive) · df1bf46ed02ef952 · report fixture: signature layer_name:str/0/str · returned int · level recorded 2026-09-25
load_data in 700 papers src/data_loader.py unverified MIT (permissive) · d3d5f3d565cdd45b · report
load_rating src/data_loader.py unverified MIT (permissive) · 428d0434114ebd82 · report
Ki-Seki/KGCN-pytorch-updated community (archive-listed) 1 sample, 1 ran (1 instrument-failed) · 0 unverified
prepare_arguments KGCN.py ran · our draft was wrong no licence file found · pointer only · 1937f2c38279d232 · report fixture: signature arguments:str/0/str · returned Namespace · level recorded 2026-09-22

Tasks

Click-Through Rate PredictionCollaborative FilteringLink PredictionMusic RecommendationRecommendation Systems

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Click-Through Rate Prediction Book-Crossing KGCN-sum AUC 0.738 #1 of 2 Archive leaderboard report
Click-Through Rate Prediction Book-Crossing KGCN-sum F1 0.688 #1 of 2 Archive leaderboard report
Click-Through Rate Prediction Last.FM KGCN-concat AUC 0.796 #1 of 2 Archive leaderboard report
Click-Through Rate Prediction Last.FM KGCN-concat F1 0.721 #1 of 2 Archive leaderboard report
Link Prediction MovieLens 25M KGCN Hits@10 0.771 #7 of 7 Archive leaderboard report
Link Prediction MovieLens 25M KGCN nDCG@10 0.4699 #7 of 7 Archive leaderboard report
Link Prediction Yelp KGCN HR@10 0.8125 #5 of 9 Archive leaderboard report
Link Prediction Yelp KGCN nDCG@10 0.4668 #5 of 9 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.

Methods

Graph Convolutional Networks

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