<!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>Exploiting Pooling Methods for Building Datasets for Novel Tasks</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Retrieval Lab Department of Computer Science University of A Coruña</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Information Retrieval is not any more exclusively about document ranking. Continuously new tasks are proposed on this and sibling ifelds. With this proliferation of tasks, it becomes crucial to have a cheap way of constructing test collections to evaluate the new developments. Building test collections is time and resource consuming: it requires time to obtain the documents, to define the user needs and it requires assessors to judge a lot of documents. To reduce the latest, pooling strategies aim to decrease the assessment efort by presenting to the assessors a sample of documents in the corpus with the maximum number of relevant documents in it. The quality of these collections is also crucial, as the value of any evaluation depends on it. In this article, we propose the design of a system for building test collections easily and cheaply by implementing state-of-the-art pooling strategies and simulating competition participants with diferent retrieval models and query variants. We aim to achieve flexibility in terms of adding new retrieval models and pooling strategies to the system. We want the platform also to be useful to evaluate the obtained collections.</p>
      </abstract>
      <kwd-group>
        <kwd>Information retrieval</kwd>
        <kwd>Test collections</kwd>
        <kwd>Pooling</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        In Information Retrieval, under the Cranfield paradigm, test collections are the
most widely used method for evaluating the efectiveness of new systems [15].
These test collections consist of a set of documents, the information needs
(topics), and the relevance judgments indicating which documents are relevant to
those topics [15]. Collections play a vital role in the process of providing
measures to compare the efectiveness of diferent retrieval models and techniques
[14]. However, they are complex and expensive to construct [
        <xref ref-type="bibr" rid="ref12 ref4">4, 12</xref>
        ]. Some
