一种基于子图近似同构的e-Learning学习资源本体匹配方法  

e-Learning resource ontology matching algorithm based on subgraph approximate isomorphic

作　　者：习海旭[1] 于枫[2,3] 王直[3] 宋爱波[2] 王晓跃[1] 

机构地区：[1]江苏理工学院计算机工程学院,江苏常州213012 [2]东南大学计算机科学与工程学院,南京211189 [3]江苏科技大学计算机科学与工程学院,江苏镇江212003

出　　处：《计算机应用研究》2014年第2期417-421,434,共6页Application Research of Computers

基　　金：江苏省现代教育技术研究课题(2011-R-18859;2013-R-25582);全国教育信息技术研究"十二五"规划课题(116230340)

摘　　要：针对e-Learning学习资源本体异构问题,提出一种基于子图近似同构的本体匹配方法。该方法对现有本体匹配方法进行扩展,综合编辑距离、层次关系等特征,计算本体的结构级相似性,以点、边有序交替匹配来判断实体的有向图近似同构问题,实现本体匹配判定。演示算法处理过程,给出算法时间复杂度理论分析,说明其有效性。Abstract： For the heterogeneity problem among ontologies, this paper presented an algorithm based on sub-graph approximate isomorphic here. It was an extension of existing methods in ontology matching. Under the comprehensive application of features such as edit distance and hierarchical relations, it calculated the similarity of graph structures between two ontologies. Lastly, it determined the ontology matching on the condition of sub-graph approximate isomorphism based on the alternately mapping of nodes and arcs in the describing graphs of ontologies. It used an example to demonstrate this ontology matching process and analyzed the time complexity to explain its effectiveness.

关 键 词：本体匹配 e—Learning学习资源本体 子图同构 时间复杂性 

分 类 号：TP391.6[自动化与计算机技术—计算机应用技术]