Message Passing for Hyper-Relational Knowledge Graphs

• URL: http://arxiv.org/abs/2009.10847v1
• Date: Tue, 22 Sep 2020 22:38:54 GMT
• Title: Message Passing for Hyper-Relational Knowledge Graphs
• Authors: Mikhail Galkin, Priyansh Trivedi, Gaurav Maheshwari, Ricardo Usbeck, Jens Lehmann
• Abstract summary: We propose a message passing graph encoder - StarE capable of modeling such hyper-relational knowledge graphs. StarE can encode an arbitrary number of additional information (qualifiers) along with the main triple while keeping the semantic roles of qualifiers and triples intact. Our experiments demonstrate that StarE based LP model outperforms existing approaches across multiple benchmarks.
• Score: 7.733963597282456
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hyper-relational knowledge graphs (KGs) (e.g., Wikidata) enable associating additional key-value pairs along with the main triple to disambiguate, or restrict the validity of a fact. In this work, we propose a message passing based graph encoder - StarE capable of modeling such hyper-relational KGs. Unlike existing approaches, StarE can encode an arbitrary number of additional information (qualifiers) along with the main triple while keeping the semantic roles of qualifiers and triples intact. We also demonstrate that existing benchmarks for evaluating link prediction (LP) performance on hyper-relational KGs suffer from fundamental flaws and thus develop a new Wikidata-based dataset - WD50K. Our experiments demonstrate that StarE based LP model outperforms existing approaches across multiple benchmarks. We also confirm that leveraging qualifiers is vital for link prediction with gains up to 25 MRR points compared to triple-based representations.

Related papers

• Scalable Weibull Graph Attention Autoencoder for Modeling Document Networks [50.42343781348247]
  We develop a graph Poisson factor analysis (GPFA) which provides analytic conditional posteriors to improve the inference accuracy. We also extend GPFA to a multi-stochastic-layer version named graph Poisson gamma belief network (GPGBN) to capture the hierarchical document relationships at multiple semantic levels. Our models can extract high-quality hierarchical latent document representations and achieve promising performance on various graph analytic tasks.
  arXiv  Detail & Related papers  (2024-10-13T02:22:14Z)
• Less is More: One-shot Subgraph Reasoning on Large-scale Knowledge Graphs [49.547988001231424]
  We propose the one-shot-subgraph link prediction to achieve efficient and adaptive prediction. Design principle is that, instead of directly acting on the whole KG, the prediction procedure is decoupled into two steps. We achieve promoted efficiency and leading performances on five large-scale benchmarks.
  arXiv  Detail & Related papers  (2024-03-15T12:00:12Z)
• A Relation-Interactive Approach for Message Passing in Hyper-relational Knowledge Graphs [0.0]
  We propose a message-passing-based graph encoder with global relation structure awareness ability, which we call ReSaE. Our experiments demonstrate that ReSaE achieves state-of-the-art performance on multiple link prediction benchmarks.
  arXiv  Detail & Related papers  (2024-02-23T06:55:04Z)
• Adaptive Hypergraph Network for Trust Prediction [23.219647971257725]
  Hypergraphs offer a flexible approach to modeling complex high-order correlations. Most hypergraph-based methods are generic and cannot be well applied to the trust prediction task. We propose an Adaptive Hypergraph Network for Trust Prediction (AHNTP) to improve trust prediction accuracy by using higher-order correlations.
  arXiv  Detail & Related papers  (2024-02-07T15:21:18Z)
• HyperFormer: Enhancing Entity and Relation Interaction for Hyper-Relational Knowledge Graph Completion [25.399684403558553]
  Hyper-relational knowledge graphs (HKGs) extend standard knowledge graphs by associating attribute-value qualifiers to triples. We propose HyperFormer, a model that considers local-level sequential information, which encodes the content of the entities, relations and qualifiers of a triple.
  arXiv  Detail & Related papers  (2023-08-12T09:31:43Z)
• Few-shot Link Prediction on N-ary Facts [70.8150181683017]
  Link Prediction on Hyper-relational Facts (LPHFs) is to predict a missing element in a hyper-relational fact. Few-Shot Link Prediction on Hyper-relational Facts (PHFs) aims to predict a missing entity in a hyper-relational fact with limited support instances.
  arXiv  Detail & Related papers  (2023-05-10T12:44:00Z)
• A Dataset for Hyper-Relational Extraction and a Cube-Filling Approach [59.89749342550104]
  We propose the task of hyper-relational extraction to extract more specific and complete facts from text. Existing models cannot perform hyper-relational extraction as it requires a model to consider the interaction between three entities. We propose CubeRE, a cube-filling model inspired by table-filling approaches and explicitly considers the interaction between relation triplets and qualifiers.
  arXiv  Detail & Related papers  (2022-11-18T03:51:28Z)
• DHGE: Dual-View Hyper-Relational Knowledge Graph Embedding for Link Prediction and Entity Typing [1.2932412290302255]
  We propose a dual-view hyper-relational KG structure (DH-KG) that contains a hyper-relational instance view for entities and a hyper-relational view for concepts that are abstracted hierarchically from the entities. This paper defines link prediction and entity typing tasks on DH-KG for the first time and constructs two DH-KG datasets, JW44K-6K, extracted from Wikidata, and HTDM based on medical data.
  arXiv  Detail & Related papers  (2022-07-18T12:44:59Z)
• Are Missing Links Predictable? An Inferential Benchmark for Knowledge Graph Completion [79.07695173192472]
  InferWiki improves upon existing benchmarks in inferential ability, assumptions, and patterns. Each testing sample is predictable with supportive data in the training set. In experiments, we curate two settings of InferWiki varying in sizes and structures, and apply the construction process on CoDEx as comparative datasets.
  arXiv  Detail & Related papers  (2021-08-03T09:51:15Z)
• Improving Inductive Link Prediction Using Hyper-Relational Facts [15.820005235333882]
  We study the benefits of employing hyper-relational KGs on a wide range of semi- and fully inductive link prediction tasks powered by graph neural networks. Our experiments show that qualifiers over typed edges can lead to performance improvements of 6% of absolute gains.
  arXiv  Detail & Related papers  (2021-07-10T19:16:03Z)
• Learning Intents behind Interactions with Knowledge Graph for Recommendation [93.08709357435991]
  Knowledge graph (KG) plays an increasingly important role in recommender systems. Existing GNN-based models fail to identify user-item relation at a fine-grained level of intents. We propose a new model, Knowledge Graph-based Intent Network (KGIN)
  arXiv  Detail & Related papers  (2021-02-14T03:21:36Z)

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.