Missing RDF triples detection and correction in knowledge graphs

5Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Knowledge graphs (KGs) have become a powerful asset in information science and technology. To foster enhancing search, information retrieval and question answering domains KGs offer effective structured information. KGs represent real-world entities and their relationships in Resource Description Framework (RDF) triples format. Despite the large amount of knowledge, there are still missing and incorrect knowledge in the KGs. We study the graph patterns of interlinked entities to discover missing and incorrect RDF triples in two KGs - DBpedia and YAGO. We apply graph-based approach to map similar object properties and apply similarity based approach to map similar datatype properties. Our propose methods can utilize those similar ontology properties and efficiently discover missing and incorrect RDF triples in DBpedia and YAGO.

Cite

CITATION STYLE

APA

Zhao, L., Munne, R. F., Kertkeidkachorn, N., & Ichise, R. (2017). Missing RDF triples detection and correction in knowledge graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10675 LNCS, pp. 164–180). Springer Verlag. https://doi.org/10.1007/978-3-319-70682-5_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free