电子商务和电子服务环境下具有固定存储空间的上下文交易信任计算新模型

Haibin Zhang, Yan Wang
{"title":"电子商务和电子服务环境下具有固定存储空间的上下文交易信任计算新模型","authors":"Haibin Zhang, Yan Wang","doi":"10.1109/SCC.2013.108","DOIUrl":null,"url":null,"abstract":"In e-commerce and e-service environments, transaction context is important when evaluating the trust level of a seller or a service provider in a forthcoming transaction. However, most existing trust evaluation models compute a single value to reflect the general trust level of a seller without taking any transaction context into account. In the literature, a trust vector approach has been proposed to resolve the above problem. In particular, the trust vector contains different sets of trust values (termed as CTT values) so as to outline a seller's reputation profile. As a result, buyers can identify the potential risk existing in a forthcoming transaction (e.g., value imbalance, i.e. a malicious seller may build up a high level of trust by selling cheap products and then deceive buyers by inducing them to purchase more expensive products) and thus avoid monetary losses. In computing CTT values, some approaches are proposed that store the precomputed aggregation results over large-scale ratings and transaction data of a seller, so as to deliver prompt responses to a buyer's query. Though these approaches allocate relatively small space to each seller for storing the aggregation results, if applied in a system with millions of sellers, space consumption will be intolerable. In this paper, we propose a novel model for CTT computation with fixed storage space, which provides a trade-off between aggregation detail and storage space. It is particular suitable for CTT computation where a request is regarding a seller's trust in recent time period, e.g., the latest six months, rather than six months plus one day. We have conducted experiments on both an eBay dataset and a synthetic dataset to illustrate its good efficiency in responding to buyers' CTT queries.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Novel Model for Contextual Transaction Trust Computation with Fixed Storage Space in E-Commerce and E-Service Environments\",\"authors\":\"Haibin Zhang, Yan Wang\",\"doi\":\"10.1109/SCC.2013.108\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In e-commerce and e-service environments, transaction context is important when evaluating the trust level of a seller or a service provider in a forthcoming transaction. However, most existing trust evaluation models compute a single value to reflect the general trust level of a seller without taking any transaction context into account. In the literature, a trust vector approach has been proposed to resolve the above problem. In particular, the trust vector contains different sets of trust values (termed as CTT values) so as to outline a seller's reputation profile. As a result, buyers can identify the potential risk existing in a forthcoming transaction (e.g., value imbalance, i.e. a malicious seller may build up a high level of trust by selling cheap products and then deceive buyers by inducing them to purchase more expensive products) and thus avoid monetary losses. In computing CTT values, some approaches are proposed that store the precomputed aggregation results over large-scale ratings and transaction data of a seller, so as to deliver prompt responses to a buyer's query. Though these approaches allocate relatively small space to each seller for storing the aggregation results, if applied in a system with millions of sellers, space consumption will be intolerable. In this paper, we propose a novel model for CTT computation with fixed storage space, which provides a trade-off between aggregation detail and storage space. It is particular suitable for CTT computation where a request is regarding a seller's trust in recent time period, e.g., the latest six months, rather than six months plus one day. We have conducted experiments on both an eBay dataset and a synthetic dataset to illustrate its good efficiency in responding to buyers' CTT queries.\",\"PeriodicalId\":370898,\"journal\":{\"name\":\"2013 IEEE International Conference on Services Computing\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Services Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCC.2013.108\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Services Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2013.108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

在电子商务和电子服务环境中,在评估即将发生的交易中卖方或服务提供者的信任级别时,交易上下文非常重要。然而,大多数现有的信任评估模型计算一个单一的值来反映卖方的一般信任水平,而不考虑任何交易环境。在文献中,已经提出了一种信任向量方法来解决上述问题。特别是,信任向量包含不同的信任值集(称为CTT值),以便勾勒出卖方的声誉概况。因此,买家可以识别即将到来的交易中存在的潜在风险(例如,价值失衡,即恶意卖家可能通过销售廉价产品建立高度信任,然后通过诱导买家购买更昂贵的产品来欺骗买家),从而避免金钱损失。在计算CTT值时,提出了一些方法,将预先计算的聚合结果存储在卖家的大规模评级和交易数据上,从而对买家的查询提供及时的响应。虽然这些方法为每个卖家分配相对较小的空间来存储聚合结果,但如果应用于具有数百万卖家的系统,空间消耗将是无法忍受的。本文提出了一种新的固定存储空间的CTT计算模型,该模型提供了聚合细节和存储空间之间的权衡。当请求是关于卖方在最近一段时间内的信任时,例如,最近六个月,而不是六个月加一天,它特别适用于CTT计算。我们在eBay数据集和合成数据集上进行了实验,以说明其在响应买家CTT查询方面的良好效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Novel Model for Contextual Transaction Trust Computation with Fixed Storage Space in E-Commerce and E-Service Environments
In e-commerce and e-service environments, transaction context is important when evaluating the trust level of a seller or a service provider in a forthcoming transaction. However, most existing trust evaluation models compute a single value to reflect the general trust level of a seller without taking any transaction context into account. In the literature, a trust vector approach has been proposed to resolve the above problem. In particular, the trust vector contains different sets of trust values (termed as CTT values) so as to outline a seller's reputation profile. As a result, buyers can identify the potential risk existing in a forthcoming transaction (e.g., value imbalance, i.e. a malicious seller may build up a high level of trust by selling cheap products and then deceive buyers by inducing them to purchase more expensive products) and thus avoid monetary losses. In computing CTT values, some approaches are proposed that store the precomputed aggregation results over large-scale ratings and transaction data of a seller, so as to deliver prompt responses to a buyer's query. Though these approaches allocate relatively small space to each seller for storing the aggregation results, if applied in a system with millions of sellers, space consumption will be intolerable. In this paper, we propose a novel model for CTT computation with fixed storage space, which provides a trade-off between aggregation detail and storage space. It is particular suitable for CTT computation where a request is regarding a seller's trust in recent time period, e.g., the latest six months, rather than six months plus one day. We have conducted experiments on both an eBay dataset and a synthetic dataset to illustrate its good efficiency in responding to buyers' CTT queries.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
IoT Mashup as a Service: Cloud-Based Mashup Service for the Internet of Things Cloud Service Negotiation: A Research Roadmap Formal Modeling of Elastic Service-Based Business Processes Security-Aware Resource Allocation in Clouds Integrated Syntax and Semantic Validation for Services Computing
×
引用
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