AI Paper Atlas

Research map / Graph learning / Knowledge and temporal graphs

Relational Graph Neural Network with Hierarchical Attention for Knowledge Graph Completion

AAAI 2020 · Graph learning › Knowledge and temporal graphs · approach: Inductive knowledge graph completion · 190 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add hierarchical-attention GNN encoder over ConvE decoder (ablation)ConvE · FB15k-237MRR: 0.325 -> 0.522Helped
add hierarchical-attention GNN encoder over ConvE decoder (ablation)ConvE · FB15k high-degree entities (T test 1)MRR: 0.669 -> 0.843Helped
add hierarchical-attention GNN encoder over ConvE decoder (ablation)ConvE · WN18 low-degree (T test 3)MRR: 0.933 -> 0.936No clear effect
ConvE decoder instead of DistMult or ConvKB (ablation)RGHAT · KGC benchmarksMRRHelped
RGHAT vs RotatEKGC · WN18MR: 309 vs 342Hurt
RGHAT vs Nathani's GATKGC · FB15k-237MRR: 0.518 -> 0.522No clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy