<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>SQUARE: Benchmarking Crowd Consensus at MediaEval</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Aashish Sheshadri</string-name>
          <email>aashishs@cs.utexas.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matthew Lease</string-name>
          <email>ml@ischool.utexas.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, The University of Texas at Austin</institution>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Information, The University of Texas at Austin</institution>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <fpage>18</fpage>
      <lpage>19</lpage>
      <abstract>
        <p>We extend the square benchmark for statistical consensus methods to include additional evaluation on two datasets from the MediaEval 2013 Crowdsourcing in Multimedia shared task. In addition to reporting shared task results, we also analyze qualitatively and quantitatively performance of consensus algorithms under varying supervision.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>ALGORITHMS</p>
      <p>
        We extend square1 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], a benchmark for evaluating
statistical consensus algorithms, to include additional
evaluation on two datasets from MediaEval 2013 Crowdsourcing
in Multimedia shared task2. Algorithms are briefly
summarized below; the square paper [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] provides more detailed
discussion and comparative analysis. Because
crowdsourcing allows rapid generation of datasets for new tasks, where
no feature representation of inputs or automatic labeling
algorithm may yet exist, we intentionally exclude hybrid
methods requiring automatic label generation from features.
      </p>
      <p>
        Majority Voting (MV) uses random tie-breaking to avoid
bias in absence of an informative prior for tie-breaking.
ZenCrowd (ZC) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] implements unsupervised EM to jointly
estimate worker accuracies and labels. GLAD [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] implements
unsupervised EM to jointly estimate labels and worker
expertise while modeling example difficulty. Dawid-Skene (DS) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
and Raykar et al. (RY) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] implement unsupervised EM to
jointly estimate labels and worker confusion matrices, with
RY differing from DS in modeling individual worker priors.
Naive Bayes (NB) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] implements a fully supervised
estimation of worker confusion. CUBAM [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]’s unsupervised MAP
estimation jointly models example difficulty and annotator
specific measurements of noise, expertise and bias.
      </p>
      <p>
        DATA AND EXPERIMENTAL SETUP
