The Community for Technology Leaders
2018 IEEE 34th International Conference on Data Engineering (ICDE) (2018)
Paris, France
Apr 16, 2018 to Apr 19, 2018
ISSN: 2375-026X
ISBN: 978-1-5386-5520-7
pp: 1757-1758
ABSTRACT
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.
INDEX TERMS
crowdsourcing, probability, query processing
CITATION

X. Lin, J. Xu, H. Hu and F. Zhe, "Reducing Uncertainty of Probabilistic Top-k Ranking via Pairwise Crowdsourcing," 2018 IEEE 34th International Conference on Data Engineering (ICDE), Paris, France, 2018, pp. 1757-1758.
doi:10.1109/ICDE.2018.00236
185 ms
(Ver 3.3 (11022016))