<!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>Computing Neighbourhoods with Language Models in a Collaborative Filtering Scenario</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Daniel Valcarce</string-name>
          <email>daniel.valcarce@udc.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Javier Parapar</string-name>
          <email>javierparapar@udc.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Álvaro Barreiro</string-name>
          <email>barreiro@udc.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Retrieval Lab Computer Science Department University of A Coruña</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Language models represent a successful framework for many Information Retrieval tasks: ad hoc retrieval, pseudo-relevance feedback or expert finding are some examples. We present how language models can compute effectively user or item neighbourhoods in a collaborative filtering scenario (this idea was originally proposed in [14]). The experiments support the applicability of this approach for neighbourhoodbased recommendation surpassing the rest of the baselines. Additionally, the computational cost of this approach is small since language models have been efficiently applied to large-scale retrieval tasks such as web search.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The goal of a recommender systems is to present relevant items to the users.
Given the increasing amount of information, recommendation techniques have
become crucial since they are able to alleviate the problem of information
overload. These systems learn from the data provided by the users in order to satisfy
their information needs.</p>
      <p>
        Several approaches to recommendation have been proposed [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. In particular,
this work is focused on neighbourhood-based collaborative filtering techniques.
Collaborative filtering aims to recommend items exploiting the past
interaction between users and data [
        <xref ref-type="bibr" rid="ref4 ref6">6,4</xref>
        ]. These models are based on the wisdom of the
crowds because items are considered as black boxes: they only rely on the
historical data of the users of the system to generate recommendations. Collaborative
filtering approaches can be divided in two main families: neighbourhood-based
(or memory-based) methods [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and model-based methods [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Instead of learning
a predictive model from the data (as model-based methods do),
neighbourhoodbased approaches directly employ part of the interactions of the users to compute
tailored suggestions. The main advantage of these models is their efficiency since
they do not usually require a training phase. However, they are based on groups
of users or items called user and item neighbourhoods, respectively. The most
common approach to calculate neighbourhoods is based on k-NN algorithm. This
technique assigns each user (or item) the k most similar users (or items)
according to a pairwise similarity metric (popular choices are Pearson’s correlation
coefficient and cosine similarity) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Previous work has studied that different
similarities perform very differently on the top-N recommendation task [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
(1)
(2)
2
      </p>
      <p>
        Computing Neighbourhoods using Language Models
Language models (LM) have been extensively applied to several tasks within
the Information Retrieval field [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. The first use of these models in retrieval was
proposed by Ponte and Croft when they presented the query likelihood model
to rank documents in the ad hoc retrieval task [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Additionally, they have been
used for other tasks such as query expansion via pseudo-relevance feedback (e.g.,
relevance-based language models [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) or expert finding [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>Language models are a formal approach that models a probability
distribution over the occurrences of words. Given a query, documents are ranked as
follows:</p>
      <p>
        p(djq) ra=nk p(d) p(qjd) = p(d) Y p(tjd)c(t;d)
where the document prior p(d) is usually considered uniform. The probability
p(tjd) is estimated using a smoothed maximum likelihood estimate [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>
        Following a recent and successful line of research of adapting Information
Retrieval techniques to the recommendation [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref7">7,12,11,10,13</xref>
        ], language models have
been adapted the occurrences of ratings on user or item profiles [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Instead of
inferring a language model for each document in the collection, we can
formulate a language model for each user or item in the collection. In this way, the
similarity between the user u and a candidate neighbour v can be measured as:
t2q
p(vju) ra=nk p(v) p(ujv) = p(v) Y
      </p>
      <p>
        p(ijv)ru;i
i2Iu
where Iu are the items rated by user u and ru;i is the rating that the user u
gave to the item i. The item-based similarity can be derived analogously. The
conditional probabilities p(ijv) are computed using a smoothing method over
the maximum likelihood estimate of a multinomial distribution [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] with the
probability in the collection p(ijC). Table 1 describes these methods.
      </p>
      <p>Method</p>
      <p>
        Expresion
Using Weighted Sum Recommender (WSR [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]), a very simple and effective
neighbourhood-based top-N recommender, we compare the three estimations
of language models for computing neighbourhoods against Pearson and cosine
similarities in terms of ranking accuracy (measured with nDCG@10). Also, we
used RM1Sim [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] as a user-based baseline. We tested the user-based approach
on the MovieLens 100k dataset1 and the item-based approach on the R3-Yahoo!
collection2. Figure 1 shows the results of the experiments.
      </p>
      <p>Cosine similarity is the strongest baseline while Pearson’s correlation
coefficient performs very poorly. However, with the appropriate parameter tuning,
Jelinek-Mercer and Dirichlet Priors methods can outperform cosine. Since the
R3-Yahoo! dataset is more sparse than MovieLens 100k, we need to put a higher
amount of smoothing to obtain good results. Additionally, the computational
complexity of these methods is linear in the size of the user (or item) profiles
which is the same as cosine or Pearson’s.
4</p>
    </sec>
    <sec id="sec-2">
      <title>Conclusions and Future Work</title>
      <p>
        We have presented how language models can compute user or item
neighbourhoods in a collaborative filtering scenario. Using Jelinek-Mercer and Dirichlet
Priors smoothing methods, we can outperform all the baselines. Additionally,
this approach is efficient and can make use of inverted indexes and other data
structures used in Information Retrieval to deal with large-scale scenarios. We
have used a uniform estimate for the user and item priors. However, it would be
interesting to explore other estimates since prior probabilities have been
recognised as a useful way of improving recommendation quality [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
1 https://grouplens.org/datasets/movielens
2 https://webscope.sandbox.yahoo.com/catalog.php?datatype=r
Acknowledgments. This work was supported by the Ministerio de Economía
y Competitividad of the Goverment of Spain and FEDER Funds under the
research project TIN2015-64282-R. The first author also wants to acknowledge
the support of Ministerio de Educación, Cultura y Deporte of the Government
of Spain under the grant FPU014/01724.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Krisztian</given-names>
            <surname>Balog</surname>
          </string-name>
          , Leif Azzopardi, and Maarten de Rijke.
          <article-title>A Language Modeling Framework for Expert Finding</article-title>
          . Inf. Process. Manage.,
          <volume>45</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Alejandro</given-names>
            <surname>Bellogín</surname>
          </string-name>
          , Javier Parapar, and
          <string-name>
            <given-names>Pablo</given-names>
            <surname>Castells</surname>
          </string-name>
          .
          <article-title>Probabilistic Collaborative Filtering with Negative Cross Entropy</article-title>
          .
          <source>In Proceedings of the 7th ACM Conference on Recommender Systems, RecSys '13</source>
          , pages
          <fpage>387</fpage>
          -
          <lpage>390</lpage>
          , New York, NY, USA,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Paolo</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          , Yehuda Koren, and
          <string-name>
            <given-names>Roberto</given-names>
            <surname>Turrin</surname>
          </string-name>
          .
          <article-title>Performance of Recommender Algorithms on Top-N Recommendation Tasks</article-title>
          . In RecSys '
          <volume>10</volume>
          , pages
          <fpage>39</fpage>
          -
          <lpage>46</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Yehuda</given-names>
            <surname>Koren</surname>
          </string-name>
          and
          <string-name>
            <given-names>Robert</given-names>
            <surname>Bell</surname>
          </string-name>
          .
          <article-title>Advances in Collaborative Filtering</article-title>
          . In Francesco Ricci, Lior Rokach, and Bracha Shapira, editors,
          <source>Recommender Systems Handbook</source>
          , pages
          <fpage>77</fpage>
          -
          <lpage>118</lpage>
          . Boston, MA, 2nd edition,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Victor</given-names>
            <surname>Lavrenko</surname>
          </string-name>
          and
          <string-name>
            <given-names>W. Bruce</given-names>
            <surname>Croft</surname>
          </string-name>
          .
          <article-title>Relevance-Based Language Models</article-title>
          .
          <source>In SIGIR '01</source>
          , pages
          <fpage>120</fpage>
          -
          <lpage>127</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Xia</given-names>
            <surname>Ning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Christian</given-names>
            <surname>Desrosiers</surname>
          </string-name>
          , and
          <string-name>
            <given-names>George</given-names>
            <surname>Karypis</surname>
          </string-name>
          .
          <article-title>A Comprehensive Survey of Neighborhood-Based Recommendation Methods</article-title>
          . In Francesco Ricci, Lior Rokach, and Bracha Shapira, editors,
          <source>Recommender Systems Handbook</source>
          , pages
          <fpage>37</fpage>
          -
          <lpage>76</lpage>
          . 2nd edition,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Javier</given-names>
            <surname>Parapar</surname>
          </string-name>
          , Alejandro Bellogín, Pablo Castells, and
          <string-name>
            <given-names>Álvaro</given-names>
            <surname>Barreiro</surname>
          </string-name>
          .
          <article-title>Relevance-Based Language Modelling for Recommender Systems</article-title>
          . Inf. Process. Manage.,
          <volume>49</volume>
          (
          <issue>4</issue>
          ):
          <fpage>966</fpage>
          -
          <lpage>980</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Jay</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ponte</surname>
            and
            <given-names>W. Bruce</given-names>
          </string-name>
          <string-name>
            <surname>Croft</surname>
          </string-name>
          .
          <article-title>A Language Modeling Approach to Information Retrieval</article-title>
          .
          <source>In SIGIR '98</source>
          , pages
          <fpage>275</fpage>
          -
          <lpage>281</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Francesco</given-names>
            <surname>Ricci</surname>
          </string-name>
          , Lior Rokach, and
          <string-name>
            <given-names>Bracha</given-names>
            <surname>Shapira</surname>
          </string-name>
          .
          <source>Recommender Systems Handbook. 2nd edition</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Valcarce</surname>
          </string-name>
          .
          <article-title>Exploring Statistical Language Models for Recommender Systems</article-title>
          . In RecSys '
          <volume>15</volume>
          , pages
          <fpage>375</fpage>
          -
          <lpage>378</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. Daniel Valcarce, Javier Parapar, and
          <string-name>
            <given-names>Álvaro</given-names>
            <surname>Barreiro</surname>
          </string-name>
          .
          <article-title>A Study of Priors for Relevance-Based Language Modelling of Recommender Systems</article-title>
          . In RecSys '
          <volume>15</volume>
          , pages
          <fpage>237</fpage>
          -
          <lpage>240</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. Daniel Valcarce, Javier Parapar, and
          <string-name>
            <given-names>Álvaro</given-names>
            <surname>Barreiro</surname>
          </string-name>
          .
          <article-title>A Study of Smoothing Methods for Relevance-Based Language Modelling of Recommender Systems</article-title>
          .
          <source>In ECIR '15</source>
          , volume
          <volume>9022</volume>
          , pages
          <fpage>346</fpage>
          -
          <lpage>351</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. Daniel Valcarce, Javier Parapar, and
          <string-name>
            <given-names>Álvaro</given-names>
            <surname>Barreiro</surname>
          </string-name>
          .
          <article-title>Efficient Pseudo-Relevance Feedback Methods for Collaborative Filtering Recommendation</article-title>
          .
          <source>In ECIR '16</source>
          , pages
          <fpage>602</fpage>
          -
          <lpage>613</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. Daniel Valcarce, Javier Parapar, and
          <string-name>
            <given-names>Álvaro</given-names>
            <surname>Barreiro</surname>
          </string-name>
          .
          <article-title>Language Models for Collaborative Filtering Neighbourhoods</article-title>
          .
          <source>In ECIR '16</source>
          , pages
          <fpage>614</fpage>
          -
          <lpage>625</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>ChengXiang</given-names>
            <surname>Zhai</surname>
          </string-name>
          .
          <article-title>Statistical Language Models for Information Retrieval</article-title>
          .
          <source>Synthesis lectures on human language technologies</source>
          .
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>