CoChat

Modeling Relation Paths for Knowledge Graph Completion

Shen, Ying, Ding, Ning, Zheng, Hai-Tao, Li, Yaliang, Yang, Min · 2021 · IEEE Transactions on Knowledge and Data Engineering

The DOI matches its Crossref record; 55 of the 57 references it cites were found in a registry or an index.

Abstract

Knowledge graphs (KG) often encounter knowledge incompleteness. The path reasoning that predicts the unknown path relation between pairwise entities based on existing facts is one of the most promising approaches to the knowledge graph completion. However, most conventional path reasoning methods exclusively consider the entity description included in fact triples, ignoring both the type information of entities and the interaction between different semantic representations. In this study, we propose a novel method, Type-aware Attentive Path Reasoning (TAPR), to complete the knowledge graph by simultaneously considering KG structural information, textual information, and type information. More specifically, we first leverage types to enrich the representational learning of entities and relationships. Next, we describe a type-level attention to select the most relevant type of given entity in a specific triple without any predefined rules or patterns to reduce the impact of noisy types. After learning the distributed representation of all paths, path-level attention assigns different weights to paths, from which relations among entity pairs are calculated. We conduct a series of experiments on a real-world dataset to demonstrate the effectiveness of TAPR. Experimental results show that our method significantly outperforms all baselines on link prediction and entity prediction tasks.

Overview

Integrity signals

Registry

Crossref · 10.1109/tkde.2020.2970044

Cites

55 of 55 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 55 references

Research works printed but not linked: 2

  1. xie, 2016, Representation learning of knowledge graphs with hierarchical types, Proc 25th Int Joint Conf Artif Intell, 2965
  2. deaton, 2005, The comprehensive terrorism knowledge base in CYC, Proc Int Conf Intell Anal, 1

Cited by

See all 155

Metadata

Authors
Shen, Y., Ding, N., Zheng, H.-T., Li, Y., & Yang, M.
Affiliations
  • Sun Yat-sen University (CN)
  • Tsinghua Shenzhen International Graduate School (CN)
  • Chinese Academy of Sciences (CN)
Venue
IEEE Transactions on Knowledge and Data Engineering
Published
2021-11-01
Volume
33
Issue
11
Pages
3607-3617
ISSN
  • 1041-4347 (ISSN-L)
  • 1558-2191
  • 2326-3865
OpenAlex
W3003507729
Cited by
153
References
57
Citations by year
2026: 9 · 2025: 20 · 2024: 31 · 2023: 74 · 2022: 13 · 2021: 6
FWCI
9.14
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Knowledge and Data Engineering (publishedVersion)
Funders
  • National Natural Science Foundation of China (61602013, 61773229)
  • Shenzhen Fundamental Research Program (JCYJ20170818091546869)
  • Basic Scientific Research Program of Shenzhen City (JCYJ20160331184440545)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
Keywords
knowledge graph completion, path reasoning, entity types, link prediction, entity prediction, knowledge graph incompleteness, entity representation learning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Modeling Relation Paths for Knowledge Graph Completion. https://app.cochat.ai/papers/10.1109/tkde.2020.2970044
The paper
Shen, Y., Ding, N., Zheng, H.-T., Li, Y., & Yang, M. (2021). Modeling Relation Paths for Knowledge Graph Completion. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2020.2970044

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.