Evaluating Reputation of Web Services under Rating Scarcity

Xin Zhou, Donghui Lin, T. Ishida
{"title":"Evaluating Reputation of Web Services under Rating Scarcity","authors":"Xin Zhou, Donghui Lin, T. Ishida","doi":"10.1109/SCC.2016.35","DOIUrl":null,"url":null,"abstract":"With the proliferation of Web services, more and more functionally equivalent services are being published by service providers on the Web. Although more services mean more flexibility for consumers, it also increases the burden of choosing as consumers may have little or no past experience with the service they will interact with. Therefore, reputation systems have been proposed and are playing a crucial role in the service-oriented environment. Current reputation systems are mainly built upon the explicit feedback or rating given by consumers after experiencing the service. Unfortunately, services at the cold-start stage, prior to being rated, face the rating scarcity problem. In this paper, we focus on this problem and address it through a novel reputation model that uses the Elo algorithm to consider consumer-implicit information in a graph analysis approach. A theoretical analysis is conducted to identify the sufficient and necessary condition for the model to converge to a stable state. Furthermore, experiments confirm our model outperforms the widely adopted reputation algorithm in both accuracy and convergence in the situation of rating scarcity.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Services Computing (SCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2016.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

With the proliferation of Web services, more and more functionally equivalent services are being published by service providers on the Web. Although more services mean more flexibility for consumers, it also increases the burden of choosing as consumers may have little or no past experience with the service they will interact with. Therefore, reputation systems have been proposed and are playing a crucial role in the service-oriented environment. Current reputation systems are mainly built upon the explicit feedback or rating given by consumers after experiencing the service. Unfortunately, services at the cold-start stage, prior to being rated, face the rating scarcity problem. In this paper, we focus on this problem and address it through a novel reputation model that uses the Elo algorithm to consider consumer-implicit information in a graph analysis approach. A theoretical analysis is conducted to identify the sufficient and necessary condition for the model to converge to a stable state. Furthermore, experiments confirm our model outperforms the widely adopted reputation algorithm in both accuracy and convergence in the situation of rating scarcity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于稀缺性评价的Web服务声誉评价
随着Web服务的激增,服务提供者在Web上发布了越来越多功能相同的服务。虽然更多的服务对消费者来说意味着更大的灵活性,但它也增加了选择的负担,因为消费者可能对他们将要交互的服务很少或没有过去的经验。因此,声誉系统被提出,并在面向服务的环境中发挥着至关重要的作用。目前的信誉系统主要建立在消费者体验服务后给出的明确反馈或评级上。不幸的是,处于冷启动阶段的服务,在评级之前,面临评级稀缺问题。在本文中,我们关注这个问题,并通过一个新的声誉模型来解决它,该模型使用Elo算法在图分析方法中考虑消费者隐含信息。通过理论分析,确定了模型收敛到稳定状态的充要条件。此外,实验证明,在稀缺性评级情况下,我们的模型在准确性和收敛性方面都优于广泛采用的声誉算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Implementing the Required Degree of Multitenancy Isolation: A Case Study of Cloud-Hosted Bug Tracking System Complexity Reduction: Local Activity Ranking by Resource Entropy for QoS-Aware Cloud Scheduling An Elasticity-Aware Governance Platform for Cloud Service Delivery An Approach for Modeling and Ranking Node-Level Stragglers in Cloud Datacenters Dynamic Selection for Service Composition Based on Temporal and QoS Constraints
×
引用
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