collections of general purpose, such as the ones developed in TREC1, NTCIR2
and CLEF3, are very useful resources for the evaluation of established tasks,
but sometimes research teams need to build their own test collection within a
specific domain [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        When building new collections, it is essential to consider their quality. This
aspect is crucial, as they are going to be used to evaluate new developments,
and the value of this evaluation depends on it. One common problem is to have
biased relevance judgments that unfairly rank some models, as Buckley et al. did
observe in TREC AQUAINT 2005 Task [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], or to produce non-discriminative
results among systems [13]. Because of this, it is important to have a way of
evaluating the collections built.
      </p>
      <p>Nowadays, with the huge growth in the number of novel tasks, it would
be convenient to have a cheap way of building the evaluation datasets. When
creating an evaluation collection, the most straightforward approach to obtain
the relevance judgments is to judge the documents as they are retrieved from
the data source. This is a very expensive process because it requires a lot of
time from the assessors, as typically they judge many documents that end up
not being relevant. This process can be alleviated by using pooling techniques.</p>
      <p>
        Pooling is a well-known approach to extract a sample of documents from the
entire document set [15]. Using this technique we avoid judging the entire corpus.
When using pooling methods we want to obtain the most complete and unbiased
set of relevant documents judged [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In community evaluation workshops like
TREC, pooling is commonly done over the systems sent by the participants, who
run their algorithms on the original dataset and send back their results. [15].
      </p>
      <p>In this article, we present the design of a platform to build test collections.
With this platform, we aim to tackle three problems: first, to have an easy and
cheap way of building the datasets by reducing the assessor’s work; second, to
build the most complete and the most unbiased collections that are efective
to measure and compare the efectiveness of diferent systems; finally, we focus
also on evaluation as we want the platform to be useful to compare diferent
combinations of retrieval models and pooling strategies to reduce the most of
the assessor’s work and to evaluate the quality of the obtained collections.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Background</title>
      <p>
        System evaluation has been a cornerstone in advance of IR. Building test
collections for evaluation is expensive, as it requires the work of human assessors
to produce relevance judgments. Pooling strategies aim to reduce this cost, as
they allow to build test collections much larger than with complete judgments
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Pooling allows researches to assume completeness over the judgments with a
reasonable degree of certainty. The assessor’s work is more profitable when they
mark a document as relevant. The documents that are not in the pool are
considered being non-relevant. On the other hand, for getting true complete judgments
assessors would judge the relevance of every document in the collection. If there
      </p>
      <sec id="sec-2-1">
        <title>3 http://www.clef-initiative.eu</title>
        <p>are many information needs (queries), they would have to assess the relevance
the whole set of documents with respect to every query.</p>
        <p>In pooled collections, only a subset –the pool– of the entire corpus is judged.
For each topic, the pool of documents is generally constructed by taking the
union of the top k –pool depth– documents retrieved by each participant systems,
called runs. When we have enough relevant documents in the pool, we can assume
that the rest of the documents are non-relevant. These obtained pools are then
assessed for relevance.</p>
        <p>
          When we apply pooling strategies, we want to obtain unbiased pools.
Unbiased means that the sample of relevant documents obtained does not favour any
of model, avoiding to unfairly rank some models over others. Another crucial
factor is that when an assessor is judging the obtained pool of documents, the
process in which documents are presented can introduce some type of bias to
the collection [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]
        </p>
        <p>
          Historically in TREC, assessors have judged the entire pool following an
arbitrary strategy, i.e., by DocID, but a lot of work and research has been done
in creating pooling algorithms that impose an order of evaluation intending to
reduce the assessment efort without harming the quality of the collection. In
particular, in TREC Common Core Track 2017 [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], NIST applied for the first
time a pooling algorithm based on Bayesian Bandits [
          <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
          ] which has been
demonstrated as an efective and unbiased pooling algorithm which improves
the state-of-the-art models.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Proposal</title>
      <p>In this paper, we present the design of a system for experimenting with the
creation of test collections. The main goal of the platform is to address the
problem of building test collections for novel tasks at afordable cost.</p>
      <p>The main contribution of this platform is that, instead of building the pools
with a runs-based approach, we build these systems by combining diferent query
variants and retrieval models. This free us of the need to wait for the
participants results. This is very convenient, for example, in competitions where the
organizers have to release training data to the participants.</p>
      <p>The functionality of our system can be seen from two perspectives: one from
the system manager, whose function is to define the user information needs, that
are manually created but in a future this process can be automated, and select
the retrieval models and the pooling strategies; the second one from an assessor,
whose work is to judge the relevance of the documents presented to him.</p>
      <p>In Figure 1, we can see an overview of the workflow of the platform: the two
roles of the system, the system manager –the competition organizer– and the
assessor, along with their tasks.</p>
      <p>First of all, the platform allows the manager to create diferent jobs, each one
to produce a diferent collection with its corresponding information needs and
relevance assessments. Diferent types of collections can be built: for example, a
multi-topic dataset in which the manager defines one information need per topic;
System
manager
1. Create
new job
2. Add  user
information needs
3. Select retrieval models
4. Select pooling strategy
6. Evaluate quality
of the collection
7. Export collection</p>
      <p>Assessor
Collection
5. Make relevance
judgments
another example is a classification style dataset, in which the manager defines
the criteria for the positive cases of each class.</p>
      <p>There are two options to obtain the set of documents: the system can use
an of-line static collection or can use an API to retrieve documents from an
external data source. At this initial stage, we have developed the components to
consume documents from the Reddit API. We aim to expand the platform to
more data sources soon. We also aim to make the platform flexible to allow the
manager to choose among both ofline data and diferent APIs freely.</p>
      <p>In TREC-like competitions, each participant sends the results of one or more
systems. These results –the runs– are used to build the pool with the top k
documents from each system. We propose to build the pool before having runs
for participant systems. Here the role of the runs will be played by diferent query
variants and retrieval strategies that the manager can choose to be associated to
the job. The top k documents from the runs produced by multiple combinations
of query variant and retrieval strategies are used to build the pool.</p>
      <p>
        Our system will allow the manager to select among diferent
state-of-theart pooling strategies to present the documents to the assessors, such as MTF
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and Multi-armed bandits [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. The function of the assessors is to judge
the documents that are presented to them to build the set of judgments of the
dataset. Finally, with the documents retrieved, the topics file and the judgments
made by the assessors, the platform allows exporting the final collection.
      </p>
      <p>This platform is designed in such a way that is easy to implement and add
new retrieval algorithms as well as new pooling strategies. The platform will also
be used to analyse the obtained collections. The system will allow the analysis
of the diferent desired properties for a fair evaluation of systems. We want
to analyse the combinations of diferent simulated participants and diferent
pooling strategies in terms of relevant document found at a given budget and
the quality of those judgments. The main goal is to reduce the needed time
to build the collections drastically. This is achieved by reducing the time that
assessor wastes judging non-relevant documents and by allowing faster retrieval
of the documents.
3.1</p>
      <p>Pilot Task: CLEF eRisk
CLEF eRisk4 is an initiative organized with the objective of evaluating the
effectiveness of methodologies and metrics for the early detection of risks on the
Internet, especially those related to health, such as depression, anorexia or
selfinflicted harm. For this purpose, collections of texts written by users on social
networks are released annually. The lab is mainly oriented to assist advisors
who perform diagnoses on users of social networks, as well as to evaluate the
efectiveness of diferent models when building new collections.</p>
      <p>
        Previous tasks have focused on the detection of depression (20175) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], as
well as the detection of anorexia and depression (20186) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The task of 2019
is about anorexia, depression and self-inflicted harm [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. This lab will serve as
pilot task for our systems. We plan to use the platform to build the collections
that will be used in the competition in 2020.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions and Future Work</title>
      <p>
        Building cheap and good test collections is crucial for evaluation. We have seen
that obtaining the human judgments of these collections is a time and resource
consuming task. There are another risks associated with this task: we may end
up building collections that have some bias [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] or with incomplete judgments.
      </p>
      <p>In this paper, we have presented the design of an approach whose aim is to
tackle those aspects. Our main goal was to have a cheap way of building these
datasets by making the most of the assessor’s work. We had to leverage that
objective with the build of high-quality collections that are complete in terms of
judgments and, at the same time, unbiased. It was also essential for us to design
a flexible platform to include new models and pooling strategies.</p>
      <sec id="sec-4-1">
        <title>4 http://erisk.irlab.org 5 https://early.irlab.org/2017 6 https://early.irlab.org/2018</title>
        <p>This work opens an interesting line of future research, which is to compare the
quality and usefulness of collections built from participants runs with collections
built with other techniques like our approach.</p>
        <p>Acknowledgments. This work was supported by projects
RTI2018-093336-BC22 (MCIU/ERDF) and GPC ED431B 2019/03 (Xunta de Galicia/ERDF) and
accreditation ED431G/01 (Xunta de Galicia/ERDF). I also would like to thank
Daniel Valcarce, Javier Parapar and Álvaro Barreiro for their advise on this
work.
13. Lu, X., Mofat, A., Culpepper, J.S.: The Efect of Pooling and Evaluation Depth
on IR Metrics. Inf. Retr. 19(4), 416–445 (Aug 2016)
14. Sanderson, M.: Test Collection Based Evaluation of Information Retrieval Systems.</p>
        <p>Foundations and Trends® in Information Retrieval (2010)
15. Voorhees, E.M., Harman, D.K.: TREC: Experiment and Evaluation in Information
Retrieval (Digital Libraries and Electronic Publishing). The MIT Press (2005)</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Allan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kanoulas</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gysel</surname>
            ,
            <given-names>C.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Voorhees</surname>
            ,
            <given-names>E.M.:</given-names>
          </string-name>
          <article-title>TREC 2017 Common Core Track Overview</article-title>
          .
          <source>In: Proceedings of The Twenty-Sixth Text REtrieval Conference</source>
          , TREC 2017, Gaithersburg, Maryland, USA, November
          <volume>15</volume>
          -
          <issue>17</issue>
          ,
          <year>2017</year>
          . vol. Special Pu.
          <source>NIST</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Buckley</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimmick</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soborof</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Voorhees</surname>
          </string-name>
          , E.:
          <article-title>Bias and the limits of pooling for large collections</article-title>
          .
          <source>Information Retrieval</source>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cormack</surname>
            ,
            <given-names>G.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palmer</surname>
            ,
            <given-names>C.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clarke</surname>
            ,
            <given-names>C.L.A.</given-names>
          </string-name>
          :
          <article-title>Efficient construction of large test collections</article-title>
          .
          <source>In: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          . pp.
          <fpage>282</fpage>
          -
          <lpage>289</lpage>
          . SIGIR '98,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Kanoulas</surname>
          </string-name>
          , E.:
          <article-title>Building Reliable Test and Training Collections in Information Retrieval</article-title>
          .
          <source>Ph.D. thesis</source>
          , Boston, MA, USA (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kuriyama</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kando</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nozue</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eguchi</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Pooling for a Large-Scale Test Collection: An Analysis of the Search Results from the First NTCIR Workshop</article-title>
          . Inf. Retr.
          <volume>5</volume>
          (
          <issue>1</issue>
          ),
          <fpage>41</fpage>
          -
          <lpage>59</lpage>
          (
          <year>Jan 2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Losada</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>A Test Collection for Research on Depression and Language Use</article-title>
          . In: Experimental IR Meets Multilinguality, Multimodality, and Interaction. pp.
          <fpage>28</fpage>
          -
          <lpage>39</lpage>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Losada</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parapar</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>CLEF 2017 eRisk overview: Early Risk prediction on the internet: Experimental foundations</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Losada</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parapar</surname>
          </string-name>
          , J.:
          <source>Overview of eRisk</source>
          <year>2018</year>
          :
          <article-title>Early Risk Prediction on the Internet (extended lab overview)</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Losada</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parapar</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Early Detection of Risks on the Internet: An Exploratory Campaign</article-title>
          .
          <source>In: Proceedings of the 41st European Conference on Information Retrieval</source>
          . pp.
          <fpage>259</fpage>
          -
          <lpage>266</lpage>
          . ECIR '
          <volume>19</volume>
          , Springer, Cologne, Germany (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Losada</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parapar</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Barreiro, Á.:
          <article-title>Feeling Lucky?: Multi-armed Bandits for Ordering Judgements in Pooling-based Evaluation</article-title>
          .
          <source>In: Proceedings of the 31st Annual ACM Symposium on Applied Computing</source>
          . pp.
          <fpage>1027</fpage>
          -
          <lpage>1034</lpage>
          . SAC '16,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Losada</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parapar</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barreiro</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>: Multi-armed bandits for adjudicating documents in pooling-based evaluation of information retrieval systems</article-title>
          .
          <source>Information Processing and Management</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Losada</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parapar</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barreiro</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Cost-efective Construction of Information Retrieval Test Collections</article-title>
          .
          <source>In: Proceedings of the 5th Spanish Conference on Information Retrieval</source>
          . pp.
          <volume>12</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          :
          <fpage>2</fpage>
          . CERI '18,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>