Knowledge Graph Completion by Jointly Learning Structural Features and Soft Logical Rules

被引:9
作者
Li, Weidong [1 ]
Peng, Rong [1 ]
Li, Zhi [2 ]
机构
[1] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Hubei, Peoples R China
[2] Guangxi Normal Univ, Coll Comp Sci & Informat Technol, Guilin 541004, Peoples R China
基金
中国国家自然科学基金;
关键词
Task analysis; Predictive models; Training; Knowledge engineering; Deep learning; Neural networks; Convolutional neural networks; Knowledge graph completion; knowledge graph embedding; graph attention neural networks; link prediction; soft logical rules;
D O I
10.1109/TKDE.2021.3108224
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
With the rapid development and widespread application of Knowledge graphs (KGs) in many artificial intelligence tasks, a large number of efforts have been made to refine them and increase their quality. Knowedge graph embedding (KGE) has become one of the main refinement tasks, which aims to predict missing facts based on existing ones in KGs. However, there are still mainly two difficult unresolved challenges: (i) how to leverage the local structural features of entities and the potential soft logical rules to learn more expressive embedding of entites and relations; and (ii) how to combine these two learning processes into one unified model. To conquer these problems, we propose a novel KGE model named JSSKGE, which can Jointly learn the local Structural features of entities and Soft logical rules. First, we employ graph attention networks which are specially designed for graph-structured data to aggregate the local structural information of nodes. Then, we utilize soft logical rules implicated in KGs as an expert to further rectify the embeddings of entities and relations. By jointly learning, we can obtain more informative embeddings to predict new facts. With experiments on four commonly used datasets, the JSSKGE obtains better performance than state-of-the-art approaches.
引用
收藏
页码:2724 / 2735
页数:12
相关论文
共 43 条
[21]   WORDNET - A LEXICAL DATABASE FOR ENGLISH [J].
MILLER, GA .
COMMUNICATIONS OF THE ACM, 1995, 38 (11) :39-41
[22]  
Minervini P., 2017, P 33 C UNC ART INT, P1
[23]  
Nickel M., 2011, P INT C MACH LEARN, P809
[24]  
Paulheim H, 2017, SEMANT WEB, V8, P489, DOI 10.3233/SW-160218
[25]  
Qu YQ, 2018, Arxiv, DOI arXiv:1804.03317
[26]  
Rocktaschel T., 2015, P 2015 C N AM CHAPT, P1119, DOI DOI 10.3115/V1/N15-1118
[27]  
Rocktaschel Tim, 2016, Proceedings of AKBC, P45
[28]  
Ruffinelli D., 2020, PROC 8 INT C LEARN R
[29]   Modeling Relational Data with Graph Convolutional Networks [J].
Schlichtkrull, Michael ;
Kipf, Thomas N. ;
Bloem, Peter ;
van den Berg, Rianne ;
Titov, Ivan ;
Welling, Max .
SEMANTIC WEB (ESWC 2018), 2018, 10843 :593-607
[30]  
Shang C, 2019, AAAI CONF ARTIF INTE, P3060