首页> 外文会议>International conference on wireless algorithms, systems, and applications >Private Weighted Histogram Aggregation in Crowdsourcing
【24h】

Private Weighted Histogram Aggregation in Crowdsourcing

机译:众包中的私人加权直方图聚合

获取原文

摘要

Histogram is one of the fundamental aggregates in crowdsourcing data aggregation. In a crowdsourcing aggregation task, the potential value or importance of each bucket in the histogram may differs, especially when the number of buckets is relatively large but only a few of buckets are of great interests. This is the case weighted histogram aggregation is needed. On the other hand, privacy is a critical issue in crowdsourcing, as data contributed by participants may reveal sensitive information about individuals. In this paper, we study the problem of privacy-preserving weighted histogram aggregation, and propose a new local differential-private mechanism, the bi-parties mechanism, which exploits the weight imbalances among buckets in histogram to minimize weighted error. We provide both theoretical and experimental analyses of the mechanism, specifically, the experimental results demonstrate that our mechanism can averagely reduce 20 % of weighted square error of estimated histograms compared to existing approaches (e.g. randomized response mechanism, exponential mechanism).
机译:直方图是众包数据聚合中的基本聚合之一。在众包聚合任务中,直方图中每个存储桶的潜在价值或重要性可能会有所不同,尤其是在存储桶的数量相对较大但只有几个存储桶引起人们极大兴趣的情况下。这就是需要加权直方图聚合的情况。另一方面,隐私是众包中的关键问题,因为参与者提供的数据可能会泄露有关个人的敏感信息。在本文中,我们研究了隐私保护加权直方图聚合的问题,并提出了一种新的局部差分-私有机制,即两方机制,该机制利用直方图中各个存储桶之间的权重不平衡来最小化加权误差。我们提供了该机制的理论和实验分析,具体而言,实验结果表明,与现有方法(例如随机响应机制,指数机制)相比,我们的机制平均可减少估计直方图的加权平方误差的20%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号