...
首页> 外文期刊>Journal of software >A New Algorithm for Semantic Web Service Matching
【24h】

A New Algorithm for Semantic Web Service Matching

机译:语义Web服务匹配的新算法

获取原文

摘要

Considering the existing problems in Web servicesuch as lack of semantic information and interoperability,atomic services can not cooperate with each other and becombined into composite services. In this paper, based onextended UDDI, we present a semantic annotationframework for Web service description and composition.The novel service matching algorithm not only takes intoaccount the height factor of ontology tree and local densityfactor for the impact of semantic distance, but also thedegree of semantic overlap. Experimental results show thatthe proposed service matching algorithm improved theefficiency of Web service discovery, and thus Web servicecan be composed easily to form more complicated interrelatedservices.
机译:考虑到Web服务中存在的语义信息不足和互操作性等问题,原子服务无法相互协作,无法组合为复合服务。本文基于扩展的UDDI,提出了一种用于Web服务描述和组合的语义标注框架。新颖的服务匹配算法不仅考虑了本体树的高度因子和局部密度因子对语义距离的影响,而且考虑了语义的程度。交叠。实验结果表明,所提出的服务匹配算法提高了Web服务发现的效率,可以很容易地组成Web服务以形成更复杂的相互关联的服务。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号