Edit Paper: A Probabilistic-Logical Framework for Ontology Matching
You do not have permission to edit this page, for the following reason:
Facts about "A Probabilistic-Logical Framework for Ontology Matching"
Access API | No data available now. + |
Event in series | AAAI + |
Has Benchmark | Ontofarm dataset + |
Has Challenges | No data available now. + |
Has DataCatalouge | {{{Catalogue}}} + |
Has Description | We applied the reasoner Pellet to create the ground MLN formulation and used TheBeast2 (Riedel 2008) to convert the MLN formulations to the corresponding ILP instances. Finally, we applied the mixed integer programming solver SCIP3 to solve the ILP. + |
Has Dimensions | Accuracy + |
Has DocumentationURL | https://code.google.com/archive/p/ml-match/wikis/MLExample.wiki + |
Has Downloadpage | http://code.google.com/p/ml-match/ + |
Has Evaluation | Using thresholds on the a-priori similarity measure + |
Has EvaluationMethod | Average F1-values over the 21 OAEI reference alignments for manual weights vs. learned weights vs. formulation without stability constraints; thresholds range from 0.6 to 0.95. + |
Has ExperimentSetup | All experiments were conducted on a desktop PC with AMD Athlon Dual Core Processor 5400B with 2.6GHz and 1GB RAM. + |
Has GUI | No + |
Has Hypothesis | No data available now. + |
Has Implementation | Ml-match + |
Has InfoRepresentation | No data available now. + |
Has Limitations | No data available now. + |
Has NegativeAspects | No data available now. + |
Has PositiveAspects | The approach has several advantages over
e β¦ The approach has several advantages over
rminological and instance correspondences. +existing methods such as ease of experimentation, incoherence mitigation during the alignment process, and the incorporation of a-priori confidence values. In cases where training data is not available, weights set manually by experts still result in improved alignment quality. The framework is not only useful for aligning concepts and properties but can also include instance matching. For this purpose, one would only need to add a hidden predicate modeling instance correspondences. The resulting matching approach would immediately benefit from probabilistic joint inference, taking into account the interdependencies between terminological and instance correspondences. |
Has Requirements | training data + |
Has Results | Using stability constraints improves alignment quality with both learned and manually set weights. + |
Has Subproblem | Ontology Alignment + |
Has Version | No data available now. + |
Has abstract | Ontology matching is the problem of determ β¦ Ontology matching is the problem of determining correspondences between concepts, properties, and individuals of different heterogeneous ontologies. With this paper we present a novel probabilistic-logical framework for ontology matching based on Markov logic. We define the syntax and semantics and provide a formalization of the ontology matching problem within the framework. The approach has several advantages over existing methods such as ease of experimentation, incoherence mitigation during the alignment process, and the incorporation of apriori confidence values. We show empirically that the approach is efficient and more accurate than existing matchers on an established ontology alignment benchmark dataset. shed ontology alignment benchmark dataset. + |
Has approach | Probabilistic-logical framework for ontology matching based on Markov logiP + |
Has authors | Mathias Niepert +, Christian Meilicke + and Heiner Stuckenschmidt + |
Has conclusion | We presented a Markov logic based framewor β¦ We presented a Markov logic based framework for ontology matching capturing a wide range of matching strategies. Since these strategies are expressed with a unified syntax and semantics we can isolate variations and empirically evaluate their effects. Even though we focused only on a small subset of possible alignment strategies the results are already quite promising. We have also successfully learned weights for soft formulae within the framework. In cases
where training data is not available, weights set manually by experts still result in improved alignment quality. Research related to determining appropriate weights based on structural properties of ontologies is a topic of future work. s of ontologies is a topic of future work. + |
Has future work | The framework is not only useful for align β¦ The framework is not only useful for aligning concepts and properties but can also include instance matching. For this purpose, one would only need to add a hidden predicate modeling instance correspondences. The resulting matching
approach would immediately benefit from probabilistic joint inference, taking into account the interdependencies between terminological and instance correspondences. rminological and instance correspondences. + |
Has motivation | matching ontologies enables the knowledge and data expressed in the matched ontologies to interoperate. + |
Has platform | No data available now. + |
Has problem | Link Discovery + |
Has relatedProblem | Concept similarity + |
Has subject | Ontology Matching + |
Has vendor | No data available now. + |
Has year | 2010 + |
ImplementedIn ProgLang | No data available now. + |
Proposes Algorithm | No data available now. + |
RunsOn OS | No data available now. + |
Title | A Probabilistic-Logical Framework for Ontology Matching + |
Uses Framework | TheBeast + |
Uses Methodology | No data available now. + |
Uses Toolbox | No data available now. + |