Approximating the wisdom of the crowd

Date

2011-12-17

Author

Ertekin Bolelli, Şeyda
Rudin, Cynthia

Metadata

Show full item record

Item Usage Stats

92
views

0
downloads

The problem of “approximating the crowd” is that of estimating the crowd’s majority opinion by querying only a subset of it. Algorithms that approximate the crowd can intelligently stretch a limited budget for a crowdsourcing task. We present an algorithm, “CrowdSense,” that works in an online fashion to dynamically sample subsets of labelers based on an exploration/exploitation criterion. The algorithm produces a weighted combination of the labelers’ votes that approximates the crowd’s opinion.

URI

http://media.nips.cc/Conferences/2011/NIPS-Workshops-Book-2011.pdf
https://hdl.handle.net/11511/72591
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.225.7649&rep=rep1&type=pdf

Conference Name

NIPS 2011 Second Workshop on Computational Social Science and the Wisdom of Crowds (17 Aralık 2011)

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Approximating the crowd Ertekin Bolelli, Şeyda; Hirsh, Haym (Springer Science and Business Media LLC, 2014-09-01) The problem of "approximating the crowd" is that of estimating the crowd's majority opinion by querying only a subset of it. Algorithms that approximate the crowd can intelligently stretch a limited budget for a crowdsourcing task. We present an algorithm, "CrowdSense," that works in an online fashion where items come one at a time. CrowdSense dynamically samples subsets of the crowd based on an exploration/exploitation criterion. The algorithm produces a weighted combination of the subset's votes that appr...
Selective sampling of labelers for approximating the crowd Ertekin Bolelli, Şeyda; Rudin, Cynthia (null; 2012-11-05) In this paper, we present CrowdSense, an algorithm for estimating the crowd’s majority opinion by querying only a subset of it. CrowdSense works in an online fashion where examples come one at a time and it dynamically samples subsets of labelers based on an exploration/exploitation criterion. The algorithm produces a weighted combination of a subset of the labelers’ votes that approximates the crowd’s opinion. We also present two probabilistic variants of CrowdSense that are based on different assumptions ...
One-way anova for time series data with non-normal innovations: an application to unemployment rate data Yıldırım, Özgecan; Yozgatlıgil, Ceylan; Şenoğlu, Birdal; Department of Statistics (2017) ANOVA is a well-known approach when examining the equality of three or more than three groups’ means. However, like every parametric test, some assumptions are to be satisfied so that the appropriate and reliable conclusions are obtained. The major emphasis of this thesis is the non-validated model assumptions of the oneway ANOVA, where the independency and normality assumptions are considered as non-validated. Indeed, in real life applications, it is not realistic to validate all of those assumptions. That...
More inclusive than before?: The tale of a historic urban park in Ankara, Turkey Akkar Ercan, Zübeyde Müge (2015-08-01) In the prevailing literature on contemporary public spaces, two contested sets of arguments become apparent: one depicts the 'end of public space', while the other challenges with this 'end of public space' discourse. Following the debates, one can ask the question of whether there has been any ideally 'public' or 'inclusive' public space ever in cities, or the inclusivity (thereby 'publicness') of public spaces can or may change in time based on a variety of factors. This research, addressing these questio...
Estimating parameters of a multiple autoregressive model by the modified maximum likelihood method TÜRKER BAYRAK, ÖZLEM; Akkaya, Ayşen (Elsevier BV, 2010-02-15) We consider a multiple autoregressive model with non-normal error distributions, the latter being more prevalent in practice than the usually assumed normal distribution. Since the maximum likelihood equations have convergence problems (Puthenpura and Sinha, 1986) [11], we work Out modified maximum likelihood equations by expressing the maximum likelihood equations in terms of ordered residuals and linearizing intractable nonlinear functions (Tiku and Suresh, 1992) [8]. The solutions, called modified maximu...

Citation Formats

Ş. Ertekin Bolelli and C. Rudin, “Approximating the wisdom of the crowd,” presented at the NIPS 2011 Second Workshop on Computational Social Science and the Wisdom of Crowds (17 Aralık 2011), Granada, Nikaragua, 2011, Accessed: 00, 2021. [Online]. Available: http://media.nips.cc/Conferences/2011/NIPS-Workshops-Book-2011.pdf.