Information for "A Probabilistic-Logical Framework for Ontology Matching"

Jump to: navigation, search

Basic information

Display titleA Probabilistic-Logical Framework for Ontology Matching
Default sort keyA Probabilistic-Logical Framework for Ontology Matching
Page length (in bytes)4,603
Page ID36165
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)

Edit history

Page creatorSaid (talk | contribs)
Date of page creation11:18, 27 June 2018
Latest editorSaid (talk | contribs)
Date of latest edit22:11, 11 July 2018
Total number of edits13
Total number of distinct authors1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (4)

Templates used on this page:

Access APINo data available now. +
Event in seriesAAAI +
Has BenchmarkOntofarm dataset (Svab et al. 2005) +
Has ChallengesNo data available now. +
Has DataCatalouge{{{Catalogue}}} +
Has DescriptionWe applied the reasoner Pellet (Sirin et a
We applied the

reasoner Pellet (Sirin et al. 2007) 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.
programming solver SCIP3 to solve the ILP. +
Has Dimensions{{{Dimensions}}} +
Has DocumentationURLhttp://No data available now. +
Has Downloadpagehttp://code.google.com/p/ml-match/ +
Has EvaluationNo data available now. +
Has EvaluationMethodNo data available now. +
Has ExperimentSetupAll experiments were conducted

on a desktop PC with AMD Athlon Dual Core Processor

5400B with 2.6GHz and 1GB RAM. +
Has GUINo +
Has HypothesisNo data available now. +
Has ImplementationNo data available now. +
Has InfoRepresentationNo data available now. +
Has LimitationsNo data available now. +
Has NegativeAspectsNo data available now. +
Has PositiveAspectsNo data available now. +
Has RequirementsNo data available now. +
Has ResultsNo data available now. +
Has SubproblemNo data available now. +
Has VersionNo data available now. +
Has abstractOntology 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 approachNo data available now. +
Has authorsMathias Niepert +, Christian Meilicke + and Heiner Stuckenschmidt +
Has conclusionWe 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 workThe 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 motivationNo data available now. +
Has platformNo data available now. +
Has problemNo data available now. +
Has relatedProblemNo data available now. +
Has subjectOntology Matching +
Has vendorNo data available now. +
Has year2010 +
ImplementedIn ProgLangNo data available now. +
Proposes AlgorithmNo data available now. +
RunsOn OSNo data available now. +
TitleA Probabilistic-Logical Framework for Ontology Matching +
Uses FrameworkNo data available now. +
Uses MethodologyNo data available now. +
Uses ToolboxNo data available now. +