.png){kind=icon}
.png){kind=icon}
Return
Joint semantics and data-driven path representation for knowledge graph reasoning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2022.02.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Reasoning on a large-scale knowledge graph (KG) is of great importance for KG applications like question answering. The path-based reasoning models can leverage much information over paths other than pure triples in the KG but face several challenges. Firstly, all the existing path-based methods are data-driven, lacking explainability, namely how the path representations and the reasoning results are obtained with human-understandable explanations. Besides, some approaches either consider only relational paths or ignore the heterogeneity between entities and relations both in paths, which cannot capture the rich semantics of paths well. To address the above challenges, in this work, we propose a novel joint semantics and data-driven path representation that balances explainability and generalization in the framework of KG embedding. Specifically, we inject horn rules to obtain the condensed paths through a transparent and explainable path composition procedure. The entity converter is designed to transform entities along paths into the representations in the semantic level similar to relations for reducing the heterogeneity between entities and relations. The KGs, both with and without type information, are considered. Our proposed model is evaluated on two classes of tasks: link prediction and path query answering. The experimental results show that our model obtains significant performance gains over several state-ofthe-art baselines. (c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Knowledge graph reasoning
Path representation
Horn rules
Entity converting
Joint semantics and data-driven
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W