跳到主要导航 跳到搜索 跳到主要内容

Reducing uncertainty of probabilistic Top-K ranking via Pairwise crowdsourcing

  • Xin Lin
  • , Jianliang Xu
  • , Haibo Hu
  • , Fan Zhe

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

In this paper, we propose a novel pairwise crowd-sourcing model to reduce the uncertainty of top-k ranking using a crowd of domain experts. Given a crowdsourcing task of limited budget, we propose efficient algorithms to select the best object pairs for crowdsourcing that will bring in the highest quality improvement. Extensive experiments show that our proposed solutions outperform a random selection method by up to 30 times in terms of quality improvement of probabilistic top-k ranking queries. In terms of efficiency, our proposed solutions can reduce the elapsed time of a brute-force algorithm from several days to one minute.

源语言英语
主期刊名Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018
出版商Institute of Electrical and Electronics Engineers Inc.
1757-1758
页数2
ISBN(电子版)9781538655207
DOI
出版状态已出版 - 24 10月 2018
活动34th IEEE International Conference on Data Engineering, ICDE 2018 - Paris, 法国
期限: 16 4月 201819 4月 2018

出版系列

姓名Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018

会议

会议34th IEEE International Conference on Data Engineering, ICDE 2018
国家/地区法国
Paris
时期16/04/1819/04/18

指纹

探究 'Reducing uncertainty of probabilistic Top-K ranking via Pairwise crowdsourcing' 的科研主题。它们共同构成独一无二的指纹。

引用此