Background Knowledge in Schema Matching: Strategy vs. Data

06/29/2021
by   Jan Portisch, et al.
0

The use of external background knowledge can be beneficial for the task of matching schemas or ontologies automatically. In this paper, we exploit six general-purpose knowledge graphs as sources of background knowledge for the matching task. The background sources are evaluated by applying three different exploitation strategies. We find that explicit strategies still outperform latent ones and that the choice of the strategy has a greater impact on the final alignment than the actual background dataset on which the strategy is applied. While we could not identify a universally superior resource, BabelNet achieved consistently good results. Our best matcher configuration with BabelNet performs very competitively when compared to other matching systems even though no dataset-specific optimizations were made.

READ FULL TEXT
research
11/03/2021

Order Matters: Matching Multiple Knowledge Graphs

Knowledge graphs (KGs) provide information in machine interpretable form...
research
06/27/2019

A Survey and Experimental Analysis of Distributed Subgraph Matching

Recently there emerge many distributed algorithms that aim at solving su...
research
05/03/2021

Bias in Knowledge Graphs – an Empirical Study with Movie Recommendation and Different Language Editions of DBpedia

Public knowledge graphs such as DBpedia and Wikidata have been recognize...
research
03/28/2014

Shiva: A Framework for Graph Based Ontology Matching

Since long, corporations are looking for knowledge sources which can pro...
research
09/15/2021

Matching with Transformers in MELT

One of the strongest signals for automated matching of ontologies and kn...
research
03/31/2020

Automated Configuration of Negotiation Strategies

Bidding and acceptance strategies have a substantial impact on the outco...

Please sign up or login with your details

Forgot password? Click here to reset