摘要
针对多数语义Web服务发现算法需要领域本体支持且算法的复杂度较高的问题,利用Google距离来定量测量Web服务输入、输出间的语义距离,并基于Google海量词汇及Google搜索引擎来计算服务间语义相似度.计算时,不需要提供领域本体且基于开放的Google搜索引擎来计算服务匹配度,提高了效率,降低了复杂度.
To solve the problem that the most of the semantic Web service discovery algorithms required a domain ontology and had a high complexity, the Google distance was used to measure the semantic distance between input and output parameters of Web services, and based on Google's massive vocabulary and the Google searched engine to calculate the semantic similarity between services. This algorithm does not require domain ontology, computing matching degree of Web services based on the open search engine of Google. It can improve the computational efficiency and reduce the complexity of the algorithm.
出处
《北京工业大学学报》
EI
CAS
CSCD
北大核心
2012年第11期1670-1675,共6页
Journal of Beijing University of Technology
基金
国家自然科学基金资助项目(60825203)
北京市自然科学基金资助项目(4122011)