IEEE Transactions on Knowledge and Data Engineering · 2011 · 18 citations · 11 references
ComputingComputer ScienceAlgorithmsKnowledge MappingKnowledge RepresentationFormal OntologyOntology DesignOntology EngineeringBipartite Graph RepresentationFactor Graph OptimizationOntological AlignmentOntologiesOntology AlignmentOntology Alignment AlgorithmsOntology ConsistencyOntology Mapping
This paper addresses the problem of synthesizing ontology alignment methods by maximizing the social welfare within a group of interacting agents: Specifically, each agent is responsible for computing mappings concerning a specific ontology element, using a specific alignment method. Each agent interacts with other agents with whom it shares constraints concerning the validity of the mappings it computes. Interacting agents form a bipartite factor graph, composed of variable and function nodes, representing alignment decisions and utilities, respectively. Agents need to reach an agreement to the mapping of the ontology elements consistently to the semantics of specifications with respect to their mapping preferences. Addressing the synthesis problem in such a way allows us to use an extension of the max-sum algorithm to generate near-to-optimal solutions to the alignment of ontologies through local decentralized message passing. We show the potential of such an approach by synthesizing a number of alignment methods, studying their performance in the OAEI benchmark series.
11
Generic Schema Matching with Cupid
Jayant Madhavan, Philip A. Bernstein, Erhard Rahm · 2001 · 1.3K citations · Full text
Reconciling schemas of disparate data sources
AnHai Doan, Pedro Domingos, Alon Halevy · 2001 · 733 citations
Schema and ontology matching with COMA++
David Aumueller, Hong-Hai Do, Erhard Rahm · 2005 · 642 citations · Full text