Benchmarking neural embeddings for link prediction in knowledge graphs under semantic and structural changes

• URL: http://arxiv.org/abs/2005.07654v2
• Date: Thu, 28 May 2020 08:11:29 GMT
• Title: Benchmarking neural embeddings for link prediction in knowledge graphs under semantic and structural changes
• Authors: Asan Agibetov, Matthias Samwald
• Abstract summary: We propose an open-source evaluation pipeline, which benchmarks the accuracy of neural embeddings. We define relation-centric connectivity measures that allow us to connect the link prediction capacity to the structure of the knowledge graph.
• Score: 6.23228063561537
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, link prediction algorithms based on neural embeddings have gained tremendous popularity in the Semantic Web community, and are extensively used for knowledge graph completion. While algorithmic advances have strongly focused on efficient ways of learning embeddings, fewer attention has been drawn to the different ways their performance and robustness can be evaluated. In this work we propose an open-source evaluation pipeline, which benchmarks the accuracy of neural embeddings in situations where knowledge graphs may experience semantic and structural changes. We define relation-centric connectivity measures that allow us to connect the link prediction capacity to the structure of the knowledge graph. Such an evaluation pipeline is especially important to simulate the accuracy of embeddings for knowledge graphs that are expected to be frequently updated.

Related papers

• Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph Completion [69.55700751102376]
  Few-shot knowledge graph completion (FKGC) aims to predict missing facts for unseen relations with few-shot associated facts. Existing FKGC methods are based on metric learning or meta-learning, which often suffer from the out-of-distribution and overfitting problems. In this paper, we propose a normalizing flow-based neural process for few-shot knowledge graph completion (NP-FKGC)
  arXiv  Detail & Related papers  (2023-04-17T11:42:28Z)
• State of the Art and Potentialities of Graph-level Learning [54.68482109186052]
  Graph-level learning has been applied to many tasks including comparison, regression, classification, and more. Traditional approaches to learning a set of graphs rely on hand-crafted features, such as substructures. Deep learning has helped graph-level learning adapt to the growing scale of graphs by extracting features automatically and encoding graphs into low-dimensional representations.
  arXiv  Detail & Related papers  (2023-01-14T09:15:49Z)
• Informed Machine Learning for Improved Similarity Assessment in Process-Oriented Case-Based Reasoning [1.370633147306388]
  We investigate the potential of integrating domain knowledge into Graph Neural Networks (GNNs) First, a special data representation and processing method is used that encodes structural knowledge about the semantic annotations of each graph node and edge. Second, the message-passing component of the GNNs is constrained by knowledge on legal node mappings.
  arXiv  Detail & Related papers  (2021-06-30T09:31:58Z)
• 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)
• SpikE: spike-based embeddings for multi-relational graph data [0.0]
  spiking neural networks are still mostly applied to tasks stemming from sensory processing. A rich data representation that finds wide application in industry and research is the so-called knowledge graph. We propose a spike-based algorithm where nodes in a graph are represented by single spike times of neuron populations.
  arXiv  Detail & Related papers  (2021-04-27T18:00:12Z)
• Knowledge Graph Completion with Text-aided Regularization [2.8361571014635407]
  Knowledge Graph Completion is a task of expanding the knowledge graph/base through estimating possible entities. Traditional approaches mainly focus on using the existing graphical information that is intrinsic of the graph. We try numerous ways of using extracted or raw textual information to help existing KG embedding frameworks reach better prediction results.
  arXiv  Detail & Related papers  (2021-01-22T06:10:09Z)
• Neural graph embeddings as explicit low-rank matrix factorization for link prediction [0.0]
  We propose an improved approach to learning low-rank factorization embeddings that incorporate information from unlikely pairs of nodes. Based on our results and observations we outline further steps that could improve the design of next graph embedding algorithms.
  arXiv  Detail & Related papers  (2020-11-16T14:23:12Z)
• 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)
• A Heterogeneous Graph with Factual, Temporal and Logical Knowledge for Question Answering Over Dynamic Contexts [81.4757750425247]
  We study question answering over a dynamic textual environment. We develop a graph neural network over the constructed graph, and train the model in an end-to-end manner.
  arXiv  Detail & Related papers  (2020-04-25T04:53:54Z)
• Graph Representation Learning via Graphical Mutual Information Maximization [86.32278001019854]
  We propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. We develop an unsupervised learning model trained by maximizing GMI between the input and output of a graph neural encoder.
  arXiv  Detail & Related papers  (2020-02-04T08:33:49Z)
• Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs [96.73259297063619]
  We consider a novel formulation, zero-shot learning, to free this cumbersome curation. For newly-added relations, we attempt to learn their semantic features from their text descriptions. We leverage Generative Adrial Networks (GANs) to establish the connection between text and knowledge graph domain.
  arXiv  Detail & Related papers  (2020-01-08T01:19:08Z)

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.