Accurate inference of crowdsourcing properties when using efficient allocation strategies

HIGHLIGHTS

SUMMARY

    A crowd- sourcing problem consists of N tasks, each of which is considered a binary labeling task. The binary task model can also generalize to categorical tasks, but such tasks can always be binarized by treating the most common individual response as a ‘1` and all other responses as ‘0`. Let yij ∈ {0, 1} be the response of worker j ∈ to task i ∈, ai the total number of 1-labels for task i, bi the total number of 0-labels, and ni=ai + bi the total number of responses to i. Individual worker responses . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?