Challenges in data crowdsourcing
Crowdsourcing refers to solving large problems by involving human workers that solve
component sub-problems or tasks. In data crowdsourcing, the problem involves data …
component sub-problems or tasks. In data crowdsourcing, the problem involves data …
So who won? Dynamic max discovery with the crowd
We consider a crowdsourcing database system that may cleanse, populate, or filter its data
by using human workers. Just like a conventional DB system, such a crowdsourcing DB …
by using human workers. Just like a conventional DB system, such a crowdsourcing DB …
Crowdsourced data management: Industry and academic perspectives
A Marcus, A Parameswaran - Foundations and Trends® in …, 2015 - nowpublishers.com
Crowdsourcing and human computation enable organizations to accomplish tasks that are
currently not possible for fully automated techniques to complete, or require more flexibility …
currently not possible for fully automated techniques to complete, or require more flexibility …
[PDF][PDF] An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity.
N Ailon - Journal of Machine Learning Research, 2012 - jmlr.org
Given a set V of n elements we wish to linearly order them given pairwise preference labels
which may be non-transitive (due to irrationality or arbitrary noise). The goal is to linearly …
which may be non-transitive (due to irrationality or arbitrary noise). The goal is to linearly …
Max algorithms in crowdsourcing environments
P Venetis, H Garcia-Molina, K Huang… - Proceedings of the 21st …, 2012 - dl.acm.org
Our work investigates the problem of retrieving the maximum item from a set in
crowdsourcing environments. We first develop parameterized families of max algorithms …
crowdsourcing environments. We first develop parameterized families of max algorithms …
Maximum selection and ranking under noisy comparisons
Abstract We consider $(\epsilon,\delta) $-PAC maximum-selection and ranking using
pairwise comparisons for general probabilistic models whose comparison probabilities …
pairwise comparisons for general probabilistic models whose comparison probabilities …
Hypothesis selection with memory constraints
Hypothesis selection is a fundamental problem in learning theory and statistics. Given a
dataset and a finite set of candidate distributions, the goal is to select a distribution that …
dataset and a finite set of candidate distributions, the goal is to select a distribution that …
Submodular optimization under noise
A Hassidim, Y Singer - Conference on Learning Theory, 2017 - proceedings.mlr.press
We consider the problem of maximizing a monotone submodular function under noise.
Since the 1970s there has been a great deal of work on optimization of submodular …
Since the 1970s there has been a great deal of work on optimization of submodular …
Ranking mechanisms in twitter-like forums
We study the problem of designing a mechanism to rank items in forums by making use of
the user reviews such as thumb and star ratings. We compare mechanisms where forum …
the user reviews such as thumb and star ratings. We compare mechanisms where forum …
Maxing and ranking with few assumptions
PAC maximum selection (maxing) and ranking of $ n $ elements via random pairwise
comparisons have diverse applications and have been studied under many models and …
comparisons have diverse applications and have been studied under many models and …