摘要
提出一种基于领域本题概念相似度计算的语义Web服务发现方法。给出合理的概念相似度计算公式,通过领域本体概念相似度计算,最终获得请求和候选服务之间的相似度。传统的概念相似度计算方法只考虑继承关系,本文采用的单概念语义不但考虑继承关系,还考虑二元关系,使本体关系结构构成图结构,更加合理。计算语义距离时,适当处理多继承问题和环问题。实验证实,本算法使得匹配更加合理精确。
This paper presents an algorithm of measuring similarity in semantic web service matchmaking which is based on ontology and finally calculates the similarity between the request and the candidate services.The traditional algorithm of measuring concept similarity only considers the inheritance relationship and our single-element matching algorithm takes two aspects into account： the inheritance relationship and especially multi-inheritance among concepts,which makes all the ontology constitute a graph structure.And it handles multi-inheritance problems and circle problems in process of calculating the semantic distance of two concepts.The experiment proves that our method is more reasonable and accurate.
出处
《计算技术与自动化》
2010年第2期98-101,共4页
Computing Technology and Automation
基金
国家自然科学基金项目(60970096)
关键词
语义WEB服务
服务发现
概念相似度
匹配算法
semantic Web services
service discovery
concept similarity
matching algorithm
