• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Web information systems and technologies >Web Service Matchmaking by Subgraph Matching
【24h】

Web Service Matchmaking by Subgraph Matching

机译：通过子图匹配进行Web服务匹配

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

摘要

Several approaches have been proposed to deal with the web service matchmaking problem. Unfortunately, most of these solutions are purely syntactic measures based on the input/output interface specifications of web services and consequently lake accuracy. This is a serious drawback in a fast growing Internet that is facing the challenge to deal with an increasing number of published services. The proposed solutions to cope with this limitation consider the process part of a service description as a graph in the similarity measure. This kind of solutions has better accuracy but suffer from high computational complexity because they rely on time consuming graph matching tools. To avoid this heavy time computing overhead, we propose in this paper a solution that decomposes the process graph into smaller subgraphs and construct similarity of web services based on the similarity of their subgraphs. Simulation results show that our solution is both accurate and fast to compute.
机译：已经提出了几种方法来处理网络服务匹配问题。不幸的是，这些解决方案中的大多数都是基于Web服务的输入/输出接口规范以及由此而来的湖泊准确性的纯粹的语法措施。在快速增长的Internet中，这是一个严重的缺点，它正面临着处理越来越多的已发布服务的挑战。为解决此限制而提出的解决方案将服务描述的过程部分视为相似性度量中的图形。这种解决方案具有更高的准确性，但由于它们依赖于耗时的图形匹配工具，因此具有较高的计算复杂度。为了避免这种繁重的计算开销，我们在本文中提出了一种解决方案，该解决方案将过程图分解为较小的子图，并基于子图的相似性构造Web服务的相似性。仿真结果表明，我们的解决方案既准确又快速计算。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号