【24h】

Crowdsourced Query Processing on Microblogs

机译:微博的众包查询处理

获取原文

摘要

Currently, crowdsourced query processing is done on reward-driven platforms such as Amazon Mechanical Turk (AMT) and Crowd-Flower. However, due to budget constraints for conducting a crowdsourcing task in practice, the scalability is inherently poor. In this paper, we exploit microblogs for supporting crowdsourced query processing. We leverage the social computation power and decentralize the evaluation of the crowdsourcing platforms queries towards social networks. We propose a new problem of minimizing the cost of processing crowdsourced queries on microblogs, given a specified accuracy threshold of users' votes. This problem is NP-hard and its computation is #P-hard. To tackle this problem, we develop a greedy algorithm with a quality guarantee. We demonstrate the performance on real datasets.
机译:当前,众包查询处理是在诸如Amazon Mechanical Turk(AMT)和Crowd-Flower之类的奖励驱动平台上完成的。但是,由于在实践中执行众包任务的预算限制,可伸缩性本来就很差。在本文中,我们利用微博来支持众包查询处理。我们利用社交计算能力,并将对众包平台查询的评估分散到社交网络。给定指定的用户投票准确度阈值,我们提出了一个新的问题,即最小化处理微博上的众包查询的成本。这个问题是NP难题,其计算是#P难题。为了解决这个问题,我们开发了具有质量保证的贪婪算法。我们展示了真实数据集的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号