期刊文献+

基于大规模本体的有效匹配研究

Effective Matching Based on Large Scale Ontology
下载PDF
导出
摘要 为了改善不同领域专家构建的本体存在不匹配的问题,以及大规模本体问题已经超过当前的匹配方法,笔者设计了一种基于模块化的方法,其思路是把一个大的匹配问题分解成几个小的匹配问题,以减少急剧变化的复杂性.为了验证该方法,选定了几个较大和复杂的本体来测试.结果表明,基于模块化的方法(MOM)在保持较好的准确率和查全率的同时还可以较大地减少匹配时间. In order to solve the problems of the mismatching of ontology constructed by the .experts in different fields and that the large scale ontology problems is beyond the reach of the existing matching methods, a modularization-based approach was designed. The main idea of the design was to decompose a large matching problem into several smaller ones and reduce the complexity of the dramatically change. To further verify the approach, several large and complex ontology had been chosen to be tested. The results showed that this method could significantly reduce the time cost and keep the high matching accuracy and recall.
出处 《海南大学学报(自然科学版)》 CAS 2009年第3期270-274,共5页 Natural Science Journal of Hainan University
基金 海南省自然科学基金项目(80638)
关键词 模块化方法 本体匹配 领域本体 modular approach ontology matching domain ontologism
  • 相关文献

参考文献9

  • 1MADHAVAN J, BERNSTEIN P A, RAHM E. Generic Schema Matching with Cupid: Proceedings of 27th International Conference on Very Large Data Bases, Roma, September 11 -14, 2001 [ C]. Roma: Morgan Kaufmann Publishers, 2001.
  • 2DO H H, RAHM E. COMA-A system for flexible combination of schema matching Approaches : Proceedings of 28th International Conference on Very Large Data Bases, Hong Kong, August 20 - 23, 2002 [ C ].Hong Kong: Morgan Kaufmann Publishers, 2002.
  • 3DOAN A,MADHAVAN J, DHAMANKAR R, et al. Learning to match ontologies on the Semantic Web[J]. The VLDB Journal, 2003,12(4) : 303 -319.
  • 4MELNIK S, RAHM E, BERNSTEIN P A. Rondo : a programming platform for generic model management : Proceedings of the 2003 ACM SIGMOD international conference on Management of data, San Diego, June 9 - 12,2003 [ C]. San Diego: ACM Press, 2003.
  • 5GIUNCHIGLIA F, SHVAIKO P, YATSKEVICH M. S-Match: an algorithm and an implementation of semantic matching: Proceedings of ESWS2004, Herakilon, January 10 - 12, 2004 [ C ]. Berlin : Springer,2004.
  • 6HOPCROFT J, KARP R. An n5/2 algorithm for maximum matchings in bipartite graphs [ J ]. SIAM Journal on Computing , 1973, 2 (4) :225 -231.
  • 7MAEDCHE A, STAAB S. Measuring similarity between ontologies:Proceedings of EKAW, Siguenza, October 1 -4, 2002 [ C]. London : Springer-Verlag,2002.
  • 8WANG Z, WANG Y, ZHANG S, et al. Ontology Pasing Graph-based Mapping: A Parsing Graph-based Algorithm for Ontology Mapping[J]. Journal of Donghua University, 2006,23(6) .5 309 -5 313.
  • 9DO H H, MELNIK S, RAHM E. Comparison of schema matching evaluations:Proceedings of the 2nd Int. Workshop on Web Databases, Erfurt, October 7 - 10, 2002 [ C ]. London : Springer-Verlag , 2002.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部