Papers › End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion

End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion

11 Nov 2018arXiv:1811.04441archive 2025-07-28

Chao Shang, Yun Tang, Jing Huang, Jinbo Bi, Xiaodong He, Bo-Wen Zhou

Knowledge graph embedding has been an active research topic for knowledge base completion, with progressive improvement from the initial TransE, TransH, DistMult et al to the current state-of-the-art ConvE. ConvE uses 2D convolution over embeddings and multiple layers of nonlinear features to model knowledge graphs. The model can be efficiently trained and scalable to large knowledge graphs. However, there is no structure enforcement in the embedding space of ConvE. The recent graph convolutional network (GCN) provides another way of learning graph node embedding by successfully utilizing graph connectivity structure. In this work, we propose a novel end-to-end Structure-Aware Convolutional Network (SACN) that takes the benefit of GCN and ConvE together. SACN consists of an encoder of a weighted graph convolutional network (WGCN), and a decoder of a convolutional network called Conv-TransE. WGCN utilizes knowledge graph node structure, node attributes and edge relation types. It has learnable weights that adapt the amount of information from neighbors used in local aggregation, leading to more accurate embeddings of graph nodes. Node attributes in the graph are represented as additional nodes in the WGCN. The decoder Conv-TransE enables the state-of-the-art ConvE to be translational between entities and relations while keeps the same link prediction performance as ConvE. We demonstrate the effectiveness of the proposed SACN on standard FB15k-237 and WN18RR datasets, and it gives about 10% relative improvement over the state-of-the-art ConvE in terms of HITS@1, HITS@3 and HITS@10.

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="1811.04441")

Code

Syntology Ran 0 of 3 code samples harvested from 1 repository linked to this paper; 3 have no recorded run.

By repository: official repository: 3 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

JD-AI-Research-Silicon-Valley/SACN officialmentioned in papermentioned on GitHubpytorchMIT 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

3 samples harvested; 0 ran; 0 honoured the contract we drafted; 3 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.

3unverified

Licence: 0 of the 3 samples are 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 JD-AI-Research-Silicon-Valley/SACN. “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.

check_for_reversible_relations JD-AI-Research-Silicon-Valley/SACN/inverse_model.py official repository unverified MIT (permissive) · 24ef53c5c5b147a5 · report
get_list_of_torch_modules JD-AI-Research-Silicon-Valley/SACN/src/spodernet/spodernet/backends/torchbackend.py official repository unverified MIT (permissive) · 35195ac220d2639d · report
predictor JD-AI-Research-Silicon-Valley/SACN/src/spodernet/spodernet/backends/tfmodels.py official repository unverified MIT (permissive) · bcbee6026f554da1 · report

Tasks

DecoderGraph EmbeddingKnowledge Base CompletionKnowledge Graph EmbeddingKnowledge GraphsLink Prediction

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Link Prediction FB15k-237 Structure-Aware Convolutional Networks Hits@1 0.26 #30 of 75 Archive leaderboard report
Link Prediction FB15k-237 Structure-Aware Convolutional Networks Hits@10 0.54 #30 of 75 Archive leaderboard report
Link Prediction FB15k-237 Structure-Aware Convolutional Networks Hits@3 0.39 #30 of 75 Archive leaderboard report
Link Prediction FB15k-237 Structure-Aware Convolutional Networks MRR 0.35 #30 of 75 Archive leaderboard report
Link Prediction WN18RR Structure-Aware Convolutional Networks Hits@1 0.43 #56 of 75 Archive leaderboard report
Link Prediction WN18RR Structure-Aware Convolutional Networks Hits@10 0.54 #56 of 75 Archive leaderboard report
Link Prediction WN18RR Structure-Aware Convolutional Networks Hits@3 0.48 #56 of 75 Archive leaderboard report
Link Prediction WN18RR Structure-Aware Convolutional Networks MRR 0.47 #56 of 75 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

GCNTransE

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