Uncertain Ontology-Aware Knowledge Graph Embeddings

被引:5
作者
Boutouhami, Khaoula [1 ]
Zhang, Jiatao [1 ]
Qi, Guilin [1 ]
Gao, Huan [1 ]
机构
[1] Southeast Univ, Sch Comp Sci & Engn, Nanjing, Peoples R China
来源
SEMANTIC TECHNOLOGY, JIST 2019 | 2020年 / 1157卷
关键词
Ontology-aware knowledge graph; Knowledge graphs; Embedding; Uncertainty;
D O I
10.1007/978-981-15-3412-6_13
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Much attention has recently been given to knowledge graphs embedding by exploiting latent and semantic relations among entities and incorporating the structured knowledge they contain into machine learning. Most of the existing graph embedding models can only encode a simple model of the data, while few models are designed for ontology rich knowledge graphs. Furthermore, many automated knowledge construction tools produce modern knowledge graphs with rich semantics and uncertainty. However, there is no graph embedding model which includes uncertain ontological information into graph embedding models. In this paper, we propose a novel embedding model UOKGE (Uncertain Ontology-aware Knowledge Graph Embeddings), which learns embeddings of entities, classes, and properties on uncertain ontology-aware knowledge graphs according to confidence scores. The proposed method preserves both structures and uncertainty of knowledge in the embedding space. Specifically, UOKGE encodes each entity in a knowledge graph as a point of n-dimensional vector, each class as a n-sphere and each property as 2n-sphere in the same semantic space. This representation allows for the natural expression of uncertain ontological triples. The preliminary experimental results show that UOKGE can robustly learn representations of uncertain ontology-aware knowledge graphs when evaluated on a benchmark dataset.
引用
收藏
页码:129 / 136
页数:8
相关论文
共 13 条
[1]  
[Anonymous], 2013, NEURIPS
[2]  
Chen XL, 2019, AAAI CONF ARTIF INTE, P3363
[3]  
Diaz G. I., 2018, P INT C EXT DAT TECH, P433
[4]   Possibility theory, probability theory and multiple-valued logics: A clarification [J].
Dubois, D ;
Prade, H .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2001, 32 (1-4) :35-66
[5]   On Embedding Uncertain Graphs [J].
Hu, Jiafeng ;
Cheng, Reynold ;
Huang, Zhipeng ;
Fang, Yixiang ;
Luo, Siqiang .
CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, :157-166
[6]  
Ji GL, 2015, PROCEEDINGS OF THE 53RD ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 7TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING, VOL 1, P687
[7]  
Kallenberg O., 1997, Foundations of Modern Probability, Probability and Its Applications, DOI DOI 10.1007/B98838
[8]  
Lin YK, 2015, AAAI CONF ARTIF INTE, P2181
[9]  
Lv X, 2018, 2018 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2018), P1971
[10]  
Trouillon T, 2016, PR MACH LEARN RES, V48