检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]广西师范学院计算机与信息工程学院
出 处:《计算机工程与科学》2010年第8期154-157,160,共5页Computer Engineering & Science
基 金:国家自然科学基金资助项目(60763012);广西自然科学基金资助项目(0731028)
摘 要:为了解决语义网环境下构件查询的查全查准率问题,本文提出了基于本体相似度构件查询算法。首先介绍了本体的形式化定义和构件的刻面描述方法,用本体语言(OWL)对构件本体进行形式化的描述;然后针对本体的概念相似度理论和构件刻面匹配度公式存在的不足,用构件本体的概念相似度代替公式中的匹配度,对构件刻面匹配度公式进行改进和分析,提出了本体相似度构件查询算法;算法通过计算查询树和构件树各子刻面本体概念的RDF描述相似度和RDF图结构相似度,再由构件本体相似度匹配公式进行相似度的比较,检索出相似度高的构件。实验结果表明,该算法具有理想的查全查准率。In order to solve the problem of recall ratio and precision of the component'query in the Semantic Web envi- ronment, the software component query algorithm based on ontology similarity is proposed. The paper first introduces the formal ontology definition and a component facet description method. The component ontology is formally described in the Web ontology language (OWL). Then,according to the concept of ontology similarity theory and the deficiency of the matc- hing formula of component facet, the match degree of the matching formula of component facet is replaced by the concept similarity of component ontology;improvement and analysis are made in the matching formula of component facet. Thus, the ontology similarity query algorithmtis put forward. By calculating the faceted ontological concept similarity of the component query tree and the trees corresponding to the various sub-components, and then comparing the degree of similarity with the matching formula of component facet, the algorithm retrieves the highest degree of similarity of components. The result of the experiment indicates the algorithm has an ideal recall ratio and precision.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.172