PARIS: Probabilistic Alignment of Relations, Instances, and Schema
By Fabian M. Suchanek, Serge Abiteboul, Pierre Senellart. 2011
466 citations recorded by the source corpus.
One of the main challenges that the Semantic Web faces is the integration of a growing number of independently designed ontologies. In this work, we present paris, an approach for the automatic alignment of ontologies. paris aligns not only instances, but also relations and classes. Alignments at the instance level cross-fertilize with alignments at the schema level. Thereby, our system provides a truly holistic solution to the problem of ontology alignment. The heart of the approach is probabilistic, i.e., we measure degrees of matchings based on probability estimates. This allows paris to run without any parameter tuning. We demonstrate the efficiency of the algorithm and its precision through extensive experiments. In particular, we obtain a precision of around 90% in experiments with some of the world's largest ontologies.
Subfields: Artificial Intelligence, Computer Networks and Communications, Management Science and Operations Research, Probabilistic & Bayesian Methods, Knowledge Graphs & Representation
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computer Networks and Communications
In Management Science and Operations Research
In Probabilistic & Bayesian Methods
- Jérôme Euzenat
- Pavel Shvaiko
- Tat-seng Chua
- Fabian M. Suchanek
- Katja Hose
- Maosong Sun
- Luis Galárraga
- Partha P. Talukdar
In Knowledge Graphs & Representation
Citations in the corpus
- Multi-Channel Graph Neural Network for Entity Alignment (2019, background): “It is non-trivial to align different KGs due to their distinct surface forms, which makes the symbolic based methods (Suchanek et al., 2011) not always effective.”
- Knowledge Representation Learning with Entities, Attributes and Relations (2016, background): “[Suchanek et al. , 2011] filters unnecessary literals in when aligning KGs.”
- Big data challenge: a data management perspective (2013, background): “Specifically, in [23, 24], the authors try to build imprecise and probabilistic schemas and matchings on the basis of uncertain data.”
- Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs (2019, background): “…object; and (ii) KG completion , a.k.a. link prediction, which aims to complete the missing facts in a single KG. Conventional methods usually rank candidates by exploiting various features, as well as using crowdsourcing (Lacoste-Julien et al., 2013; Suchanek et al., 2012; Zhuang et al., 2017).”
- KATARA: A Data Cleaning System Powered by Knowledge Bases and Crowdsourcing (2015, background): “The reason is that PARIS relies on structural information, thus all possible attributes should be tested together to get optimal results.”
- Fast rule mining in ontological knowledge bases with AMIE+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$+$$\end{docu (2015, methodology): “Therefore, we use the notion of functionality [38].”
- PIDGIN: ontology alignment using web text as interlingua (2013, background): “, categories or relations) in the ontology only [16], with the exception of a few that also consider instance similarities [17, 12].”
- Ontology Matching (2007, methodology): “PARIS is an automatic system for Probabilistic Alignment of Relations, Instances and Schema of (large) ontologies in RDFS (Suchanek et al. 2012).”