#### DMCA

## CODI: Combinatorial Optimization for Data Integration – Results for OAEI 2010

Citations: | 15 - 3 self |

### Citations

1978 |
Binary codes capable of correcting deletions, insertions, and reversals.
- Levenshtein
- 1966
(Show Context)
Citation Context ...the logical consistency and (b) the inclusion of additional similarity measures. There is room for improvement since we used a very simple lexical similarity measure based on the Levenshtein distance =-=[4]-=- for our experiments. It is possible to apply different aggregation functions like average or maximum and to include specific properties of an ontology like URIs, labels, and comments. In all OAEI tes... |

816 | Markov logic networks
- Richardson, Domingos
- 2006
(Show Context)
Citation Context ...and transforms the alignment problem to a maximum-a-posteriori optimization problem. 1.2 Specific techniques used Markov logic combines first-order logic and undirected probabilistic graphical models =-=[11]-=-. A Markov logic network (MLN) is a set of first-order formulae with weights. Intuitively, the more evidence there is that a formula is true the higher the weight of this formula. It has been proposed... |

591 | Similarity Flooding: A versatile graph matching algorithm and its application to schema matching
- Melnik, Garcia-Molina, et al.
- 2002
(Show Context)
Citation Context ...uivalence of concepts C and D also makes it more likely that, for example, child concepts of C and child concepts of D are equivalent. One such approach to evidence propagation is similarity flooding =-=[7]-=-. As a reciprocal idea, the general notion of stability was introduced, expressing that an alignment should not introduce new structural knowledge [5]. The soft formula below, for instance, decreases ... |

73 |
Improving the accuracy and efficiency of MAP inference for Markov Logic. In: UAI
- Riedel
- 2008
(Show Context)
Citation Context ...ible alignments. We refer the reader to [9, 8] for an in-depth discussion of the approach and some computational challenges. For generating the Marcov logic networks we used the approach described in =-=[12]-=-. T-Box Matching Formalization Given two ontologies O1 and O2 and an initial apriori similarity measure σ we apply the following formalization. First, we introduce observable predicatesO to model the ... |

43 | A.: Repairing ontology mappings. In:
- Meilicke, Stuckenschmidt, et al.
- 2007
(Show Context)
Citation Context ...nce matching algorithm. CODI offers complete conflict elimination meaning that the resulting alignment is always coherent for OWL DL ontologies. This component is based on the work of Meilicke et al. =-=[6]-=-. CODI enforces the instance alignment to be consistent. To this end, we need to introduce observable predicates O to model conflicts, that is, a positive assertion of one instance in one ontology and... |

38 | Leveraging terminological structure for object reconciliation. Procs of ESWC’10,
- Noessner, Niepert, et al.
- 2010
(Show Context)
Citation Context ...ts. A-Box Matching The current instance matching configuration of CODI leverages terminological structure and combines it with lexical similarity measures. The approach is presented in more detail in =-=[10]-=-. It uses one T-Box T but two different A-Boxes A1 ∈ O1 and A2 ∈ O2. In cases with two different T-Boxes the T-Box matching approach is applied as a preprocessing step, merge the two aligned T-Boxes a... |

19 | Analyzing mapping extraction approaches. In
- Meilicke, Stuckenschmidt
- 2007
(Show Context)
Citation Context ...ch to evidence propagation is similarity flooding [7]. As a reciprocal idea, the general notion of stability was introduced, expressing that an alignment should not introduce new structural knowledge =-=[5]-=-. The soft formula below, for instance, decreases the probability of alignments that map conceptsX to Y andX ′ toY ′ if X ′ subsumesX butY ′ does not subsumeY. (sub1(x,x ′ )∧¬sub2(y,y ′ ) ⇒ mc(x,y)∧mc... |

18 | H.: A probabilistic-logical framework for ontology matching.
- Niepert, Meilicke, et al.
- 2010
(Show Context)
Citation Context ...erties ofthe ontologies) and formulae (the axioms holding between the objects and classes), a Markov logic network defines a probability distribution over possible alignments. We refer the reader to =-=[9, 8]-=- for an in-depth discussion of the approach and some computational challenges. For generating the Marcov logic networks we used the approach described in [12]. T-Box Matching Formalization Given two o... |

14 | Efficient Selection of Mappings and Automatic Quality-driven Combination of Matching Methods. In:
- Cruz, Antonelli, et al.
- 2009
(Show Context)
Citation Context ...se typed predicates and distinguish between the concept and property type. Cardinality Constraints A method often applied in real-world scenarios is the selection of a functional one-to-one alignment =-=[1]-=-. Within the ML framework, we can include a set of hard cardinality constraints, restricting the alignment to be functional and one-to-one. In the following we write x,y,z to refer to variables rangin... |

10 | A delayed column generation strategy for exact k-bounded map inference in markov logic networks
- Niepert
- 2010
(Show Context)
Citation Context ...erties ofthe ontologies) and formulae (the axioms holding between the objects and classes), a Markov logic network defines a probability distribution over possible alignments. We refer the reader to =-=[9, 8]-=- for an in-depth discussion of the approach and some computational challenges. For generating the Marcov logic networks we used the approach described in [12]. T-Box Matching Formalization Given two o... |

8 | Just add weights: Markov logic for the semantic web
- Domingos, Lowd, et al.
(Show Context)
Citation Context ...l similarity measures with schema information to reduce or completely avoid incoherence and inconsistency during the alignment process. The system is based on the syntax and semantics of Markov logic =-=[2]-=- and transforms the alignment problem to a maximum-a-posteriori optimization problem. 1.2 Specific techniques used Markov logic combines first-order logic and undirected probabilistic graphical models... |

5 | A practical implementation of semantic precision and recall
- Fleischhacker, Stuckenschmidt
(Show Context)
Citation Context ...have a standardized interface which could possibly be used by everyone. 3.3 Comments on the OAEI 2010 measures We encorage the organizers to use semantic precision and recall measures as described in =-=[3]-=-.4 Conclusion CODI performs concept, property, and instance alignments. It combines logical and structural information with a-priori similarity measures in a well-defined way by using the syntax and ... |