Papers › Neural Graph Collaborative Filtering

Neural Graph Collaborative Filtering

20 May 2019arXiv:1905.08108archive 2025-07-28

Xiang Wang, Xiangnan He, Meng Wang, Fuli Feng, Tat-Seng Chua

Learning vector representations (aka. embeddings) of users and items lies at the core of modern recommender systems. Ranging from early matrix factorization to recently emerged deep learning based methods, existing efforts typically obtain a user's (or an item's) embedding by mapping from pre-existing features that describe the user (or the item), such as ID and attributes. We argue that an inherent drawback of such methods is that, the collaborative signal, which is latent in user-item interactions, is not encoded in the embedding process. As such, the resultant embeddings may not be sufficient to capture the collaborative filtering effect. In this work, we propose to integrate the user-item interactions -- more specifically the bipartite graph structure -- into the embedding process. We develop a new recommendation framework Neural Graph Collaborative Filtering (NGCF), which exploits the user-item graph structure by propagating embeddings on it. This leads to the expressive modeling of high-order connectivity in user-item graph, effectively injecting the collaborative signal into the embedding process in an explicit manner. We conduct extensive experiments on three public benchmarks, demonstrating significant improvements over several state-of-the-art models like HOP-Rec and Collaborative Memory Network. Further analysis verifies the importance of embedding propagation for learning better user and item representations, justifying the rationality and effectiveness of NGCF. Codes are available at https://github.com/xiangwang1223/neural_graph_collaborative_filtering.

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

The archive's official repository (xiangwang1223/neural_graph_collaborative_filtering) was not harvested; the 7 samples below come from 2 community repositories.

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

By repository: community (archive-listed): 7 samples from 2 repositories, 7 ran (3 with no instrument failure; 4 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.

No sample is linked to this paper from 6 of its repositories that Syntology harvested for other papers:

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

21 repositories listed; official and paper-mentioned ones first.

xiangwang1223/neural_graph_collaborative_filtering officialmentioned in papermentioned on GitHubtfMITSyntology: not harvested report
CHFsky/ngcf-paddle mentioned on GitHubpaddleSyntology: not harvested report
GitHubLuCheng/Causal-Understanding-of-Fake-News-Dissemination mentioned on GitHubtfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Causal Understanding of Fake News Dissemination on Social Media (arXiv:2010.10580; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
MiloudBi/NGCF-pytorch mentioned on GitHubpytorchSyntology: not harvested report
PreferredAI/cornac mentioned on GitHubtfApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation (arXiv:2002.02126; that paper's own run record: 6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
chfhf/ngcf-paddle mentioned on GitHubpaddleSyntology: not harvested report
florianeBhz/NGCF_Pytorch mentioned on GitHubpytorchSyntology: not harvested report
huangtinglin/NGCF-PyTorch mentioned on GitHubpytorchSyntology: not harvested report
immabe/NGCF_pytorch mentioned on GitHubpytorchMITSyntology: 6 samples, 6 ran (4 instrument-failed) · 0 unverified report
jinfeng-xu/fkan-gcf mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to FourierKAN-GCF: Fourier Kolmogorov-Arnold Network -- An Effective and Efficient... (arXiv:2406.01034; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
lt610/DAGNN mentioned on GitHubpytorchSyntology: not harvested report
madansinghal/graphranko mentioned on GitHubtfMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
massquantity/LibRecommender mentioned on GitHubtfMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Self-supervised Learning for Large-scale Item Recommendations (arXiv:2007.12865; that paper's own run record: 2 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; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
nathann3/better_than_netflix_movie_recommender mentioned on GitHubtfNOASSERTIONSyntology: not harvested report
talkingwallace/NGCF-pytorch mentioned on GitHubpytorchSyntology: not harvested report
weiyinwei/huign mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Inductive Representation Learning on Large Graphs (arXiv:1706.02216; that paper's own run record: 3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method. report
weiyinwei/mmgcn mentioned on GitHubpytorchSyntology: not harvested report
xiaoleiHou214/BGCF-pytorch-master mentioned on GitHubpytorchSyntology: not harvested report
zzz2010/ngcf-paddle2 mentioned on GitHubpaddleSyntology: not harvested report
dmlc/dgl pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to node2vec: Scalable Feature Learning for Networks (arXiv:1607.00653; that paper's own run record: 15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified), Interaction Networks for Learning about Objects, Relations and Physics (arXiv:1612.00222; that paper's own run record: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result), Junction Tree Variational Autoencoder for Molecular Graph Generation (arXiv:1802.04364; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result) and 3 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
liu-jc/PyTorch_NGCF pytorchSyntology: 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

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

1ran · violated contract
3ran · our draft was wrong
1ran; the contract check could not run
2ran

Licence: 6 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. For 6 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. 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.

immabe/NGCF_pytorch community (archive-listed) 6 samples, 6 ran (4 instrument-failed) · 0 unverified
average_precision in 38 papers NGCF/utility/metrics.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · ea02c0066939a02c · report fixture: signature r:ndarray/1/int, cut:int/0/int · returned float64 · level recorded 2026-09-24
hasNumbers in 6 papers NGCF/utility/helper.py ran · violated contract MIT (permissive) here; the stored copy is pointer only · f16f715a59169c8a · report fixture: signature inputString:str/0/str · returned bool · level recorded 2026-09-22
precision_at_k in 27 papers NGCF/utility/metrics.py ran; the contract check could not run (RAISES) fingerprinted MIT (permissive) here; the stored copy is pointer only · de0d0e47ac6bbe6c · report fixture: signature r:list/1/int, k:int/0/int · returned float64 · level recorded 2026-09-24
recall in 38 papers NGCF/utility/metrics.py ran MIT (permissive) here; the stored copy is pointer only · 4437293713f250ee · report fixture: signature rank:list/1/int, ground_truth:list/1/int, N:int/0/int · returned float · level recorded 2026-09-24
txt2list in 6 papers NGCF/utility/helper.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · b07be870060c7e26 · report fixture: signature file_src:str/0/str · returned list · level recorded 2026-09-22
uni2str in 5 papers NGCF/utility/helper.py ran · our draft was wrong fingerprinted MIT (permissive) here; the stored copy is pointer only · ddd78902563c0d71 · report fixture: signature unicode_str:str/0/str · returned str · level recorded 2026-09-22
madansinghal/graphranko community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
root_mean_square_error GraphicoRango/steller_graph_implementation/model.py ran MIT (permissive) · eb2979cf054e5b71 · report fixture: signature s_true:ResourceVariable/2/float, s_pred:ResourceVariable/2/float · returned EagerTensor · level recorded 2026-09-24

Tasks

Collaborative FilteringLink PredictionRecommendation Systems

Datasets

Introduced by this paper, per the archive.

Yelp2018

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Collaborative Filtering Gowalla NGCF Recall@20 0.1570 #11 of 11 Archive leaderboard report
Link Prediction MovieLens 25M NGCF Hits@10 0.7807 #6 of 7 Archive leaderboard report
Link Prediction MovieLens 25M NGCF nDCG@10 0.4866 #6 of 7 Archive leaderboard report
Recommendation Systems Amazon-Book NGCF Recall@20 0.0344 #13 of 16 Archive leaderboard report
Recommendation Systems Amazon-Book NGCF nDCG@20 0.0263 #13 of 16 Archive leaderboard report
Recommendation Systems Gowalla NGCF Recall@20 0.1570 #12 of 13 Archive leaderboard report
Recommendation Systems Gowalla NGCF nDCG@20 0.1327 #12 of 13 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

(2+1)D Convolution

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