<!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>PIR based on Explicit and Implicit Feedback</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alberto Andreu-Mar n</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fernando Javier Martinez-Santiago</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Manuel Carlos D az-Galiano</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>L. Alfonso Uren~a-Lopez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Intelligent System for Information Access (SINAI) Advanced Studies Center in Information and Communication Technologies (CEATIC) Universidad de Jaen</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Our research aim is twofold: the rst one is to get leverage from the relevance feedback that the user provides over the course of every search session. In this way, we explore PIR task as a text categorization problem in order to distinguish between relevant and not relevant documents for the given user. A number of supervised machine learning algorithms has been applied in order to accomplish this task. The second one is related to implicit feedback. More concisely, time spent reading documents and text complexity. From the point of view of text complexity, we propose the hypothesis that there are signi cant di erences of perplexity between judged/non-judged documents by the user. We nd some weak statistical evidence that points out that high perplexity and judged documents are correlated.</p>
      </abstract>
      <kwd-group>
        <kwd>Personalised Information Retrieval (PIR) back implicit feedback language models perplexity</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Information Retrieval (IR) is a discipline that involves the retrieval of certain
information within a document collection based on speci c information needs[
        <xref ref-type="bibr" rid="ref2">12,
2</xref>
        ]. The widespread use of IR Systems by a large part of the population, in
addition to the huge amount of data generated daily, requires knowledge of the
speci c information requirements of users. The evaluation that a user makes of
a proposed result is personal [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], this can be expressed either explicitly (giving
his/her opinion, the so-called relevance judgments) or implicitly (analyzing the
behavior while interacting with the system). In addition, it is desirable to
obtain a knowledge base about the preferences of each user in order to adapt the
proposed results.
      </p>
      <p>The subject of this paper concerns task 2 of the PIR-CLEF laboratory. The
challenge in this work is to use the les provided by the organization (csv1
csv5) to create user pro les that can be used to improve the quality of the
results provided by an IR System. Both explicit and implicit data can be found
in these les, although certain characteristics can be inferred from the former.</p>
      <p>This entire process involves the development of a Personalized Information
Retrieval system (PIR) based on a number of explicit and implicit feedbacks
such as user document relevance assessments, search logs including timestamps
of every action, and ranking of documents as a result of every search performed
by the user.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Explicit and implicit feedback</title>
      <p>
        Two di erent types of input data sources are usually identi ed in the
scienti c literature: implicit and explicit feedback [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Speci cally, explicit feedback
refers to a conscious assessment given by the user indicating the relevance of
a document retrieved for a query. On the other hand, in the implicit feedback,
the information must be inferred according to the data that could be collected
about the user's behavior when interacting with the system (navigation logs,
task description, eyes tracking, etc.).
      </p>
      <p>When implicit feedback is used for the development of this type of system,
there may be uncertainty when interpreting the results. To this end, an attempt
will be made to nd some kind of correlation between the implicitly inferred
information and the explicit evaluation given by the user.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Experiments and results</title>
      <p>In this section, we present the di erent actions that we have accomplished in our
participation in CLEF PIR 2018 Task 2 Evaluation of Personalised Information
Retrieval.
3.1</p>
      <sec id="sec-3-1">
        <title>Feature extraction from retrieved web pages</title>
        <p>Firstly, data acquisition has been accomplished to retrieve the Clueweb
documents that each user evaluated as a result of the execution of each of them [11].
For this rst step, the attribute \query text" belonging to the le csv2.csv
provided by the organization is used. A query result is made of the rst one hundred
documents obtained using the API provided by the organisation and developed
by the University of Dublin1, each of which contains an attribute called "id",
which is used to download the corresponding web page using page rendering of
Clueweb12 data-set online services2.</p>
        <p>Secondly, once the corresponding web pages are downloaded we move on to
the pre-processing phase:
- Only the text contained in the labels \title" and \p" (paragraph) has been
considered.
- The resulting text has been processed by eliminating stop words and by
executing the Porter stemming algorithm.
1 http://clueweb.adaptcentre.ie/WebSearcher/search?query=\query</p>
        <p>
          String"&amp;selection=[selection numbers separated by comma] (last visited:
