Towards evaluating GRASIM for ontology-based data matching

Abstract

The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restructuring a graph (or a network) and calculating the shortest path between two sub-graphs (or sub-networks). It uses Semantic Decision Tables (SDTs) for storing semantically rich configuration information of the graph. This paper presents an evaluation methodology and the evaluation results while choosing Dijkstra's algorithm to calculate the shortest paths. The tests have been executed with an actual use case of eLearning and training in British Telecom (the Amsterdam branch). © 2010 Springer-Verlag.