A Service Clustering Method Based on Wisdom of Crowds

Hui Gao, Karolina K. Dluzniak, Hong Xia, W. Jie, Yanping Chen, Wei Xing, Xin Wang, Zhongmin Wang
{"title":"A Service Clustering Method Based on Wisdom of Crowds","authors":"Hui Gao, Karolina K. Dluzniak, Hong Xia, W. Jie, Yanping Chen, Wei Xing, Xin Wang, Zhongmin Wang","doi":"10.1109/BigDataCongress.2019.00026","DOIUrl":null,"url":null,"abstract":"As the number and variety of services increase, it is becoming difficult and time-consuming to locate services that satisfy users' need. Service clustering is efficacious method to prune the query space, to narrow the searching space, and improve the accuracy of locating services that satisfied users' needs. At present, clustering method of web services adopted single or traditional clustering algorithms. However, accuracy and stability of single or traditional clustering algorithms is poor. In the paper, we proposed SWOC a service clustering method based on wisdom of crowd. Firstly, by using SWOC we calculated document similarity. Secondly, we implemented a mapping algorithm that reduces the correlation of web services and improve accuracy of method. And then, we applyed different number of clusters using different individual clustering methods that increase the number of partitions so as to enhance the robustness of SWOC. Lastly, the diversity algorithm evaluates and selects the partitions to extract interesting information for the final aggregation with the weight of each individual result. Experiments were performed on the real web service dataset crawled from ProgrammableWeb which prove the accuracy, recall, F-value and stability of proposed method.","PeriodicalId":335850,"journal":{"name":"2019 IEEE International Congress on Big Data (BigDataCongress)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Congress on Big Data (BigDataCongress)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BigDataCongress.2019.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

As the number and variety of services increase, it is becoming difficult and time-consuming to locate services that satisfy users' need. Service clustering is efficacious method to prune the query space, to narrow the searching space, and improve the accuracy of locating services that satisfied users' needs. At present, clustering method of web services adopted single or traditional clustering algorithms. However, accuracy and stability of single or traditional clustering algorithms is poor. In the paper, we proposed SWOC a service clustering method based on wisdom of crowd. Firstly, by using SWOC we calculated document similarity. Secondly, we implemented a mapping algorithm that reduces the correlation of web services and improve accuracy of method. And then, we applyed different number of clusters using different individual clustering methods that increase the number of partitions so as to enhance the robustness of SWOC. Lastly, the diversity algorithm evaluates and selects the partitions to extract interesting information for the final aggregation with the weight of each individual result. Experiments were performed on the real web service dataset crawled from ProgrammableWeb which prove the accuracy, recall, F-value and stability of proposed method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于群体智慧的服务聚类方法
随着服务数量和种类的增加,定位满足用户需求的服务变得越来越困难和耗时。服务聚类是一种有效的方法,可以减少查询空间,缩小搜索空间,提高定位满足用户需求的服务的准确性。目前,web服务的聚类方法采用单一或传统的聚类算法。然而,单一或传统聚类算法的准确率和稳定性较差。本文提出了一种基于群体智慧的服务聚类方法——SWOC。首先,利用SWOC计算文档相似度。其次,我们实现了一种映射算法,减少了web服务之间的相关性,提高了方法的准确性。然后,我们使用不同的单个聚类方法,增加分区的数量,从而提高SWOC的鲁棒性。最后,多样性算法评估和选择分区,以每个单独结果的权重提取最终聚合的感兴趣信息。在programableweb上抓取的真实web服务数据集上进行了实验,验证了该方法的准确率、召回率、f值和稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
PREMISES, a Scalable Data-Driven Service to Predict Alarms in Slowly-Degrading Multi-Cycle Industrial Processes Context-Aware Enforcement of Privacy Policies in Edge Computing Efficient Re-Computation of Big Data Analytics Processes in the Presence of Changes: Computational Framework, Reference Architecture, and Applications Reducing Feature Embedding Data for Discovering Relations in Big Text Data Distributed, Numerically Stable Distance and Covariance Computation with MPI for Extremely Large Datasets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1