Measuring accuracy of triples in knowledge graphs
Liu, Shuangyan d’Aquin, Mathieu Motta, Enrico
Liu, Shuangyan
d’Aquin, Mathieu
Motta, Enrico
Loading...
Repository DOI
Publication Date
2017-06-19
Type
Conference Paper
Downloads
Citation
Liu, Shuangyan , d'Aquin, Mathieu , & Motta, Enrico (2017). Measuring accuracy of triples in knowledge graphs. Paper presented at the First International Conference, LDK 2017, Galway.
Abstract
An increasing amount of large-scale knowledge graphs have been constructed in recent years. Those graphs are often created from text-based extraction, which could be very noisy. So far, cleaning knowledge graphs are often carried out by human experts and thus very inef- ficient. It is necessary to explore automatic methods for identifying and eliminating erroneous information. In order to achieve this, previous approaches primarily rely on internal information i.e.the knowledge graph itself. In this paper, we introduce an automatic approach, Triples Accuracy Assessment (TAA), for validating RDF triples (source triples) in a knowledge graph by finding consensus of matched triples (among target triples) from other knowledge graphs. TAA uses knowledge graph interlinks to find identical resources and apply di↵erent matching methods between the predicates of source triples and target triples. Then based on the matched triples, TAA calculates a confidence score to indicate the correctness of a source triple. In addition, we present an evaluation of our approach using the FactBench dataset for fact validation. Our findings show promising results for distinguishing between correct and wrong triples.
Funder
Publisher
Springer
Publisher DOI
10.1007/978-3-319-59888-8
Rights
Attribution-NonCommercial-NoDerivs 3.0 Ireland