A Vector Space Model for Semantic Similarity Calculation and OWL Ontology Alignment
Lecture notes in computer sciencePublished 1 January 2006
Rubén Tous, Jaime Delgado
Citations49
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents a semantic similarity measure based on a matrix represention of nodes from an RDF labelled directed graph that adapts a known graph matching algorithm when applying this idea to the alignment of two ontologies.
Abstract
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of one of them and some elements of the other. A rigorous, efficient and scalable similarity measure is a pre-requisite of an ontology alignment process. This paper presents a semantic similarity measure based on a matrix represention of nodes from an RDF labelled directed graph. An entity is described with respect to how it relates to other entities using N-dimensional vectors, being N the number of selected external predicates. We adapt a known graph matching algorithm when applying this idea to the alignment of two ontologies. We have successfully tested the model with the public testcases of the Ontology Alignment Evaluation Initiative 2005.
Keywords
Computer ScienceDecision Sciences
Language<b>WordNet: An electronic lexical database</b> . Ed. by Christiane Fellbaum. Cambridge, MA: MIT Press, 1998. Pp. xxii, 423.
11,687 Citations2000Adam Kilgarriff
The lexical database: nouns in WordNet, George A. Miller modifiers in WordNet, Katherine J. Miller a semantic network of English verbs, and applications of WordNet: building semantic concordances are presented.
American Mathematical MonthlyCombinatorial Optimization: Algorithms and Complexity.
6,028 Citations1984David Johnson, Christos H. Papadimitriou +1 more
The VLDB JournalA survey of approaches to automatic schema matching
3,322 Citations2001Erhard Rahm, Philip A. Bernstein
A taxonomy is presented that distinguishes between schema-level and instance-level, element- level and structure- level, and language-based and constraint-based matchers and is intended to be useful when comparing different approaches to schema matching, when developing a new match algorithm, and when implementing a schema matching component.
Verbs semantics and lexical selection
3,086 Citations1994Zhibiao Wu, Martha Palmer
This paper will focus on the semantic representation of verbs in computer systems and its impact on lexical selection problems in machine translation (MT), and sees the approach as closely aligned with knowledge-based MT approaches (KBMT), and as a separate component that could be incorporated into existing systems.
SIAM Journal on ComputingAn $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
2,843 Citations1973John E. Hopcroft, Richard M. Karp
The MIT Press eBooksCombining Local Context and WordNet Similarity for Word Sense Identification
1,638 Citations1998Claudia Leacock
This chapter contains sections titled: Introducfion, Training and Testing Data, Experiment 1: The Local Context Classifier, Experiment 2: Measuring Word Similarity In Wordnet, and Combining Local Context and Wordnet Similarity Measures.
ACM SIGKDD Explorations NewsletterResource description framework
1,073 Citations2001K. Selçuk Candan, Huan Liu +1 more
This survey aims at providing a glimpse at the past, present, and future of this upcoming technology and highlights why it is expected that knowledge discovery and data mining can benefit from RDF and the Semantic Web.
Learning to map between ontologies on the semantic web
891 Citations2002AnHai Doan, Jayant Madhavan +2 more
Glue is described, a system that employs machine learning techniques to find semantic mappings between ontologies and is distinguished in that it works with a variety of well-defined similarity notions and that it efficiently incorporates multiple types of knowledge.
Lecture notes in computer scienceQOM – Quick Ontology Mapping
440 Citations2004Marc Ehrig, Steffen Staab
This work considers QOM, Quick Ontology Mapping, as a way to trade off between effectiveness and efficiency of the mapping generation algorithms, and shows that it has lower run-time complexity than existing prominent approaches.
SIAM ReviewA Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
424 Citations2004Vincent D. Blondel, Anahí Gajardo +3 more
HAL (Le Centre pour la Communication Scientifique Directe)Similarity-based ontology alignment in OWL-Lite
368 Citations2004Jérôme Euzenat, Petko Valtchev
A universal measure for comparing the entities of two ontologies that is based on a simple and homogeneous comparison principle and one-to-many relationships and circularity in entity descriptions constitute the key difficulties.
Journal of DocumentationINFORMATION RETRIEVAL BASED ON CONCEPTUAL DISTANCE IN IS‐A HIERARCHIES
275 Citations1993Joon Ho Lee, Myoung Ho Kim +1 more
GMO: A Graph Matching for Ontologies.
116 Citations2005Wei Hu, Ningsheng Jian +2 more
GMO uses bipartite graphs to represent ontologies, and measures the structural similarity between graphs by a new measurement, and can take a set of matched pairs, which are typically previously found by other approaches, as external input in matching process.
HAL (Le Centre pour la Communication Scientifique Directe)Relaxed Precision and Recall for Ontology Matching
100 Citations2005Marc Ehrig, Jérôme Euzenat
This work presents a framework for generalizing precision and recall that is instantiated by three different measures and shows in a motivating example that the proposed measures are prone to solve the problem of rigidity of classical Precision and recall.
National Conference on Artificial IntelligenceLearning in FOL with a similarity measure
89 Citations1992Gilles Bisson
It is shown that major learning processes, namely generalizatiorl and clustering, can be solved in a homogeneous way by using a similarity measure.
Lecture notes in computer scienceBlock Matching for Ontologies
46 Citations2006Wei Hu, Yuzhong Qu
A novel partitioning-based approach is proposed to address the block matching issue and considers both linguistic and structural characteristics of domain entities based on virtual documents, and uses a hierarchical bisection algorithm for partitioning.