Data. Consensus algorithms are evaluated on the MMSys
2013 and the test fraction (20%) of Fashion 10000. Both
datasets elicit binary judgments on the same set of tasks
from Amazon Mechanical Turk (AMT) workers. Task 1 asks
workers to identify an image as being fashion-related or not,
and Task 2 asks workers to indicate whether or not a desired
fashion object is present. For further details of tasks, see [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
1ir.ischool.utexas.edu/square
2www.multimediaeval.org/mediaeval2013/crowd2013
s
r
e
k
r
o
W
fo MMSys 2013 Task 2
%
      </p>
      <p>MMSys 2013 Task 2
Accuracy
% of Questions
“Gold” data is defined for these tasks by majority voting of
trusted annotators over examples with a clear majority label.</p>
      <p>
        Experiment. Following the same benchmarking
procedure as in SQUARE [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], we consider 5 degrees of
supervision: 10%, 20%, 50%, 80%, and 90%. In each case, we use
cross-fold validation, i.e. for the 10% supervision setting,
estimation uses 10% train data and is evaluated on the
remaining 90%, this procedure is repeated across the other
nine folds, finally, average performance across the folds is
reported. We report unsupervised performance on 100% of
data, with evaluation limited to examples with gold labels.
      </p>
      <p>In the unsupervised setting, uninformed, task-independent
hyper-parameters and class priors are unlikely to be
optimal. While one might optimize these parameters by
maximizing likelihood over random restarts or grid search, we
do not attempt to do so. Instead, with light-supervision,
we assume no examples are labeled, but informative priors
are provided (matching the training set empirical
distribution). Full-supervision assumes gold-labeled examples are
provided. To evaluate ZC, RY, DS and GLAD methods
under full-supervision, labels are predicted for all examples
(without supervision) but replaced by gold on training data.
3.</p>
      <p>RESULTS AND DISCUSSION</p>
      <p>MMSys 2013. Average performance over Tasks 1 and 2
are reported in Table 1. We highlight best scoring methods
but note these are not necessarily statistically significant.</p>
      <p>Results show close to constant performance (roughly
91MV
ZC
NB
DS
RY</p>
      <p>Acc
F1
Acc
F1
Acc
F1
Acc
F1
Acc
F1
Acc
F1
Acc
F1
92%) across methods, metrics, and varying supervision.
Average accuracy of 91.17% across methods, with minimal
variance, is perhaps not surprising given the abundance of high
quality workers for these tasks (see Figure 1 for details). We
hypothesize three key factors. 1. the response redundancy
is limited at most three, with many instances recording only
two responses (since workers could select ‘not sure’ rather
than provide a binary judgment). 2. a high percentage of
the work was completed by relatively small percentage of the
workers (Figure 1). 3. Consistently high worker accuracies
limit the value of weighted worker voting vs. simple MV.</p>
      <p>We further observe task 1 and 2 to be highly correlated.
Table 2 shows the confusion matrix of gold labels across the
two tasks. Evaluation on Task 2 using Task 1 gold labels for
supervision achieved 82.89% average accuracy and 84.98%
average F1 across methods. This presents a possibility of
joint estimation we do not investigate.</p>
      <p>Fashion 10000. Table 3 reports F1 scores on the test
fraction of Fashion 10000; since gold data was not available
for the blind shared task, we only present results estimated
with no supervision. MV is seen to score best on Task 1, and
CUBAM on Task 2. This contrasts findings on MMSys 2013,
though we still observe only a 1% threshold across methods
on Task 1. However, Task 2 shows markedly superior
performance of CUBAM, which remains to be investigated.
Acknowledgments. This work is supported by National
Science Foundation grant IIS-1253413 and by a Temple
Fellowship. Opinions expressed in this work are those of the
authors and do not reflect views of the sponsors.</p>
      <p>M V</p>
      <p>ZC
GLAD</p>
      <p>DS</p>
      <p>RY
CU BAM</p>
      <p>Task 1</p>
      <p>Task 2</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Dawid</surname>
          </string-name>
          and
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Skene</surname>
          </string-name>
          .
          <article-title>Maximum likelihood estimation of observer error-rates using the em algorithm</article-title>
          .
          <source>Applied Statistics</source>
          , pages
          <fpage>20</fpage>
          -
          <lpage>28</lpage>
          ,
          <year>1979</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>G.</given-names>
            <surname>Demartini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Difallah</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Cudr´</surname>
          </string-name>
          e-Mauroux.
          <article-title>Zencrowd: leveraging probabilistic reasoning and crowdsourcing techniques for large-scale entity linking</article-title>
          .
          <source>In Proc. WWW</source>
          , pages
          <fpage>469</fpage>
          -
          <lpage>478</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>B.</given-names>
            <surname>Loni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bozzon</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Gottlieb</surname>
          </string-name>
          . Crowdsourcing for Multimedia at MediaEval 2013:
          <article-title>Challenges, datasets, and evaluation</article-title>
          . In MediaEval 2013 Workshop, Barcelona, Spain, October
          <volume>18</volume>
          -19
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>V. C.</given-names>
            <surname>Raykar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. H.</given-names>
            <surname>Zhao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G. H.</given-names>
            <surname>Valadez</surname>
          </string-name>
          .
          <article-title>Learning from crowds</article-title>
          .
          <source>In Journal of Machine Learning Research</source>
          <volume>11</volume>
          (
          <year>2010</year>
          )
          <fpage>1297</fpage>
          -
          <lpage>1322</lpage>
          , MIT Press,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sheshadri</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Lease</surname>
          </string-name>
          .
          <article-title>SQUARE: A Benchmark for Research on Computing Crowd Consensus</article-title>
          .
          <source>In Proceedings of the 1st AAAI Conference on Human Computation (HCOMP)</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Snow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. O</given-names>
            <surname>'Connor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jurafsky</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ng</surname>
          </string-name>
          .
          <article-title>Cheap and fast-but is it good?: evaluating non-expert annotations for natural language tasks</article-title>
          .
          <source>In Proceedings of the Conference on Empirical Methods in Natural Language Processing</source>
          , pages
          <fpage>254</fpage>
          -
          <lpage>263</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>Welinder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Branson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Belongie</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Perona</surname>
          </string-name>
          .
          <article-title>The multidimensional wisdom of crowds</article-title>
          .
          <source>In NIPS</source>
          , pages
          <fpage>2424</fpage>
          -
          <lpage>2432</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Whitehill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ruvolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bergsma</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Movellan</surname>
          </string-name>
          .
          <article-title>Whose vote should count more: Optimal integration of labels from labelers of unknown expertise</article-title>
          .
          <source>In NIPS</source>
          , pages
          <fpage>2035</fpage>
          -
          <lpage>2043</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>