BROWSE
Detail
Journal Article
Fast Knowledge Graph Completion using Graphics Processing Units
Cited 0 time in 
Share 
Share
- Authors
- Chun-Hee Lee, Dong-oh Kang, Hwa Jeon Song
- Issue Date
- 2024-08
- Citation
- Journal of Parallel and Distributed Computing, v.190, pp.1-15
- ISSN
- 0743-7315
- Publisher
- Elsevier Inc.
- Language
- English
- Type
- Journal Article
- 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×N×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.
- KSP Keywords
- Completion problem, Data semantics, Embedding model, Knowledge graph embedding, Metric space, Similarity Join, Vector operations, answering systems, graphics processing units(GPUs), knowledge based systems, question answering