Path-based reasoning approach for knowledge graph completion using CNN-BiLSTM with attention mechanism
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jagvaral, Batselem | - |
dc.contributor.author | Lee, Wan-Kon | - |
dc.contributor.author | Roh, Jae-Seung | - |
dc.contributor.author | Kim, Min-Sung | - |
dc.contributor.author | Park, Young Tack | - |
dc.date.available | 2020-03-18T07:20:06Z | - |
dc.date.created | 2020-03-05 | - |
dc.date.issued | 2020-03 | - |
dc.identifier.issn | 0957-4174 | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/35620 | - |
dc.description.abstract | Knowledge graphs are valuable resources for building intelligent systems such as question answering or recommendation systems. However, most knowledge graphs are impaired by missing relationships between entities. Embedding methods that translate entities and relations into a low-dimensional space achieve great results, but they only focus on the direct relations between entities and neglect the presence of path relations in graphs. On the contrary, path-based embedding methods consider a single path to make inferences. It also relies on simple recurrent neural networks while highly efficient neural network models are available for processing sequence data. We propose a new approach for knowledge graph completion that combines bidirectional long short-term memory (BiLSTM) and convolutional neural network modules with an attention mechanism. Given a candidate relation and two entities, we encode paths that connect the entities into a low-dimensional space using a convolutional operation followed by BiLSTM. Then, an attention layer is applied to capture the semantic correlation between a candidate relation and each path between two entities and attentively extract reasoning evidence from the representation of multiple paths to predict whether the entities should be connected by the candidate relation. We extend our model to perform multistep reasoning over path representations in an embedding space. A recurrent neural network is designed to repeatedly interact with an attention module to derive logical inference from the representation of multiple paths. We perform link prediction tasks on several knowledge graphs and show that our method achieves better performance compared with recent state-of-the-art path-reasoning methods. (C) 2019 Elsevier Ltd. All rights reserved. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.relation.isPartOf | EXPERT SYSTEMS WITH APPLICATIONS | - |
dc.title | Path-based reasoning approach for knowledge graph completion using CNN-BiLSTM with attention mechanism | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.eswa.2019.112960 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | EXPERT SYSTEMS WITH APPLICATIONS, v.142 | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000498755200007 | - |
dc.identifier.scopusid | 2-s2.0-85073283494 | - |
dc.citation.title | EXPERT SYSTEMS WITH APPLICATIONS | - |
dc.citation.volume | 142 | - |
dc.contributor.affiliatedAuthor | Park, Young Tack | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.subject.keywordAuthor | Knowledge graph completion | - |
dc.subject.keywordAuthor | Link prediction | - |
dc.subject.keywordAuthor | Path-based reasoning | - |
dc.subject.keywordAuthor | Low-dimensional embedding | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.