30/05/2018)
2 https://www.lemurproject.org/clueweb12/services.php (last visited: 30/05/2018)
- Every document is represented as a set of tokens made by unigrams, bigrams
and trigrams.
- TF.IDF has been calculated for each token belonging to each of the di erent
user categories [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. This determines how relevant this term is in the category.
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Explicit feedback as text categorization</title>
        <p>
          Relevance Feedback is a well-known technique in the eld of information
retrieval. The idea behind relevance feedback is to take the results that are initially
returned from a given query, to gather user feedback, and to use information
about whether or not those results are relevant to perform a new query [12].
On the other hand, methods based on supervised machine learning are the most
frequent approach to accomplish the task of text Categorization [
          <xref ref-type="bibr" rid="ref8">8, 13</xref>
          ]. In this
section, we face the PIR task as a text categorization task where the categories
are the user relevance judgments for every query and a set of retrieved
documents. Thus, we do not perform a new query as usual when relevance feedback is
applied. Instead of that, we train a number of supervised machine learning
algorithms by using features extracted from every document (Section 3.1). The main
hypothesis that we want to explore is whether the subjective and non-expert
relevance judgments provided for each user are valid to de ne document categories.
A second hypothesis is to validate the set of features extracted from the retrieved
documents. A nal hypothesis regards with the number of examples (judged
documents) provided for each user and query: is this number high enough to train
some of the most popular supervised machine learning algorithms?
        </p>
        <p>
          As a consequence, a number of supervised machine learning algorithms have
been trained using the user relevance judgments, characterizing each of the
documents based on sequences of n grams (Unigrams, Bigrams and Trigrams)
extracted from the texts and using the bag of words method, which allows us to
represent documents ignoring the order of the words that make it up.
3.2.1 Results. In order to evaluate our approach, we have followed a k-fold
cross-validation approach with k = 10 [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] where applicable. In addition we have
implemented both a ne-grained and a coarse-grained text categorization task.
For the rst one, on one hand, we distinguish four categories in the same way the
relevance of the document to the topic (1 o -topic, 2 not relevant, 3 somewhat
relevant, 4 relevant). On the other hand, The coarse-grained text categorization
task is a binary classi er with two categories only: relevant (categories 3 and 4)
and non-relevant documents (categories 1 and 2).
        </p>
        <p>The results obtained in Table 1 represent the success rates of the classi ers
in the test phase. These data must be analyzed from the perspective of the
problems presented by the classi cation algorithms used. In this case, not all
users present su cient or su ciently good data to con rm the results presented.</p>
        <p>For experiments with 4 categories (1-2-3 and 4), 10-fold cross-validation can
only be accomplished for user 02, user 11, user 15 and user 07 in the Books
topic only. This is because many of the samples provided by the organization
are not representative enough to perform cross-validation up to 10 folds. In
general, it can be said that, when it is possible to de ne 10-fold, explicit feedback
gets systematically results whose performance improvement (47% on average) is
statistically signi cant when considering random values as case base. For the
rest of the users, the results presented have been obtained by applying a smaller
number of folds because some of the samples are unbalanced.</p>
        <p>In the case of coarse-grained experiments, with 2 categories, it has not been
possible to balance the evaluation values in any of the cases, the reference values
taken to check the result of the classi ers remain the same as in the case of 4
categories. It can be seen that all cases the success rates of the classi ers increase
by around 15% with respect to ne-grained results.</p>
        <p>The best result is obtained by user 17 and Books as topic. The reason is that
this case is extremely unbalanced: 128 of a total of 133 documents are judged as
o -topic or not relevant.</p>
        <p>Regarding the best classi er, it is not possible to select the best one since
this depends on the user and topic. This suggests that a voting strategy could
be a good option as future work.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Implicit feedback</title>
        <p>
          Consider our rst approximation to Personal Information Retrieval, we have
focused on two di erent issues regarding implicit feedback [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], where various
search logs are collected and analyzed to infer attitudes with the aim to assess
the relevance of certain items indirectly through a users actions and behaviours.
More concisely we are focused in two main hypothesis based on timing and
statistics language models.
3.3.1 The time spent on a page. Based on the information in the data set
provided by the organization, it is intended to make use of the time spent by
each user evaluating each document. This experiment aims to demonstrate the
hypothesis that the time the user spends evaluating a result is related to the
interest generated by the content of the website. This is a quite controversial
issue nding evidence that supports this hypothesis [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] or not at all [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
        </p>
        <p>Suddenly, there is no way to be sure about the time spent on a page just by
using the search logs provided by the PIR-CLEF organization since there is no
timestamps about close document events. Even though this drawback we have
tried to accomplish a study to correlate timing and user assessments.
Consequently, we interpreted the time spent on a page as the di erence between two
consecutive open document events, start session and open document event or
open document and end session event. The next step we tested is whether this
sequence of time periods follows a normal sequence. Thus, we apply a
ShapiroWilk test for each user search log. In addition, we eliminated time periods that
are out the two central percentiles 25, with the aim of removing anomalous time
periods. We nd that the most of time distributions are not normal even though
ltering anomalous data. Finally, we applied a two tailed Student T-Test for
those cases where normality is found. For the rest of cases, we applied
MannWhitney-Wilcoxon.</p>
        <p>
          In the end of this process we have to conclude that, in general and following
the procedure described above, it is not possible to reject the null hypothesis:
user document judgments and time spent on a page are correlated.
3.3.2 Investigating the relationship between language model
perplexity and user relevance measures. The canonical measure of goodness
of a statistical language model is normally reported in terms of perplexity: the
exponential of the negative normalized predictive likelihood under the model,
and gives an indication of the expected word error rate as in speech recognizers
[
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. This nds some evidence that the perplexity of the language model has a
systematic relationship with the achievable precision recall performance by using
traditional Information Retrieval systems. Following this nding, we
hypothesize that for a given probabilistic language model, there is signi cant di erences
between the perplexity of the set of documents that are evaluated by the user
and those documents that are not evaluated.
        </p>
        <p>We used trigram language models with interpolated Kneser-Kney discounting
trained using the SRI language modeling toolkit [14]. We generated di erent
models by varying the training corpus.</p>
        <p>
          { Simple-wiki [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]: 137K sentence Simple English Wikipedia articles.
{ Sphinx-70k: CMUSphinx US English generic acoustic model3. this is the
most general language model that we have considered. This is the best suited
to represent the English language.
{ ClueWeb12 search: List of documents retrieved by using every set of queries
related for each topic. ClueWeb12 search service provided by the organization
was applied in order to retrieve the 100 rst ranked documents. Note that we
have a di erent language model for each topic proposed in the PIR-CLEF
dataset.
        </p>
        <p>The perplexity of three sets of documents per each user query was measured:
the set of relevant documents (user relevance judgment is 3 or 4), non-relevant
documents (user relevance judgment is 1 or 2) and unjudged documents (there
is no user relevance judgment in spite of they are part of the ranked list of
documents retrieved)</p>
        <p>Finally, an one-tailed Mann-Whitney-Wilcoxon (MWW) test was performed4.
When language models based on Simple-wiki and ClueWeb12 search datasets are
applied we have no found any signi cative di erence between the perplexity of
the the three set of documents considered (relevant, non-relevant or unjudged)
When Sphinkx-70k is used to train the language model, we nd some evidence
that the complexity of judged documents (relevant or not relevant) are greater
than those that are unjudged (U-value=59, critical U-value at p&lt;0,05=51). This
is quite surprising since it could be interpreted in the way that the user tends to
evaluate the most complex texts. Once we revise some of the non-judged
document we nd that it is quite frequent that these documents do not have textual
content at all, only lists of sections, menus and stylesheets but no or very little
meaningful text.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion and Future Work</title>
      <p>In this work, an overview has been given of the use of explicit and implicit
feedback for the generation of user pro les. In the case of explicit feedback,
a classi cation system is trained based on the user's judgements of relevance
provided for a given set of documents. In the case of implicit feedback, the
intention is to seek a correlation between the information that can be inferred
from the data and the relevance judgments provided by users, so that user pro les
and system accuracy can be improved.</p>
      <p>In future work it would be interesting to have information relevant to certain
aspects. The le csv6.csv provided by the organization, shows the TF.IDF
3 https://sourceforge.net/projects/cmusphinx/ les/Acoustic and Language
Models/US
4 When the dataset is small, the P-Value from t-Student is likely to be the most usual
test but it requires a normal distribution of the dataset. For this reason, we applied
Shapiro-Wilk test that is suited for small datasets and we found that it is not always
possible to assert that the considered datasets follow a normal distribution. As a
consequence we applied a non-parametric test, the Mann-Whitney-Wilcoxon U test
values of the tokenized terms, it would be interesting to be able to relate each
of these terms with the document to which it belongs, in this way, they could
be used for the realization of the training phase characterization of web pages.</p>
      <p>On the other hand, in order to search for a correlation between the interest
that an user has in a web page and the time he spends visiting it, it would
be interesting to have the \CLOSE DOCUMENT" attribute of all the records.
Currently there are only 5 records with this attribute in the csv2.csv le.</p>
      <p>In order to further deepen this task, it would be helpful to have the traditional
expert judgements of relevance. In this way, relationships could be sought in
those cases in which the user did not agree with the expert and try to discern
the most probable cause.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>Work supported by a grant from the Ministry of Education, Culture and Sport
(MECD-Scholarship BES-2016-076609) and the REDES project
(TIN2015-65136C2-1-R) of the Spanish Government.
11. Pasi, G., Jones, G.J., Marrara, S., Sanvitto, C., Ganguly, D., Sen, P.: Evaluation
of personalised information retrieval at clef 2017 (pir-clef): towards a reproducible
evaluation framework for pir
12. Salton, G., Buckley, C.: Improving retrieval performance by relevance feedback.</p>
      <p>Journal of the American society for information science 41(4), 288{297 (1990)
13. Sebastiani, F.: Machine learning in automated text categorization. ACM
computing surveys (CSUR) 34(1), 1{47 (2002)
14. Stolcke, A.: Srilm-an extensible language modeling toolkit. In: Seventh
international conference on spoken language processing (2002)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Azzopardi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Girolami</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>van Risjbergen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Investigating the relationship between language model perplexity and ir precision-recall measures</article-title>
          .
          <source>In: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval</source>
          . pp.
          <volume>369</volume>
          {
          <fpage>370</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Baeza-Yates</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ribeiro-Neto</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , et al.:
          <article-title>Modern information retrieval</article-title>
          , vol.
          <volume>463</volume>
          . ACM press New York (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Claypool</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wased</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brown</surname>
          </string-name>
          , D.:
          <article-title>Implicit interest indicators</article-title>
          .
          <source>In: Proceedings of the 6th international conference on Intelligent user interfaces</source>
          . pp.
          <volume>33</volume>
          {
          <fpage>40</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Coster</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kauchak</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Simple english wikipedia: a new text simpli cation task</article-title>
          .
          <source>In: Proceedings of the 49th Annual</source>
          <article-title>Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers-Volume 2</article-title>
          . pp.
          <volume>665</volume>
          {
          <fpage>669</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Galarza</given-names>
            <surname>Quishpe</surname>
          </string-name>
          , E.D.:
          <article-title>Text Classi cation for literature search of research study designs</article-title>
          .
          <source>Master's thesis</source>
          , Australia/Universidad de Melbourne (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Janes</surname>
            ,
            <given-names>J.W.</given-names>
          </string-name>
          :
          <article-title>Other people's judgments: A comparison of users' and others' judgments of document relevance, topicality, and utility</article-title>
          .
          <source>Journal of the American Society for Information science 45(3)</source>
          ,
          <volume>160</volume>
          (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Jannach</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lerche</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zanker</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Recommending based on implicit feedback</article-title>
          .
          <source>In: Social Information Access</source>
          , pp.
          <volume>510</volume>
          {
          <fpage>569</fpage>
          . Springer (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Joachims</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Text categorization with support vector machines: Learning with many relevant features</article-title>
          .
          <source>In: European conference on machine learning</source>
          . pp.
          <volume>137</volume>
          {
          <fpage>142</fpage>
          . Springer (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Kohavi</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , et al.:
          <article-title>A study of cross-validation and bootstrap for accuracy estimation and model selection</article-title>
          .
          <source>In: Ijcai</source>
          . vol.
          <volume>14</volume>
          , pp.
          <volume>1137</volume>
          {
          <fpage>1145</fpage>
          . Montreal, Canada (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Morita</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shinoda</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Information ltering based on user behavior analysis and best match text retrieval</article-title>
          .
          <source>In: SIGIR94</source>
          . pp.
          <volume>272</volume>
          {
          <fpage>281</fpage>
          . Springer (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>