Table 1: Microtasks for verifying whether two entities are matched.
Microtask Verifying two entities Tokens
t
1
(iphone 4 WiFi 32GB, iphone four 3G black) {iphone 4 WiFi 32GB four 3G black}
t
2
(ipod touch 32GB WiFi, ipod touch headphone) {ipod touch 32GB WiFi headphone}
t
3
(ipad 3 WiFi 32GB black, new ipad cover white) {ipad 3 WiFi 32GB black new cover white}
t
4
(iphone four WiFi 16GB, iphone four 3G 16GB) {iphone four WiFi 16GB 3G}
t
5
(iphone 4 case black, iphone 4 WiFi 32GB) {iphone 4 case black WiFi 32GB}
t
6
(iphone 4 WiFi 32GB, iphone four WiFi 32GB) {iphone 4 WiFi 32GB four}
t
7
(ipod touch 32GB WiFi, ipod touch case black) {ipod touch 32GB WiFi case black}
t
8
(ipod touch headphone, ipo d nano headphone) {ipod touch nano headphone}
t
9
(ipod touch WiFi, ipod n ano headphone) {ipod touch WiFi nano headphone}
t
10
(ipad 3 WiFi 32GB black, iphone 4 cover white) {ipad 3 WiFi 32GB black iphone 4 cover white}
t
11
(ipad 4 WiFi 16GB, ipad retina display WiFi 16GB) {ipad 4 WiFi 16GB retina display}
t
12
(ipad 3 cover white, n ew ipad cover white) {ipad 3 cover white new}
curacies and thus result in unreliable aggregated results. On
the other hand, existing approaches neglect a fact that we
can adaptively assign tasks to workers who have expertise on
the tasks to further improve the quality, instead of random
task assignment without considering workers’ expertise.
To address the limitations of existing approaches, we pro-
pose an adaptive crowdsourcing framework, called iCrowd.
iCrowd on-the-fly estimates accuracies of a worker by eval-
uating her performance on the completed tasks, and infers
worker’s accuracies on similar tasks. When a worker re-
quests for a task, the framework assigns the worker a task,
to which the worker has the highest estimated accuracy a-
mong all online workers. Once a worker submits her answer
to a task, iCrowd analyzes her answer and adaptively adjusts
the accuracy estimation to improve any subsequent task as-
signments. In this wa y, iCrowd can effectively predict which
workers are more appropriate for a task, and adaptively as-
signs the task to these high-quality workers.
We address two main research challenges that arise in
adaptive crowdsourcing. The first one is how to estimate
the diverse accuracies of workers based on their completed
tasks. To address this challenge, we prop ose an accuracy es-
timation method by considering the “similarity” of tasks: a
worker may have comparable accuracies on tasks in similar
domains. We first construct a graph to model similarity of
tasks and evaluate worker accuracies on her completed tasks.
The second one is instant task assignment based on the es-
timated accuracies. As workers are generally impatient to
wait for too long for a task assignment, we need to efficiently
assign tasks to the workers. We develop efficient algorithm-
stosupportinstanttaskassignment. Sinceexistingplat-
forms, such as Amazon Mechanical Turk (AMT) [2], have
no functionality to support assigning tasks to workers, we
develop an iCrowd system which iteratively communicates
with the platforms to receive task requests from workers,
assign tasks to them, and obtain answers from the workers.
To summarize, we make the following contributions.
(1) We formulate the problem of adaptive crowdsourcing
and develop a framework iCrowd to support adaptive crowd-
sourcing in existing crowdsourcing platforms (see Section 2).
(2) We prop ose a graph-based estimation mo d el to es-
timate th e accuracies of a worker based on her completed
tasks, which can tackle the diverse accuracies of workers
across tasks and provide accurate estimation (see Section 3).
(3) We devise an adaptive assignment framework, prove
that the optimal task assignment problem is NP-hard, and
develop a greedy algorithm to enable instant task assign-
ments (see Section 4).
(4) We deploy iCrowd on AMT and conduct extensive ex-
periments on two real datasets. Experimental results show
that iCrowd achieves 10% - 20% improvemen t on accuracy
compared with state-of-the-art approaches (see Section 6).
2. AN OVERVIEW OF ADAPTIVE CROWD-
SOURCING
2.1 Problem Statement
Microtasks. Consider a requester who publishes a set of
microtasks T = {t
1
,t
2
,...t
m
}.Foreaseofpresentation,
each microtask is a binary microtask with YES/NO choices.
Note that our techniques can be extended to microtasks with
more than two choices. Table 1 provides twelve microtasks
for entity resolution.Eachmicrotaskwantsworkerstoverify
whether two records (in the second column) are matched as
asameproductmodel. Forexample,t
1
requires workers
to verify whether “iphone 4 WiFi 32GB”and“iphone four
3G black”are duplicated models. The worker, who has been
assigned with t
1
,wouldanswerYES if she agrees that they
are the same product, or NO otherwise.
Worke rs. AsetofworkersW = {w
1
,w
2
,...,w
n
} will work
on microtasks in T .Notethatworkersetincrowdsourcing
is dynamic:anyexistingworkermaybecomeinactive by
stopping work on T while new workers may become active.
Moreover, since workers are prone to errors [22], answers
provided by them may not be always correct. To predic-
twhetheraworkercancorrectlyansweramicrotask,we
introduce accuracy defined as below.
Definition 1 (Accuracy). The accuracy of a worker
w ∈Won a microtask t
i
∈T,denotedbyp
w
i
,istheproba-
bility p
w
i
= Pr{w correctly answers t
i
}.
For simplicity, we use vector p
w
= {p
w
1
,p
w
2
,...,p
w
|T |
} to
represent the accuracies of w on microtasks in T .
Microtask Assignment. In crowdsourcing, to improve the
quality, a microtask is usually assigned to multiple workers
and its result is obtained via a voting scheme. Under this
scheme, we assign a microtask t
i
to a worker set W
t
i
⊂W
with size k,wherek is an assignment size to represent the
number of w orkers that can be assigned with t
i
. k is usual-
ly provided by the crowdsourcing requester. Given worker
set W
t
i
,weutilize(weighted)majorityvoting,whichiswell
accepted in many crowdsourcing approaches [11, 32, 7]. For
ease of presentation, this paper considers the simple major-
ity voting where k is an odd number. If more than or equal
评论