首页 | 本学科首页   官方微博 | 高级检索  
     

基于二部图模型的大本体分块与映射方法
引用本文:郭维,徐德智,邹亮.基于二部图模型的大本体分块与映射方法[J].计算机工程,2012,38(23):37-41,46.
作者姓名:郭维  徐德智  邹亮
作者单位:中南大学信息科学与工程学院,长沙,410083
基金项目:国家自然科学基金资助项目
摘    要:针对当前大本体分块与映射方法中的块边界信息丢失严重、块间匹配计算复杂等问题,提出一种基于二部图模型的大本体分块与映射方法。根据本体概念相似度在2个本体间建立带权二部图模型,对该二部图进行分割,实现本体的关联分块,在子图中求解得到二部图的最佳匹配,并通过映射修正获得块内实体映射。实验结果表明,该方法的分块质量与映射效率均较优。

关 键 词:大本体  二部图  分块  映射  最佳匹配  映射修正
收稿时间:2012-03-20

Large-scale Ontology Partition and Mapping Method Based on Bipartite Graph Model
GUO Wei , XU De-zhi , ZOU Liang.Large-scale Ontology Partition and Mapping Method Based on Bipartite Graph Model[J].Computer Engineering,2012,38(23):37-41,46.
Authors:GUO Wei  XU De-zhi  ZOU Liang
Affiliation:(School of Information Science and Engineering, Central South University, Changsha 410083, China)
Abstract:Aiming at the defects of partition quality and mapping efficiency existed in large-scale ontology mapping, this paper proposes a new method for large-scale ontology partition and mapping based on bigraph graph model. A weighted bigraph is built by the similarity between the concepts of two ontologies and the bigraph is partitioned into subgraphs to achieve ontology co-partition. Then the ontology mapping problem is translated into an optimal matching problem in sub-graphs. It applies the revised rules to obtain alignments in the optimal matching. Experimental results show that partition quality and mapping efficiency of this method is well.
Keywords:large-scale ontology  bipartite graph  partition  mapping  optimal matching  mapping correction
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号