检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]燕山大学信息科学与工程学院,河北秦皇岛066004 [2]华北保定电力职业技术学院计算机基础教研室,河北保定071051
出 处:《计算机应用》2008年第B06期10-14,103,共6页journal of Computer Applications
基 金:国家自然科学基金资助项目(60773100);教育部科学技术研究重点项目(205014);河北省教育厅科研计划项目(2006143)
摘 要:提出一种新的本体集成方法。分析了本体集成的原因,阐述了本体集成时应遵循的4条基本原则,并给出了集成的分类,提出了一种基于OWL DL图闭包的本体集成方法。该方法将OWL DL本体抽象为RDFS图模型,根据给定的OWL DL推理规则生成OWL DL本体的图闭包,在此基础上进行本体集成,同时提出了几种计算实体相似度的方法,将本方法与COMA++和FCA-merge进行实验对比,本方法在准确率和召回率上占优势。A new method for ontology integration was proposed. Firstly, after having analyzed the reasons of ontology integration, four basic rules were put forward and the classifications for it were given. Secondly, a method based on the closure of OWL DL for ontology integration was proposed. In this method, OWL DL ontologies were abstracted as RDFS graph models. Using the OWL inference roles, the closure of OWL DL ontologies could be constructed. Based on these closures, the integration could be carried out. During this part, some measure methods for similarity between entities were proposed too. Lastly, for comparing this method with COMA ++ and FCA-merge, experiments were done. Results show that the method is better than COMA + + and FCA-merge in precision and recall.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.135.152