Joint Semantics and Data-Driven Path Representation for Knowledge Graph Inference

• URL: http://arxiv.org/abs/2010.02602v1
• Date: Tue, 6 Oct 2020 10:24:45 GMT
• Title: Joint Semantics and Data-Driven Path Representation for Knowledge Graph Inference
• Authors: Guanglin Niu, Bo Li, Yongfei Zhang, Yongpan Sheng, Chuan Shi, Jingyang Li, Shiliang Pu
• Abstract summary: We propose a novel joint semantics and data-driven path representation that balances explainability and generalization in the framework of KG embedding. Our proposed model is evaluated on two classes of tasks: link prediction and path query answering task.
• Score: 60.048447849653876
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Inference 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, which face several challenges: all the existing path-based methods are data-driven, lacking explainability for path representation. Besides, some methods either consider only relational paths or ignore the heterogeneity between entities and relations both contained 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. More specifically, we inject horn rules to obtain the condensed paths by the transparent and explainable path composition procedure. The entity converter is designed to transform the entities along paths into the representations in the semantic level similar to relations for reducing the heterogeneity between entities and relations, in which 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 task. The experimental results show that it has a significant performance gain over several different state-of-the-art baselines.

Related papers

• UniKGQA: Unified Retrieval and Reasoning for Solving Multi-hop Question Answering Over Knowledge Graph [89.98762327725112]
  Multi-hop Question Answering over Knowledge Graph(KGQA) aims to find the answer entities that are multiple hops away from the topic entities mentioned in a natural language question. We propose UniKGQA, a novel approach for multi-hop KGQA task, by unifying retrieval and reasoning in both model architecture and parameter learning.
  arXiv  Detail & Related papers  (2022-12-02T04:08:09Z)
• Entity Alignment with Reliable Path Reasoning and Relation-Aware Heterogeneous Graph Transformer [5.960613525368867]
  We propose a more effective entity alignment framework, RPR-RHGT, which integrates relation and path structure information. An initial reliable path reasoning algorithm is developed to generate the paths favorable for EA task from the relation structures of Knowledge Graphs. To efficiently capture heterogeneous features in entity neighborhoods, a relation-aware heterogeneous graph transformer is designed.
  arXiv  Detail & Related papers  (2022-05-18T09:12:37Z)
• Path-Enhanced Multi-Relational Question Answering with Knowledge Graph Embeddings [16.21156041758793]
  We propose a Path and Knowledge Embedding-Enhanced multi-relational Question Answering model (PKEEQA) We show that PKEEQA improves KBQA models' performance for multi-relational question answering with explainability to some extent derived from paths.
  arXiv  Detail & Related papers  (2021-10-29T08:37:46Z)
• Information Symmetry Matters: A Modal-Alternating Propagation Network for Few-Shot Learning [118.45388912229494]
  We propose a Modal-Alternating Propagation Network (MAP-Net) to supplement the absent semantic information of unlabeled samples. We design a Relation Guidance (RG) strategy to guide the visual relation vectors via semantics so that the propagated information is more beneficial. Our proposed method achieves promising performance and outperforms the state-of-the-art approaches.
  arXiv  Detail & Related papers  (2021-09-03T03:43:53Z)
• Learning the Implicit Semantic Representation on Graph-Structured Data [57.670106959061634]
  Existing representation learning methods in graph convolutional networks are mainly designed by describing the neighborhood of each node as a perceptual whole. We propose a Semantic Graph Convolutional Networks (SGCN) that explores the implicit semantics by learning latent semantic-paths in graphs.
  arXiv  Detail & Related papers  (2021-01-16T16:18:43Z)
• Explainable Link Prediction for Emerging Entities in Knowledge Graphs [44.87285668747474]
  Cross-domain knowledge graphs suffer from inherent incompleteness and sparsity. Link prediction can alleviate this by inferring a target entity, given a source entity and a query relation. We propose an inductive representation learning framework that is able to learn representations of previously unseen entities.
  arXiv  Detail & Related papers  (2020-05-01T22:17:37Z)
• On the Role of Conceptualization in Commonsense Knowledge Graph Construction [59.39512925793171]
  Commonsense knowledge graphs (CKGs) like Atomic and ASER are substantially different from conventional KGs. We introduce to CKG construction methods conceptualization to view entities mentioned in text as instances of specific concepts or vice versa. Our methods can effectively identify plausible triples and expand the KG by triples of both new nodes and edges of high diversity and novelty.
  arXiv  Detail & Related papers  (2020-03-06T14:35:20Z)
• End-to-End Entity Linking and Disambiguation leveraging Word and Knowledge Graph Embeddings [20.4826750211045]
  We propose the first end-to-end neural network approach that employs KG as well as word embeddings to perform joint relation and entity classification of simple questions. An empirical evaluation shows that the proposed approach achieves a performance comparable to state-of-the-art entity linking.
  arXiv  Detail & Related papers  (2020-02-25T19:07:54Z)
• Relational Message Passing for Knowledge Graph Completion [78.47976646383222]
  We propose a relational message passing method for knowledge graph completion. It passes relational messages among edges iteratively to aggregate neighborhood information. Results show our method outperforms stateof-the-art knowledge completion methods by a large margin.
  arXiv  Detail & Related papers  (2020-02-17T03:33:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.