首页> 外文期刊>World Wide Web >The study of trust vector based trust rating aggregation in service-oriented environments
【24h】

The study of trust vector based trust rating aggregation in service-oriented environments

机译:面向服务环境中基于信任向量的信任等级聚合研究

获取原文
获取原文并翻译 | 示例
           

摘要

In most existing studies on trust evaluation, a single trust value is aggregated from the ratings given to previous services of a service provider, to indicate his/her current trust level. Such a mechanism is useful but may not be able to depict the trust features of a service provider well under certain circumstances. Alternatively, a complete set of trust ratings can be transferred to a service client for local trust evaluation. However, this incurs a big overhead in communication, since the rating dataset is usually in large scale covering a long service history. The third option is to generate a small set of data that should represent well the large set of trust ratings of a long time period. In the literature, a trust vector approach has been proposed, with which a trust vector of three values resulting from a computed regression line can represent a set of ratings distributed within a time interval (e.g., a week or a month, etc.). However, the computed trust vector can represent the set of ratings well only if these ratings imply consistent trust trend changes and are all very close to the obtained regression line. In a more general case with trust ratings for a long service history, multiple time intervals have to be determined, within each of which a trust vector can be obtained and can represent well all the corresponding ratings. Hence, a small set of data can represent well a large set of trust ratings with well preserved trust features. This is significant for large-scale trust rating transmission, trust evaluation and trust management. In this paper, we propose one greedy and two optimal multiple time interval (MTI) analysis algorithms. We also have studied the properties of our proposed algorithms analytically and empirically. These studies can illustrate that our algorithms can return a small set of MTI to represent a large set of trust ratings and preserve well the trust features.
机译:在大多数有关信任评估的现有研究中,单个信任值是从对服务提供者的先前服务给予的评级中汇总的,以指示其当前的信任级别。这种机制很有用,但在某些情况下可能无法很好地描述服务提供商的信任功能。或者,可以将一组完整的信任等级转移到服务客户端以进行本地信任评估。但是,由于评级数据集通常是大规模的,涵盖了很长的服务历史,因此这在通信方面会产生很大的开销。第三种选择是生成少量数据,这些数据应很好地代表长时间内的大量信任等级。在文献中,已经提出了一种信任向量方法,利用该方法,由计算出的回归线得到的三个值的信任向量可以表示在时间间隔(例如,一周或一个月等)内分布的一组评级。但是,只有当这些信任度暗示一致的信任趋势变化并且都非常接近所获得的回归线时,所计算的信任向量才能很好地表示一组评估值。在具有较长服务历史的信任等级的更一般的情况下,必须确定多个时间间隔,在每个时间间隔内都可以获取信任向量,并且可以很好地表示所有相应的等级。因此,一小组数据可以很好地代表具有良好保存的信任特征的大量信任等级。这对于大规模的信任等级传递,信任评估和信任管理具有重要意义。在本文中,我们提出了一种贪婪和两种最佳多重时间间隔(MTI)分析算法。我们还通过分析和经验研究了我们提出的算法的性质。这些研究可以说明,我们的算法可以返回少量的MTI来代表大量的信任等级,并且可以很好地保留信任特征。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号