Entity Comparison in RDF Graphs

被引:9
|
作者
Petrova, Alina [1 ]
Sherkhonov, Evgeny [1 ]
Grau, Bernardo Cuenca [1 ]
Horrocks, Ian [1 ]
机构
[1] Univ Oxford, Oxford, England
来源
基金
英国工程与自然科学研究理事会;
关键词
D O I
10.1007/978-3-319-68288-4_31
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:526 / 541
页数:16
相关论文
共 50 条
  • [1] Hashing for cleaner reverse engineered queries for the Entity Comparison Problem in RDF Graphs
    Tyagi, Priyam
    Malta, Mariana Curado
    Dutta, Animesh
    2020 IEEE/WIC/ACM INTERNATIONAL JOINT CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT 2020), 2020, : 177 - 186
  • [2] Exploiting Paths for Entity Search in RDF Graphs
    Kahng, Minsuk
    Lee, Sang-goo
    SIGIR 2012: PROCEEDINGS OF THE 35TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2012, : 1027 - 1028
  • [3] To Diversify or Not to Diversify Entity Summaries on RDF Knowledge Graphs?
    Sydow, Marcin
    Pikula, Mariusz
    Schenkel, Ralf
    FOUNDATIONS OF INTELLIGENT SYSTEMS, 2011, 6804 : 490 - 500
  • [4] Entity Reference Resolution via Spreading Activation on RDF-Graphs
    Kleb, Joachim
    Abecker, Andreas
    SEMANTIC WEB: RESEARCH AND APPLICATIONS, PT 1, PROCEEDINGS, 2010, 6088 : 152 - 166
  • [5] Signing RDF graphs
    Carroll, JJ
    SEMANTIC WEB - ISWC 2003, 2003, 2870 : 369 - 384
  • [6] Trust in RDF Graphs
    Tomaszuk, Dominik
    Pak, Karol
    Rybinski, Henryk
    ADVANCES IN DATABASES AND INFORMATION SYSTEMS, 2013, 186 : 273 - +
  • [7] Matching RDF graphs
    Carroll, JJ
    SEMANTIC WEB - ISWC 2002, 2002, 2342 : 5 - 15
  • [8] Preventing Attribute and Entity Disclosures: Combining k-anonymity and Anatomy over RDF Graphs
    Thouvenot, Maxime
    Cure, Olivier
    Calvez, Philippe
    2021 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2021, : 5460 - 5469
  • [9] RDF-X: A Language for Sanitizing RDF Graphs
    Rachapalli, Jyothsna
    Khadilkar, Vaibhav
    Kantarcioglu, Murat
    Thuraisingham, Bhavani
    WWW'14 COMPANION: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2014, : 363 - 364
  • [10] A RPL through RDF: Expressive Navigation in RDF Graphs
    Zauner, Harald
    Linse, Benedikt
    Furche, Tim
    Bry, Francois
    WEB REASONING AND RULE SYSTEMS, 2010, 6333 : 251 - 257