首页> 外文会议>IEEE International Conference on Web Services >Taxonomic Clustering and Query Matching for Efficient Service Discovery
【24h】

Taxonomic Clustering and Query Matching for Efficient Service Discovery

机译:用于高效服务发现的分类学聚类和查询匹配

获取原文

摘要

Service discovery is one of the key problems that have been widely researched in the area of Service Oriented Architecture (SOA) based systems. Web Service clustering is a technique for efficiently facilitating service discovery. Most Web Service clustering approaches are based on suitable semantic similarity distance measure and a threshold. Threshold selection is essentially difficult and often leads to unsatisfactory accuracy. In this paper, we have proposed a self-organizing based clustering algorithm called Taxonomic clustering for taxonomically organizing semantic Web Service advertisements. We have tested the algorithm on both simulation based randomly generated test data and the standard OWL-S TC test data set. We have observed promising results both in terms of accuracy and performance.
机译:服务发现是在基于服务面向服务的架构(SOA)的系统领域已被广泛研究的关键问题之一。 Web服务聚类是一种有效促进服务发现的技术。大多数Web服务聚类方法都基于合适的语义相似度距离测量和阈值。阈值选择基本上是困难的,并且通常会导致不令人满意的准确性。在本文中,我们提出了一种被称为分类组织语义Web服务广告的分类管理基于自组织的聚类算法。我们在基于模拟的随机生成的测试数据和标准OWL-S TC测试数据集上测试了算法。我们在准确性和性能方面观察到有希望的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号