Research – Paper 237

Entity Comparison in RDF Graphs

Alina Petrova, Evgeny Sherkhonov, Bernardo Cuenca Grau and Ian Horrocks

Research

clock_eventOctober 23, 2017, 11:00.
house Lehár 4
download Download paper (preprint)

Abstract

In many applications, there is an increasing need for the new types of RDF data analysis that are not covered by standard reasoning tasks such as SPARQL query answering. One such important analysis task is entity comparison, i.e., determining what are similarities and differences between two given entities in an RDF graph. For instance, in an RDF graph about drugs, we may want to compare Metamizole and Ibuprofen and automatically find out that they are similar in that they are both analgesics but, in contrast to Metamizole, Ibuprofen also has a considerable anti-inflammatory effect. Entity comparison is a widely used functionality available in many information systems, such as universities or product comparison websites. However, comparison is typically domain-specific and depends on a fixed set of aspects to compare. In this paper, we propose a formal framework for domain-independent entity comparison over RDF graphs. We model similarities and differences between entities as SPARQL queries satisfying certain additional properties, and propose algorithms for computing them.

Leave a Reply (Click here to read the code of conduct)

Be the First to Comment!

Notify of
avatar
wpDiscuz