摘要
To improve the performance of the ontology matching process, a more efficient ontology matching algorithm, which can effectively eliminate unnecessary operations of matching entities, is proposed. By the theoretical analysis and proof, a set of matching rules are summarized for depicting inherent relations among matching results of entities. Based on these rules, the proposed algorithm can reuse the matching results of two entities to directly determine the matching results of their adjacent entities. Thereby, redundant operations of matching adjacent entities can be avoided, which can improve the performance of the whole matching process. The experimental results show that, compared with related algorithms, the proposed algorithm has high matching accuracy and can remarkably reduce the consuming time of the whole matching process. So, the proposed algorithm is more competent for the large-scale ontology matching which often occurs in the practical heterogeneous web resources integration project.
为了提高本体匹配过程的性能,提出了一种能够有效减少冗余实体匹配操作的高效本体匹配算法rule-match.通过理论分析和证明,总结出了一组刻画实体匹配结果内在联系的匹配规则.基于这组规则,匹配算法可以在匹配过程中重用2个本体实体的匹配结果来直接确定其邻接实体的匹配结果,避免了对邻接实体所进行的不必要的匹配操作,从而提升整个匹配过程的性能.实验结果表明,相对于其他匹配算法,该算法不仅具有较高的准确率,而且能有效降低整个匹配过程所消耗的时间.该算法适用于解决实际异构web信息资源集成项目中所常见的大规模本体匹配问题.
基金
R & D Infrastructure and Facility Development(No2005DKA64201)
the National High Technology Research and De-velopment Program of China (863Program) (No2006AA12Z202)
