Fast Knowledge Graph Completion using Graphics Processing Units
- URL: http://arxiv.org/abs/2307.12059v1
- Date: Sat, 22 Jul 2023 12:00:54 GMT
- Title: Fast Knowledge Graph Completion using Graphics Processing Units
- Authors: Chun-Hee Lee, Dong-oh Kang, Hwa Jeon Song
- Abstract summary: Current knowledge graphs need to be complemented for better knowledge in terms of relations.
To add new relations by using knowledge graph embedding models, we have to evaluate $Ntimes N times R$ vector operations.
We provide an efficient knowledge graph completion framework on GPUs to get new relations using knowledge graph embedding vectors.
- Score: 0.1611401281366893
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Knowledge graphs can be used in many areas related to data semantics such as
question-answering systems, knowledge based systems. However, the currently
constructed knowledge graphs need to be complemented for better knowledge in
terms of relations. It is called knowledge graph completion. To add new
relations to the existing knowledge graph by using knowledge graph embedding
models, we have to evaluate $N\times N \times R$ vector operations, where $N$
is the number of entities and $R$ is the number of relation types. It is very
costly.
In this paper, we provide an efficient knowledge graph completion framework
on GPUs to get new relations using knowledge graph embedding vectors. In the
proposed framework, we first define "transformable to a metric space" and then
provide a method to transform the knowledge graph completion problem into the
similarity join problem for a model which is "transformable to a metric space".
After that, to efficiently process the similarity join problem, we derive
formulas using the properties of a metric space. Based on the formulas, we
develop a fast knowledge graph completion algorithm. Finally, we experimentally
show that our framework can efficiently process the knowledge graph completion
problem.
Related papers
- Relations Prediction for Knowledge Graph Completion using Large Language Models [0.0]
We make use of the knowledge graph node names to fine-tune a large language model for the relation prediction task.
Our experiments show that we accomplish new scores on a widely used knowledge graph benchmark.
arXiv Detail & Related papers (2024-05-04T19:04:51Z) - MGNet: Learning Correspondences via Multiple Graphs [78.0117352211091]
Learning correspondences aims to find correct correspondences from the initial correspondence set with an uneven correspondence distribution and a low inlier rate.
Recent advances usually use graph neural networks (GNNs) to build a single type of graph or stack local graphs into the global one to complete the task.
We propose MGNet to effectively combine multiple complementary graphs.
arXiv Detail & Related papers (2024-01-10T07:58:44Z) - KGrEaT: A Framework to Evaluate Knowledge Graphs via Downstream Tasks [1.8722948221596285]
KGrEaT is a framework to estimate the quality of knowledge graphs via actual downstream tasks like classification, clustering, or recommendation.
The framework takes a knowledge graph as input, automatically maps it to the datasets to be evaluated on, and computes performance metrics for the defined tasks.
arXiv Detail & Related papers (2023-08-21T07:43:10Z) - InGram: Inductive Knowledge Graph Embedding via Relation Graphs [16.005051393690792]
In this paper, we propose an INductive knowledge GRAph eMbedding method, InGram, that can generate embeddings of new relations as well as new entities at inference time.
Experimental results show that InGram outperforms 14 different state-of-the-art methods on varied inductive learning scenarios.
arXiv Detail & Related papers (2023-05-31T16:10:42Z) - Learnable Graph Matching: A Practical Paradigm for Data Association [74.28753343714858]
We propose a general learnable graph matching method to address these issues.
Our method achieves state-of-the-art performance on several MOT datasets.
For image matching, our method outperforms state-of-the-art methods on a popular indoor dataset, ScanNet.
arXiv Detail & Related papers (2023-03-27T17:39:00Z) - Bringing Your Own View: Graph Contrastive Learning without Prefabricated
Data Augmentations [94.41860307845812]
Self-supervision is recently surging at its new frontier of graph learning.
GraphCL uses a prefabricated prior reflected by the ad-hoc manual selection of graph data augmentations.
We have extended the prefabricated discrete prior in the augmentation set, to a learnable continuous prior in the parameter space of graph generators.
We have leveraged both principles of information minimization (InfoMin) and information bottleneck (InfoBN) to regularize the learned priors.
arXiv Detail & Related papers (2022-01-04T15:49:18Z) - Transformation of Node to Knowledge Graph Embeddings for Faster Link
Prediction in Social Networks [2.458658951393896]
Recent advances in neural networks have solved common graph problems such as link prediction, node classification, node clustering, node recommendation.
In this work, we investigate a transformation model which converts node embeddings obtained from random walk based methods to embeddings obtained from knowledge graph methods directly without an increase in the computational cost.
arXiv Detail & Related papers (2021-11-17T04:57:41Z) - Learnable Graph Matching: Incorporating Graph Partitioning with Deep
Feature Learning for Multiple Object Tracking [58.30147362745852]
Data association across frames is at the core of Multiple Object Tracking (MOT) task.
Existing methods mostly ignore the context information among tracklets and intra-frame detections.
We propose a novel learnable graph matching method to address these issues.
arXiv Detail & Related papers (2021-03-30T08:58:45Z) - About Graph Degeneracy, Representation Learning and Scalability [2.029783382155471]
We present two techniques taking advantage of the K-Core Decomposition to reduce the time and memory consumption of walk-based Graph Representation Learning algorithms.
We evaluate the performances, expressed in terms of quality of embedding and computational resources, of the proposed techniques on several academic datasets.
arXiv Detail & Related papers (2020-09-04T09:39:43Z) - 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) - 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.