• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Advances in data and web management >Semantic Service Discovery by Consistency-Based Matchmaking
【24h】

Semantic Service Discovery by Consistency-Based Matchmaking

机译：基于一致性匹配的语义服务发现

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Automated discovery of web services with desired functionality is an active research area because of its role in realising the envisioned advantages of the semantic web, such as functional reuse and automated composition. Existing approaches generally determine matches by inferring subsumption relationships between a request and a service specification, but may return poor results if service profiles are overspecified or provide only partial information. We present a two-staged consistency-based matchmaking approach where services that potentially match the request are identified in the first stage, these services are queried for concrete information, and finally this information is used to determine the matches. We evaluate our matchmaking scheme in the context of the Discovery II and Simple Composition scenario proposed by the SWS Challenge group. Preliminary evaluation shows that our approach is robust while handling overspecified profiles, does not return false positives, and is able to handle partial information in service and requirements specification.
机译：具有所需功能的Web服务的自动发现是活跃的研究领域，因为它在实现语义Web的预期优势（例如功能重用和自动化组合）方面发挥了作用。现有方法通常通过推断请求和服务规范之间的包含关系来确定匹配，但是如果服务配置文件被过度指定或仅提供部分信息，则可能返回不良结果。我们提出了一种基于一致性的两阶段匹配方法，其中在第一阶段中识别可能与请求匹配的服务，向这些服务查询具体信息，最后将这些信息用于确定匹配。我们在SWS挑战小组提出的Discovery II和Simple Composition场景的背景下评估配对计划。初步评估表明，我们的方法在处理过度指定的概要文件时是可靠的，不会返回误报，并且能够处理服务和需求规范中的部分信息。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号