<!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>Pursuing a Moving Target: Iterative Use of Benchmarking of a Task to Understand the Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Maria Eskevich</string-name>
          <email>m.eskevich@let.ru.nl</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gareth J. F. Jones</string-name>
          <email>gjones@computing.dcu.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Robin Aly</string-name>
          <email>r.aly@ewi.utwente.nl</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roeland Ordelman</string-name>
          <email>ordelman@ewi.utwente.nl</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Benoit Huet</string-name>
          <email>Benoit.Huet@eurecom.fr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ADAPT Centre, School of Computing, Dublin City University</institution>
          ,
          <country country="IE">Ireland</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>EURECOM</institution>
          ,
          <addr-line>Sophia Antipolis</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Radboud University</institution>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>University of Twente</institution>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <fpage>20</fpage>
      <lpage>21</lpage>
      <abstract>
        <p>Individual tasks carried out within benchmarking initiatives, or campaigns, enable direct comparison of alternative approaches to tackling shared research challenges and ideally promote new research ideas and foster communities of researchers interested in common or related scienti c topics. When a task has a clear prede ned use case, it might straightforwardly adopt a well established framework and methodology. For example, an ad hoc information retrieval task adopting the standard Cran eld paradigm. On the other hand, in cases of new and emerging tasks which pose more complex challenges in terms of use scenarios or dataset design, the development of a new task is far from a straightforward process. This letter summarises our re ections on our experiences as task organisers of the Search and Hyperlinking task from its origins as a Brave New Task at the MediaEval benchmarking campaign (2011{2014) to its current instantiation as a task at the NIST TRECVid benchmark (since 2015). We highlight the challenges encountered in the development of the task over a number of annual iterations, the solutions found so far, and our process for maintaining a vision for the ongoing advancement of the task's ambition.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        Benchmark evaluation campaigns have become a key
activity within a broad range of information processing
disciplines, having demonstrated their critical impact on the
elds' scienti c progress especially for the information
retrieval research community [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Individual benchmark tasks
within these campaigns facilitate direct comparison of
alternative approaches to speci c technical challenges, encourage
scienti c innovation and, perhaps less obviously, enable
understanding of what the task actually is. This last point is
signi cant in the sense that the goal of a task can often be
viewed as a \moving target" over successive (usually annual)
iterations of the task. This situation arises over the period
in which the task is active as the task organisers come to
better understand what the task is seeking to achieve as a
result of working to address questions raised by speci cation
of the task itself, development of task datasets, the task
participants feedback, and evaluation and analysis of the task
results. In this letter we provide a brief review of our
experiences of multiple iterations of the Search and Hyperlinking
task developed within the MediaEval benchmark campaigns.
2.
      </p>
    </sec>
    <sec id="sec-2">
      <title>SEARCH AND HYPERLINKING AT ME</title>
    </sec>
    <sec id="sec-3">
      <title>DIAEVAL</title>
      <p>
        Our idea to de ne and shape an exploration of Search
and Hyperlinking (S&amp;H) through a benchmarking activity
initially emerged from a diverse combination of reasons. A
number of varied and challenging large scale multimedia
data archives relevant to such a task were already becoming
available, while the constantly increasing and diverse
deluge of new multimedia content being produced, stored and
shared by both non-, semi- and professionals meant that
there was a compelling motivation to explore methods to
search and manage this content. At the same time,
scienti c advances had reached the stage where algorithms with
the potential to address more creative tasks that could
encompass known-item and ad hoc retrieval of speci c parts of
content, as well as personalised collection exploration, were
becoming available. Embarking on this adventure was also
appealing since various aspects of the overall S&amp;H task had
already been investigated or tested in smaller scale tasks,
e.g. the MediaEval 2011 Rich Speech Retrieval (RSR) Task
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and the VideoCLEF 2009 Linking Task [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
3.
      </p>
    </sec>
    <sec id="sec-4">
      <title>FROM A BRAVE NEW TASK TO A BRAVE</title>
    </sec>
    <sec id="sec-5">
      <title>NEW WORLD</title>
      <p>From a starting point of a use case for a new task, the
development of an actual benchmark activity often appears
straightforward. However, this is often not the case, and
once the task organisers begin to operationalize their ideas
technical and practical challenges begin to emerge. This
means that the task released to the participants is generally
a technical and practical compromise, often containing
hidden questions that the task organisers are unable to answer
based on their current understanding of the user behaviour
model or technical issues of the task. Thus the current
instance of a task can itself be designed to answer these
questions in order to move the task forward towards its ultimate
research goals by exploiting better use case de nition and
representation in a subsequent version of the task.</p>
      <p>
        The S&amp;H tasks were a classic example of this situation.
Once we began to examine the scope of what the task
required in terms of speci cation and implementation, we
realised that there were many questions to be addressed in
order to fully understand the task itself and how it should
best be implemented to benchmark the usability of its
outputs and the algorithmic contributions of the participants'
solutions. The activity thus began as a relatively small scale
Brave New Task at MediaEval 2011 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The key issue
addressed in the rst iteration was the exploration of the
potential of crowdsourcing technologies for the query creation
stage for a given collection and for the ground truth de
nition [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Setting up a task, that we envisaged as inspired by
users' potential interests and request creation, we wanted to
engage the real users in both task de nition and evaluation.
      </p>
      <p>In subsequent years the task received the status of a Main
Task, meaning that we were able to gather a group of core
participants (at least ve) who expressed their interest in
participating each year. Being a Main Task did not mean
that the task de nition and evaluation were set in stone, and
thus, we kept experimenting with the collection, the type of
users and their requests, evaluation metrics each year.</p>
      <p>
        In 2014, we felt that the innovative Video Hyperlinking
subtask within the S&amp;H task had reached a good level of
maturity in terms of task infrastructure, i.e., task de nition
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], data availability and evaluation procedure [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], but there
were still many questions unanswered in terms of addressing
the algorithmic challenges of the task. We therefore sought
the opportunity to increase participation and the range of
scienti c input by o ering the task at TRECVid 2015,
subsequently accepted by the TRECVid chairs [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>Although we took the task to another venue, where most
of the evaluation is usually done by NIST experts, we
adhered to the crowdsourcing anchor creation and evaluation
procedures that were established within our MediaEval
activities. This approach preserved our exibility in terms of
the creativity of the task de nition, and we kept our
commitment to have users involved at all stages of benchmarking.</p>
    </sec>
    <sec id="sec-6">
      <title>4. ITERATIVE TASK EVOLUTION</title>
      <p>Traditionally, well established tasks with a
straightforward scenario follow a pattern of gradually growing their
dataset with each year iteration, using the same evaluation
metric or a set of metrics, sometimes running the same
software on the revised dataset, in order to be able to carry out
direct comparison between the technology performance over
the years. In the case of a more exploratory and innovative
task, that is being developed through collaboration and
feedback with participants, the same broad user scenario can be
tested under di erent conditions, e.g. diverse target users
of the potentially developed approaches, di erent data sets
and evolving evaluation metrics that cover aspects of the
task that could not have been foreseen beforehand.</p>
      <p>When the task is de ned by a clear use case scenario
existing within an industrial set up, the task can be promoted by
these industrial partners via data provision and help with
the on-site evaluation. As our research focus is on large
video archives that are not always created and gathered with
a clear monetization strategy in mind, often aiming at
cultural heritage preservation (without prede ned usage
scenarios), we were more free in de ning the framework. The
feedback from the crowdworkers helped us to test algorithms
addressing the task in a fast iterative way.</p>
      <p>
        Another aspect that has to be taken into account when
setting up a task with a large data collection in mind is
the copyright question. When the task is in its initial early
development stage, it is easier to use a Creative Commons
dataset to initially test the task feasibility. This proof of
concept of the task viability allows the organisers to
demonstrate the soundness of the overall framework, and thus to
engage potential industry partners. This was the case for
the S&amp;H task that started with the BlipTV collection [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ],
and then switched to a BBC dataset [
        <xref ref-type="bibr" rid="ref2 ref3">3, 2</xref>
        ]. However, the
usage of professionally created and copyright material also
makes the task more dependent on the external partners
and liable to all potential changes of the legal status of the
data. Overall, the opportunity to run the task with di erent
datasets enriches the discussion of the scienti c approaches.
      </p>
      <p>On the other hand, crowdsourcing of the task de nition
and results evaluation keeps the focus of the task on the user,
and allows us to relate the scienti c methods under test
to the current users technology expectations. This brings
a practical insight into the impact of the performance
improvements in algorithms on user experience. In a way, the
workers become part of the organisers team, i.e., the task,
although being envisaged by the scientists, is nally shaped
and vetted by the real users.
5.</p>
    </sec>
    <sec id="sec-7">
      <title>THE VIEW FROM A NEW HOME</title>
      <p>Having run the task already for two years at the TRECVid
benchmark, we can compare our experiences and outline the
di erences. At both venues at the initial stage of the yearly
cycle, the tasks get feedback from the overall benchmark
organisers committee in terms of task feasibility and interest
within the targeted scienti c community. However, during
the yearly cycle of actually running the task, within the
MediaEval campaign the organisers of all the tasks are aware
of task progress, raising issues and sharing their solutions via
bi-weekly conference calls. This is especially helpful, when
tasks are sharing the datasets, or when they are being run
for the rst time and the organisers lack experience.</p>
      <p>As organisers of a creative novel task, we found that
interaction within the community of task organisers and with the
actual task participants proved to be very useful to enable us
to react quickly to any issues arising with the task, from the
data release to submissions and evaluation release. However,
TRECVid allows organisers to delegate some organisational
activities to the NIST, thus saving time.</p>
      <p>Running the benchmarking task requires a lot of
commitment from the organisers, and an interest and engagement
of the scienti c community. In our experience, the
growing cycle in terms of interest and participation in the S&amp;H
task coincided with a number of related projects funded at a
time which also meant that the ending of the funding cycle
a ected the number of participants, while the actual
scienti c ndings and discussions were still on an upwards path.
The move to the TRECVid allowed us to involve large labs
and companies that often participate in this venue.</p>
    </sec>
    <sec id="sec-8">
      <title>6. SUMMARY FUTURE OUTLOOK</title>
      <p>
        We have presented the evolution of the S&amp;H task to date.
Despite operating at two benchmarking venues, future
challenges remain, with the most critical issue being
sustainability [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. While research is often bound to projects of nite
length, the organization of tasks should ideally be able to
continue independent of these. This is challenging in
particular in terms of human resources and technical resources.
      </p>
    </sec>
    <sec id="sec-9">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work has been partially supported by: ESF Research
Networking Programme ELIAS; BpiFrance within the
NexGenTV project, grant no. F1504054U; Science Foundation
Ireland (SFI) as a part of the ADAPT Centre at DCU
(13/RC/2106); EC FP7 project FP7-ICT 269980 (AXES).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Aly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J. F.</given-names>
            <surname>Jones</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Linking inside a video collection: what and how to measure?</article-title>
          <source>In Proceedings of the 22nd International World Wide Web Conference (WWW '13)</source>
          , Companion Volume, pages
          <volume>457</volume>
          {
          <fpage>460</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J. F.</given-names>
            <surname>Jones</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N. E. O'</given-names>
            <surname>Connor</surname>
          </string-name>
          .
          <article-title>An Investigation into Feature E ectiveness for Multimedia Hyperlinking</article-title>
          . In MultiMedia Modeling - 20th
          <source>Anniversary International Conference (MMM</source>
          <year>2014</year>
          ), Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          , pages
          <volume>251</volume>
          {
          <fpage>262</fpage>
          , Dublin, Ireland,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Aly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. N.</given-names>
            <surname>Racca</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G. J. F.</given-names>
            <surname>Jones</surname>
          </string-name>
          .
          <article-title>The Search and Hyperlinking Task at MediaEval 2014</article-title>
          .
          <source>In Working Notes Proceedings of the MediaEval 2014 Workshop</source>
          , Barcelona, Catalunya, Spain,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J. F.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          .
          <article-title>Creating a Data Collection for Evaluating Rich Speech Retrieval</article-title>
          .
          <source>In Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC</source>
          <year>2012</year>
          ), pages
          <fpage>1736</fpage>
          {
          <fpage>1743</fpage>
          , Istanbul, Turkey,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Hopfgartner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanbury</surname>
          </string-name>
          , H. Muller,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kando</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mercer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kalpathy-Cramer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gollub</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krithara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Balog</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. Eggel.</surname>
          </string-name>
          <article-title>Report on the Evaluation-as-a-</article-title>
          <string-name>
            <surname>Service (EaaS) Expert</surname>
          </string-name>
          <article-title>Workshop</article-title>
          . SIGIR Forum,
          <volume>49</volume>
          (
          <issue>1</issue>
          ):
          <volume>57</volume>
          {
          <fpage>65</fpage>
          ,
          <year>June 2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Ko er</article-title>
          , S. Schmiedeke, and
          <string-name>
            <given-names>G. J. F.</given-names>
            <surname>Jones</surname>
          </string-name>
          .
          <article-title>Overview of MediaEval 2011 Rich Speech Retrieval Task and Genre Tagging Task</article-title>
          .
          <source>In Working Notes Proceedings of the MediaEval 2011 Workshop</source>
          , Santa Croce in Fossabanda, Pisa, Italy,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          , E. Newman, and
          <string-name>
            <given-names>G. J. F.</given-names>
            <surname>Jones</surname>
          </string-name>
          . Overview of VideoClef 2009:
          <article-title>New Perspectives on Speech-based Multimedia Content Enrichment</article-title>
          .
          <source>In Proceedings of the 10th International Conference on Cross-language Evaluation Forum: Multimedia Experiments, CLEF'09</source>
          , pages
          <fpage>354</fpage>
          {
          <fpage>368</fpage>
          , Berlin, Heidelberg,
          <year>2010</year>
          . Springer-Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R. J. F.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Aly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Huet</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G. J. F.</given-names>
            <surname>Jones</surname>
          </string-name>
          .
          <article-title>De ning and Evaluating Video Hyperlinking for Navigating Multimedia Archives</article-title>
          . In A. Gangemi,
          <string-name>
            <given-names>S.</given-names>
            <surname>Leonardi</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A</surname>
          </string-name>
          . Panconesi, editors,
          <source>Proceedings of the 24th International Conference on World Wide Web Companion (WWW</source>
          <year>2015</year>
          ), Companion Volume, pages
          <volume>727</volume>
          {
          <fpage>732</fpage>
          ,
          <string-name>
            <surname>Florence</surname>
          </string-name>
          , Italy,
          <year>2015</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Over</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fiscus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Joy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Michel</surname>
          </string-name>
          , G. Awad,
          <string-name>
            <given-names>W.</given-names>
            <surname>Kraaij</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. F.</given-names>
            <surname>Smeaton</surname>
          </string-name>
          , G. Quenot, and
          <string-name>
            <surname>R. Ordelman. TRECVID</surname>
          </string-name>
          <year>2015</year>
          {
          <article-title>an overview of the goals, tasks, data, evaluation mechanisms and metrics</article-title>
          .
          <source>In Proceedings of TRECVID</source>
          <year>2015</year>
          .
          <article-title>NIST</article-title>
          , USA,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Schmiedeke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Ferrane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Ko er, M. A</article-title>
          .
          <string-name>
            <surname>Larson</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Esteve</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Lamel</surname>
            ,
            <given-names>G. J. F.</given-names>
          </string-name>
          <string-name>
            <surname>Jones</surname>
            , and
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Sikora</surname>
          </string-name>
          .
          <article-title>Blip10000: a social video dataset containing SPUG content for tagging and retrieval</article-title>
          .
          <source>In Multimedia Systems Conference 2013 (MMSys '13)</source>
          , pages
          <fpage>96</fpage>
          {
          <fpage>101</fpage>
          , Oslo, Norway,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C. V.</given-names>
            <surname>Thornley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Johnson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. F.</given-names>
            <surname>Smeaton</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Lee</surname>
          </string-name>
          .
          <article-title>The scholarly impact of trecvid (2203 {</article-title>
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <source>Journal of the American Society for Information Science and Technology</source>
          ,
          <volume>62</volume>
          (
          <issue>4</issue>
          ):
          <volume>613</volume>
          {
          <fpage>627</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>