首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于本体划分的语义Web服务发现算法
引用本文:石 敏,赵文栋,张 磊.一种基于本体划分的语义Web服务发现算法[J].计算机工程,2014(2):175-179.
作者姓名:石 敏  赵文栋  张 磊
作者单位:解放军理工大学通信工程学院,南京210007
摘    要:针对集中式服务发现方式容易导致单点故障和性能瓶颈的问题,提出一种基于结构化P2P网络的语义Web服务发现算法。利用本体划分技术,按概念相似度完成本体的划分并生成可偏序排序的组概念,用组概念粗粒度地表示服务的语义信息,并聚类语义相似的服务。在此基础上,设计基于组概念生成向量的服务发布/发现算法,从服务/请求中提取多个散列的关键字,在适当增加服务发布/发现冗余的情况下,实现结构化P2P网络中语义Web服务的模糊匹配。实验结果显示,与精确匹配算法相比,该算法服务发现的平均召回率由15.2%提高到了37.1%。

关 键 词:语义Web服务  服务发布  服务发现  本体划分  结构化PP  模糊匹配

A Semantic Web Service Discovery Algorithm Based on Ontology Partition
SHI Min,ZHAO Wen-dong,ZHANG Lei.A Semantic Web Service Discovery Algorithm Based on Ontology Partition[J].Computer Engineering,2014(2):175-179.
Authors:SHI Min  ZHAO Wen-dong  ZHANG Lei
Affiliation:(College of Communication Engineering, PLA University of Science and Technology, Nanjing 210007, China)
Abstract:The traditional approach of semantic Web service discovery is centralized which leads to single point failure and performance bottleneck, quickly becomes impractical. Aiming at this problem, this paper presents a semantic Web service discovery algorithm in structured P2P networks. It partitions ontological concepts into different concept groups and defines group concepts to character service coarsely. Then it presents a service publishing/discovery algorithm based on group concepts generating vectors. The algorithm gets multi-keywords from service/query and realizes semantic Web service's fuzzy match with appropriate redundancy in structured P2P networks. Experimental results show that the recall of this algorithm is increased from 15.2% to 37.1% compared with exact discovery algorithm.
Keywords:semantic Web service  service publishing  service discovery  ontology partition  structured P2P  fuzzy match
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号