Inter-domain Multi-relational Link Prediction

• URL: http://arxiv.org/abs/2106.06171v1
• Date: Fri, 11 Jun 2021 05:10:31 GMT
• Title: Inter-domain Multi-relational Link Prediction
• Authors: Luu Huu Phuc, Koh Takeuchi, Seiji Okajima, Arseny Tolmachev, Tomoyoshi Takebayashi, Koji Maruhashi, Hisashi Kashima
• Abstract summary: When related graphs coexist, it is of great benefit to build a larger graph via integrating the smaller ones. The integration requires predicting hidden relational connections between entities belonged to different graphs. We propose a new approach to tackle the inter-domain link prediction problem by softly aligning the entity distributions between different domains.
• Score: 19.094154079752123
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-relational graph is a ubiquitous and important data structure, allowing flexible representation of multiple types of interactions and relations between entities. Similar to other graph-structured data, link prediction is one of the most important tasks on multi-relational graphs and is often used for knowledge completion. When related graphs coexist, it is of great benefit to build a larger graph via integrating the smaller ones. The integration requires predicting hidden relational connections between entities belonged to different graphs (inter-domain link prediction). However, this poses a real challenge to existing methods that are exclusively designed for link prediction between entities of the same graph only (intra-domain link prediction). In this study, we propose a new approach to tackle the inter-domain link prediction problem by softly aligning the entity distributions between different domains with optimal transport and maximum mean discrepancy regularizers. Experiments on real-world datasets show that optimal transport regularizer is beneficial and considerably improves the performance of baseline methods.

Related papers

• Towards Better Graph-based Cross-document Relation Extraction via Non-bridge Entity Enhancement and Prediction Debiasing [30.204313638661255]
  Cross-document Relation Extraction aims to predict the relation between target entities located in different documents. We propose a novel graph-based cross-document RE model with non-bridge entity enhancement and prediction debiasing.
  arXiv  Detail & Related papers  (2024-06-24T11:08:28Z)
• Multi-Relational Graph Neural Network for Out-of-Domain Link Prediction [12.475382123139024]
  We introduce a novel Graph Neural Network model, named GOOD, to tackle the out-of-domain generalization problem. GOOD can effectively generalize predictions out of known relationship types and achieve state-of-the-art results.
  arXiv  Detail & Related papers  (2024-03-17T18:08:22Z)
• Revisiting Link Prediction: A Data Perspective [59.296773787387224]
  Link prediction, a fundamental task on graphs, has proven indispensable in various applications, e.g., friend recommendation, protein analysis, and drug interaction prediction. Evidence in existing literature underscores the absence of a universally best algorithm suitable for all datasets. We recognize three fundamental factors critical to link prediction: local structural proximity, global structural proximity, and feature proximity.
  arXiv  Detail & Related papers  (2023-10-01T21:09:59Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction [79.15394378571132]
  We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph. The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge. We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
  arXiv  Detail & Related papers  (2023-02-27T22:56:06Z)
• Cross-Domain Few-Shot Relation Extraction via Representation Learning and Domain Adaptation [1.1602089225841632]
  Few-shot relation extraction aims to recognize novel relations with few labeled sentences in each relation. Previous metric-based few-shot relation extraction algorithms identify relationships by comparing the prototypes generated by the few labeled sentences embedding with the embeddings of the query sentences using a trained metric function. We suggest learning more interpretable and efficient prototypes from prior knowledge and the intrinsic semantics of relations to extract new relations in various domains more effectively.
  arXiv  Detail & Related papers  (2022-12-05T19:34:52Z)
• Dynamic Relation Discovery and Utilization in Multi-Entity Time Series Forecasting [92.32415130188046]
  In many real-world scenarios, there could exist crucial yet implicit relation between entities. We propose an attentional multi-graph neural network with automatic graph learning (A2GNN) in this work.
  arXiv  Detail & Related papers  (2022-02-18T11:37:04Z)
• r-GAT: Relational Graph Attention Network for Multi-Relational Graphs [8.529080554172692]
  Graph Attention Network (GAT) focuses on modelling simple undirected and single relational graph data only. We propose r-GAT, a relational graph attention network to learn multi-channel entity representations. Experiments on link prediction and entity classification tasks show that our r-GAT can model multi-relational graphs effectively.
  arXiv  Detail & Related papers  (2021-09-13T12:43:00Z)
• Link Prediction on N-ary Relational Facts: A Graph-based Approach [18.01071110085996]
  Link prediction on knowledge graphs (KGs) is a key research topic. This paper considers link prediction upon n-ary relational facts and proposes a graph-based approach to this task.
  arXiv  Detail & Related papers  (2021-05-18T12:40:35Z)
• Learning to Combine: Knowledge Aggregation for Multi-Source Domain Adaptation [56.694330303488435]
  We propose a Learning to Combine for Multi-Source Domain Adaptation (LtC-MSDA) framework. In the nutshell, a knowledge graph is constructed on the prototypes of various domains to realize the information propagation among semantically adjacent representations. Our approach outperforms existing methods with a remarkable margin.
  arXiv  Detail & Related papers  (2020-07-17T07:52:44Z)
• Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction [69.1473775184952]
  We introduce a realistic problem of few-shot out-of-graph link prediction. We tackle this problem with a novel transductive meta-learning framework. We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
  arXiv  Detail & Related papers  (2020-06-11T17:42:46Z)

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.