首页> 外文会议>IEEE International Conference on Services Computing >A Prior Knowledge Based Approach to Improving Accuracy of Web Services Clustering
【24h】

A Prior Knowledge Based Approach to Improving Accuracy of Web Services Clustering

机译:基于先验知识的提高Web服务集群准确性的方法

获取原文

摘要

The rapid growth in both the number and diversity of Web services raises new requirement of clustering techniques to facilitate the service discovery, service repository management etc. Existing clustering methods of Web services primarily focus on using the semantic distances between service features, e.g., topic vectors, mined from WSDL documents. However, these quality topic vectors are hard to be obtained due to the lack of abundant textual information in Web service description documents. In practice, prior knowledge from human's trajectory of utilizing Web services could be helpful in improving the accuracy of Web services clustering. With an analysis in the dataset of Web services and Mashups from ProgrammableWeb, we observe that Web services Mashuped together are highly likely to belong to different clusters and Web services being annotated with identical tags tend to be within the same cluster. Based on these observations, this paper proposes an efficient clustering approach for Web services. The approach firstly uses a probabilistic topic model to elicit the latent topic vectors from Web service description documents. It then performs clustering based on the K-means++ algorithm by incorporating parameters representing above mentioned prior knowledge. A comprehensive evaluation is conducted to validate the performance of our proposed approach based on a ground truth dataset crawled from ProgrammableWeb. Experimental comparisons of the approaches with and without these prior knowledge considerations show that our approach has a significant improvement on the clustering accuracy.
机译:Web服务的数量和多样性的快速增长提出了对群集技术的新要求,以促进服务发现,服务库管理等。现有的Web服务群集方法主要集中在使用服务特征(例如主题向量)之间的语义距离上。 ,摘自WSDL文档。但是,由于Web服务描述文档中缺少大量的文本信息,因此很难获得这些高质量的主题向量。在实践中,人类利用Web服务的轨迹的先验知识可能有助于提高Web服务群集的准确性。通过对来自ProgrammableWeb的Web服务和Mashups数据集中的分析,我们观察到将Mashuped组合在一起的Web服务很可能属于不同的集群,并且带有相同标签的Web服务往往位于同一集群中。基于这些观察,本文提出了一种有效的Web服务集群方法。该方法首先使用概率主题模型从Web服务描述文档中得出潜在的主题向量。然后,它通过合并代表上述先验知识的参数,基于K-means ++算法执行聚类。进行了全面的评估,以基于从ProgrammableWeb爬取的地面事实数据集验证我们提出的方法的性能。在有或没有这些先验知识的情况下,对这些方法进行的实验比较表明,我们的方法在聚类精度上有显着提高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号