ProbLog program based ontology matching

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Ontology matching reconciles semantic heterogeneity between ontologies to find correspondence of entities, including classes, properties, and instances. We propose using ProbLog program to tackle this problem. It uses probabilistic facts to encode initial similarities (priors) of candidate matching pairs and exploits definite clauses and annotated disjunctions to respectively express certain and probabilistic influence of matching pairs. We experimentally evaluate our method on the datasets of conference track in Ontology Alignment Evaluation Initiative. Experimental results show: (1) recall is improved compared with priors; (2) our method is better in precision, recall and F1-measure than the most related Markov logic networks.

Cite

CITATION STYLE

APA

Wang, Y. (2015). ProbLog program based ontology matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9403, pp. 778–783). Springer Verlag. https://doi.org/10.1007/978-3-319-25159-2_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free