ExCut: Explainable Embedding-Based Clustering over Knowledge Graphs

被引:19
作者
Gad-Elrab, Mohamed H. [1 ,2 ]
Stepanova, Daria [2 ]
Tran, Trung-Kien [2 ]
Adel, Heike [2 ]
Weikum, Gerhard [1 ]
机构
[1] Max Planck Inst Informat, Saarland Informat Campus, Saarbrucken, Germany
[2] Bosch Ctr Artificial Intelligence, Renningen, Germany
来源
SEMANTIC WEB - ISWC 2020, PT I | 2020年 / 12506卷
关键词
D O I
10.1007/978-3-030-62419-4_13
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering entities over knowledge graphs (KGs) is an asset for explorative search and knowledge discovery. KG embeddings have been intensively investigated, mostly for KG completion, and have potential also for entity clustering. However, embeddings are latent and do not convey user-interpretable labels for clusters. This work presents ExCut, a novel approach that combines KG embeddings with rule mining methods, to compute informative clusters of entities along with comprehensible explanations. The explanations are in the form of concise combinations of entity relations. ExCut jointly enhances the quality of entity clusters and their explanations, in an iterative manner that interleaves the learning of embeddings and rules. Experiments on real-world KGs demonstrate the effectiveness of ExCut for discovering high-quality clusters and their explanations.
引用
收藏
页码:218 / 237
页数:20
相关论文
共 35 条
[1]  
[Anonymous], 2006, PKDD
[2]  
Bordes A., 2013, P 27 ANN C NEUR INF, P2787
[3]  
Bouraoui Z, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P1760
[4]  
Costabello L., 2019, Ampli-Graph: a Library for Representation Learning on Knowledge Graphs
[5]  
Dumancic S., 2018, ARXIVABS180611391V2
[6]  
Dumancic S., 2017, MLJ
[7]  
Fanizzi N, 2008, LECT NOTES COMPUT SC, V5021, P318
[8]  
Fonseca N.A., 2011, ILP, P145
[9]  
Galárraga L, 2015, VLDB J, V24, P707, DOI 10.1007/s00778-015-0394-1
[10]   LUBM: A benchmark for OWL knowledge base systems [J].
Guo, YB ;
Pan, ZX ;
Heflin, J .
JOURNAL OF WEB SEMANTICS, 2005, 3 (2-3) :158-182