Abstract
A conditional key is a key constraint that is valid in only a part of the data. In this paper, we show how such keys can be mined automatically on large knowledge bases (KBs). For this, we combine techniques from key mining with techniques from rule mining. We show that our method can scale to KBs of millions of facts. We also show that the conditional keys we mine can improve the quality of entity linking by up to 47% points.
Originalsprog | Engelsk |
---|---|
Titel | International Semantic Web Conference ISWC 2017 : The Semantic Web – ISWC 2017 |
Vol/bind | 10587 |
Forlag | Springer |
Publikationsdato | 4 okt. 2017 |
Sider | 661-677 |
ISBN (Trykt) | 978-3-319-68287-7 |
ISBN (Elektronisk) | 978-3-319-68288-4 |
DOI | |
Status | Udgivet - 4 okt. 2017 |
Begivenhed | The 16th International Semantic Web Conference - Vienna, Østrig Varighed: 21 okt. 2017 → 31 okt. 2017 Konferencens nummer: 16th https://iswc2017.semanticweb.org/ |
Konference
Konference | The 16th International Semantic Web Conference |
---|---|
Nummer | 16th |
Land/Område | Østrig |
By | Vienna |
Periode | 21/10/2017 → 31/10/2017 |
Internetadresse |
Navn | Lecture Notes in Computer Science |
---|---|
ISSN | 0302-9743 |