Graduate School and Research Center in Digital Sciences

Rule discovery in RDF knowledge-bases

Papotti, Paolo

Talk at University of Southern California, 30 August 2019, Los Angeles, CA, USA

In this talk we present RuDiK, a system for the discovery of declarative rules over RDF knowledge-bases (KBs). RuDiK discovers rules that express positive relationships between entities, such as “if two persons have the same parent, they are siblings”, and negative rules, i.e., patterns that identify contradictions in the data, such as “if two persons are married, one cannot be the child of the other”. While the former class infers new facts in the KB, the latter class is crucial for other tasks, such as detecting erroneous triples in data cleaning, or the creation of negative examples to bootstrap learning algorithms. RuDiK discovers rules with a more expressive rule language than previous approaches, and its mining is robust to existing errors and incompleteness in the KB. We report experiments over real-world KBs to show that RuDiK outperforms previous proposals in terms of efficiency and that it discovers more effective rules for data curation. Finally, we discuss how automatically discovered rules can support other applications, such as computational fact checking.

Bibtex

Title:Rule discovery in RDF knowledge-bases
Type:Talk
Language:English
City:Los Angeles
Country:UNITED STATES
Date:
Department:Data Science
Eurecom ref:6020
Copyright: © EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in Talk at University of Southern California, 30 August 2019, Los Angeles, CA, USA and is available at :
Bibtex: @talk{EURECOM+6020, year = {2019}, title = {{R}ule discovery in {RDF} knowledge-bases}, author = {{P}apotti, {P}aolo}, number = {EURECOM+6020}, month = {08}, institution = {Eurecom} address = {{L}os {A}ngeles, {UNITED} {STATES}}, url = {http://www.eurecom.fr/publication/6020} }
See also: