Partition-Based Block Matching of Large Class Hierarchies
ASWC 2006, LNCS 4185, pp. 72-83, 2006.，-0001，（）：
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.
版权说明：以下全部内容由瞿裕忠上传于 2009年01月22日 17时10分26秒，版权归本人所有。