Partition-based block matching of large class hierarchies

Last update: 2010-04-19
URI: http://ws.nju.edu.cn/publications/hzq06
Authors: Wei Hu , Yuanyuan Zhao , Yuzhong Qu
Type: Inproceedings
Published: 2006
Publisher: Springer
Pages: 72-83
inPublication: In Proc. of the 1st Asian Semantic Web Conference (ASWC)
Abstract:

Ontology matching is a crucial task of enabling interoperation betweenWeb applications using different but related ontologies. Due to the size and the monolithic nature, large-scale ontologies regarding real world domains cause a new challenge to current ontology matching techniques. In this paper, we propose a method for partition-based block matching that is practically applicable to large class hierarchies, which are one of the most common kinds of large-scale ontologies. Based on both structural affinities and linguistic similarities, two large class hierarchies are partitioned into small blocks respectively, and then blocks from different hierarchies are matched by combining the two kinds of relatedness found via predefined anchors as well as virtual documents between them. Preliminary experiments demonstrate that the partitionbased block matching method performs well on our test cases derived from Web directory structures.

Download: file
RDF