Transductive Data Augmentation with Relational Path Rule Mining for Knowledge Graph Embedding

• URL: http://arxiv.org/abs/2111.00974v1
• Date: Mon, 1 Nov 2021 14:35:14 GMT
• Title: Transductive Data Augmentation with Relational Path Rule Mining for Knowledge Graph Embedding
• Authors: Yushi Hirose, Masashi Shimbo, Taro Watanabe
• Abstract summary: We propose transductive data augmentation by relation path rules and confidence-based weighting of augmented data. The results and analysis show that our proposed method effectively improves the performance of the embedding model by augmenting data that include true answers or entities similar to them.
• Score: 5.603379389073144
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For knowledge graph completion, two major types of prediction models exist: one based on graph embeddings, and the other based on relation path rule induction. They have different advantages and disadvantages. To take advantage of both types, hybrid models have been proposed recently. One of the hybrid models, UniKER, alternately augments training data by relation path rules and trains an embedding model. Despite its high prediction accuracy, it does not take full advantage of relation path rules, as it disregards low-confidence rules in order to maintain the quality of augmented data. To mitigate this limitation, we propose transductive data augmentation by relation path rules and confidence-based weighting of augmented data. The results and analysis show that our proposed method effectively improves the performance of the embedding model by augmenting data that include true answers or entities similar to them.

Related papers

• Improving rule mining via embedding-based link prediction [2.422410293747519]
  Rule mining on knowledge graphs allows for explainable link prediction. Several approaches combining the two families have been proposed in recent years. We propose a new way to combine the two families of approaches.
  arXiv  Detail & Related papers  (2024-06-14T15:53:30Z)
• Endowing Pre-trained Graph Models with Provable Fairness [49.8431177748876]
  We propose a novel adapter-tuning framework that endows pre-trained graph models with provable fairness (called GraphPAR) Specifically, we design a sensitive semantic augmenter on node representations, to extend the node representations with different sensitive attribute semantics for each node. With GraphPAR, we quantify whether the fairness of each node is provable, i.e., predictions are always fair within a certain range of sensitive attribute semantics.
  arXiv  Detail & Related papers  (2024-02-19T14:16:08Z)
• DualAug: Exploiting Additional Heavy Augmentation with OOD Data Rejection [77.6648187359111]
  We propose a novel data augmentation method, named textbfDualAug, to keep the augmentation in distribution as much as possible at a reasonable time and computational cost. Experiments on supervised image classification benchmarks show that DualAug improve various automated data augmentation method.
  arXiv  Detail & Related papers  (2023-10-12T08:55:10Z)
• To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion [35.05965140700747]
  We extend embedding models by allowing to explicitly copy target information from related factual triples for more accurate prediction. We also propose a novel relative distance based negative sampling technique (ReD) for more effective optimization.
  arXiv  Detail & Related papers  (2023-05-23T14:53:20Z)
• Multi-Aspect Explainable Inductive Relation Prediction by Sentence Transformer [60.75757851637566]
  We introduce the concepts of relation path coverage and relation path confidence to filter out unreliable paths prior to model training to elevate the model performance. We propose Knowledge Reasoning Sentence Transformer (KRST) to predict inductive relations in knowledge graphs.
  arXiv  Detail & Related papers  (2023-01-04T15:33:49Z)
• Causal Incremental Graph Convolution for Recommender System Retraining [89.25922726558875]
  Real-world recommender system needs to be regularly retrained to keep with the new data. In this work, we consider how to efficiently retrain graph convolution network (GCN) based recommender models.
  arXiv  Detail & Related papers  (2021-08-16T04:20:09Z)
• KGRefiner: Knowledge Graph Refinement for Improving Accuracy of Translational Link Prediction Methods [4.726777092009553]
  This paper proposes a method for refining the knowledge graph. It makes the knowledge graph more informative, and link prediction operations can be performed more accurately. Our experiments show that our method can significantly increase the performance of translational link prediction methods.
  arXiv  Detail & Related papers  (2021-06-27T13:32:39Z)
• Training Robust Graph Neural Networks with Topology Adaptive Edge Dropping [116.26579152942162]
  Graph neural networks (GNNs) are processing architectures that exploit graph structural information to model representations from network data. Despite their success, GNNs suffer from sub-optimal generalization performance given limited training data. This paper proposes Topology Adaptive Edge Dropping to improve generalization performance and learn robust GNN models.
  arXiv  Detail & Related papers  (2021-06-05T13:20:36Z)
• NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion [31.838865331557496]
  We propose a new hybrid link prediction model that couples the expressiveness of deep models with the speed and size of linear models. NePTuNe provides state-of-the-art performance on the FB15K-237 dataset and near state-of-the-art performance on the WN18RR dataset.
  arXiv  Detail & Related papers  (2021-04-15T23:48:26Z)
• Learning Reasoning Strategies in End-to-End Differentiable Proving [50.9791149533921]
  Conditional Theorem Provers learn optimal rule selection strategy via gradient-based optimisation. We show that Conditional Theorem Provers are scalable and yield state-of-the-art results on the CLUTRR dataset.
  arXiv  Detail & Related papers  (2020-07-13T16:22:14Z)
• Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental Study [0.0]
  This paper is the first systematic study with the main objective of assessing the true effectiveness of embedding models. Our experiment results show these models are much less accurate than what we used to perceive.
  arXiv  Detail & Related papers  (2020-03-18T01:18:09Z)

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.