Status | 已发表Published |
Title | Fast and Slow Thinking: A Two-Step Schema-Aware Approach for Instance Completion in Knowledge Graphs |
Creator | |
Date Issued | 2024-03-01 |
Source Publication | IEEE Transactions on Knowledge and Data Engineering
![]() |
ISSN | 1041-4347 |
Volume | 36Issue:3Pages:1113-1129 |
Abstract | Modern Knowledge Graphs (KG) often suffer from an incompleteness issue (i.e., missing facts). By representing a fact as a triplet (h,r,t) linking two entities h and t via a relation r, existing KG completion approaches mostly consider a link prediction task to solve this problem, i.e., given two elements of a triplet predicting the missing one, such as (h,r,?). However, this task implicitly has a strong yet impractical assumption on the two given elements in a triplet, which have to be correlated, resulting otherwise in meaningless predictions, such as (Marie Curie, headquarters location, ?). Against this background, this paper studies an instance completion task suggesting r-t pairs for a given h, i.e., (h,?,?). Inspired by the human psychological principle 'fast-and-slow thinking', we propose a two-step schema-aware approach RETA++ to efficiently solve our instance completion problem. It consists of two components: a fast RETA-Filter efficiently filtering candidate r-t pairs schematically matching the given h, and a deliberate RETA-Grader leveraging a KG embedding model scoring each candidate r-t pair considering the plausibility of both the input triplet and its corresponding schema. RETA++ systematically integrates them by training RETA-Grader on the reduced solution space output by RETA-Filter via a customized negative sampling process, so as to fully benefit from the efficiency of RETA-Filter in solution space reduction and the deliberation of RETA-Grader in scoring candidate triplets. We evaluate our approach against a sizable collection of state-of-the-art techniques on three real-world KG datasets. Results show that RETA-Filter can efficiently reduce the solution space for the instance completion task, outperforming best baseline techniques by 10.61%-84.75% on the reduced solution space size, while also being 1.7×-29.6x faster than these techniques. Moreover, RETA-Grader trained on the reduced solution space also significantly outperforms the best state-of-the-art techniques on the instance completion task by 31.90%-105.02%. |
Keyword | entity types fast and slow thinking instance completion Knowledge graph embedding |
DOI | 10.1109/TKDE.2023.3304137 |
URL | View source |
Indexed By | SCIE |
Language | 英语English |
WOS Research Area | Computer Science ; Engineering |
WOS Subject | Computer Science ; Artificial Intelligence ; Computer Science ; Information Systems ; Engineering ; Electrical & Electronic |
WOS ID | WOS:001167452200020 |
Scopus ID | 2-s2.0-85167812490 |
Citation statistics | |
Document Type | Journal article |
Identifier | http://repository.uic.edu.cn/handle/39GCC9TT/11400 |
Collection | Faculty of Science and Technology |
Corresponding Author | Yang, Dingqi |
Affiliation | 1.University of Macau, State Key Laboratory of Internet of Things for Smart City, Department of Computer and Information Science, Macao, 999078, Macao 2.BNU-HKBU United International College, Zhuhai, Guangdong, 519088, China 3.University of Fribourg, Fribourg, 1700, Switzerland |
Recommended Citation GB/T 7714 | Yang, Dingqi,Qu, Bingqing,Rosso, Paoloet al. Fast and Slow Thinking: A Two-Step Schema-Aware Approach for Instance Completion in Knowledge Graphs[J]. IEEE Transactions on Knowledge and Data Engineering, 2024, 36(3): 1113-1129. |
APA | Yang, Dingqi, Qu, Bingqing, Rosso, Paolo, & Cudre-Mauroux, Philippe. (2024). Fast and Slow Thinking: A Two-Step Schema-Aware Approach for Instance Completion in Knowledge Graphs. IEEE Transactions on Knowledge and Data Engineering, 36(3), 1113-1129. |
MLA | Yang, Dingqi,et al."Fast and Slow Thinking: A Two-Step Schema-Aware Approach for Instance Completion in Knowledge Graphs". IEEE Transactions on Knowledge and Data Engineering 36.3(2024): 1113-1129. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment