A scalable approach to incrementally building knowledge graphs

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

Abstract

We work on converting the metadata of 13 American art museums and archives into Linked Data, to be able to integrate and query the resulting data. While there are many good sources of artist data, no single source covers all artists. We thus address the challenge of building a comprehensive knowledge graph of artists that we can then use to link the data from each of the individual museums. We present a framework to construct and incrementally extend a knowledge graph, describe and evaluate techniques for efficiently building knowledge graphs through the use of the MinHash/LSH algorithm for generating candidate matches, and conduct an evaluation that demonstrates our approach can efficiently and accurately build a knowledge graph about artists.

Cite

CITATION STYLE

APA

Gawriljuk, G., Harth, A., Knoblock, C. A., & Szekely, P. (2016). A scalable approach to incrementally building knowledge graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9819 LNCS, pp. 188–199). Springer Verlag. https://doi.org/10.1007/978-3-319-43997-6_15

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