Combining preference and absolute judgements in a crowd-sourced setting

This paper addresses the problem of obtaining gold-standard labels of objects based on subjective judgements provided by humans. Assuming each object can be associated with an underlying score, the objective of this work is to predict the underlying score efficiently and accurately based on preference and absolute judgements via experiments in a crowd-sourced setting. Unlike previous information aggregation methods which consider preference and absolute judgements independently or convert one to another in an ad-hoc way, the proposed method combines the two types of judgements directly via an unified probabilistic model. Additionally, we introduce a batch-mode active learning method which actively constructs a set of queries consisting of preference and absolute judgement tests which maximize the expected information gain at each iteration of the experiment. Experimental results show the effectiveness of the proposed method.

[1]  Paul N. Bennett,et al.  Pairwise ranking aggregation in a crowdsourced setting , 2013, WSDM.

[2]  Maksims Volkovs,et al.  A flexible generative model for preference aggregation , 2012, WWW.

[3]  Cha Zhang,et al.  CROWDMOS: An approach for crowdsourcing mean opinion score studies , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[4]  David F. Gleich,et al.  Rank aggregation via nuclear norm minimization , 2011, KDD.

[5]  Chin-Laung Lei,et al.  A crowdsourceable QoE evaluation framework for multimedia content , 2009, ACM Multimedia.

[6]  David Maxwell Chickering,et al.  Here or there: preference judgments for relevance , 2008 .

[7]  Alan C. Bovik,et al.  A Statistical Evaluation of Recent Full Reference Image Quality Assessment Algorithms , 2006, IEEE Transactions on Image Processing.

[8]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[9]  Wei Chu,et al.  Gaussian Processes for Ordinal Regression , 2005, J. Mach. Learn. Res..

[10]  Shane T. Jensen,et al.  Adaptive Paired Comparison Design , 2005 .

[11]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[12]  L. R. Ford Solution of a Ranking Problem from Binary Comparisons , 1957 .

[13]  D. Lindley On a Measure of the Information Provided by an Experiment , 1956 .

[14]  R. A. Bradley,et al.  RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS THE METHOD OF PAIRED COMPARISONS , 1952 .

[15]  F. Mosteller Remarks on the method of paired comparisons: I. The least squares solution assuming equal standard deviations and equal correlations , 1951 .

[16]  P. Moran On the method of paired comparisons. , 1947, Biometrika.