PARIS: Probabilistic Alignment of Relations, Instances, and Schema

Abstract

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.

VLDB2012. arXiv admin note: substantial text overlap with arXiv:1105.5516

Cited by in corpus (10)

• A Benchmarking Study of Embedding-based Entity Alignment for Knowledge Graphs
• Machine Knowledge: Creation and Curation of Comprehensive Knowledge Bases
• Predicting Completeness in Knowledge Bases
• LargeEA: Aligning Entities for Large-scale Knowledge Graphs
• Informed Multi-context Entity Alignment
• HiPrompt: Few-Shot Biomedical Knowledge Fusion via Hierarchy-Oriented Prompting
• Order Matters: Matching Multiple Knowledge Graphs
• PRASEMap: A Probabilistic Reasoning and Semantic Embedding based Knowledge Graph Alignment System
• Knowledge-Based Matching of $n$-ary Tuples
• Graph integration of structured, semistructured and unstructured data for data journalism