<!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>On the role of time and sessions in diversifying recommendation results (Extended Abstract)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vito W. Anelli</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vito Bellini</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tommaso Di Noia</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wanda La Bruna</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paolo Tomeo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eugenio Di Sciascio</string-name>
          <email>eugenio.disciasciog@poliba.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Polytechnic University of Bari</institution>
          ,
          <addr-line>Via Orabona, 4, 70125 Bari</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Intent-aware approaches to diversi cation have been proposed in the last years to provide the user with a list of recommendations covering di erent aspects of her behavior. In this paper, we present two diversi cation methods taking into account temporal aspects of the user pro le: in the rst one, in order to emphasize the importance of more recent items, we adopt a temporal decay function while in the second one we take into account temporal sessions. The two proposed methods have been implemented as temporal variants of the well-known xQuAD framework and tested against the Net ix 100M dataset.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Recommender systems are designed to meet the users' needs suggesting relevant
items in a personalized fashion. As recommendations are usually presented in
form of list or group, the user experience strongly depends on the overall
quality of such recommendations and, the diversity among them has been identi ed
as one of the most important quality factor [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The diversity issue has been
originally addressed in the Information Retrieval eld. As user queries are
often ambiguous and their intent is not clear, proposing a set of answers covering
di erent intents may increase the probability that users nd at least one
relevant document [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. The concept of intent-aware diversi cation has then been
applied to the Recommender Systems eld [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and extensively studied thus
producing new algorithms and evaluation metrics. Here, user intents as de ned
in Information Retrieval have been mapped to user interests with reference to
item characteristics. Very often, in the design of the model behind a
recommendation engine, the user pro le is considered as a static snapshot without
taking into proper account its temporal dimension. Actually, the importance of
analyzing temporal aspect for user modeling has been proved to a ect the nal
recommendation results [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>In this paper we investigate the e ect on the trade-o between accuracy and
diversity of a recommendation list when dealing with temporal aspects of the</p>
      <p>
        An extended version of this paper has been published in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
user pro le. The intuition behind our idea is that temporal dynamics might allow
to better understand the user interests with respect to the items characteristics
and then provide a more accurate intent-aware diversi cation. We present two
intent-based modeling methods that exploit the time dimension in a user pro le.
The rst one analyses the frequency of interaction between the users and the
items features using a temporal decay function in order to emphasize persistence
and recency of an intent. The other method is based of a new session analysis
technique of user ratings for intent modeling. Considering that a session is usually
de ned as a set of consecutive ratings with a very small gap of time among
them, we provided a wide de nition of session tailored for movie ratings. The
experimental results on the Net ix dataset demonstrated that the analysis of
temporal aspects in the user pro le leads to better accuracy-diversity balance and
intent-aware diversity compared to the original xQuAD. As an additional bene t,
the aggregate diversity results improved too thus demonstrating to produce more
personalized recommendations.
2
      </p>
      <p>
        Intent-aware diversi cation for recommendations with
temporal dynamics
Finding the most diverse results in a recommendation problem is a NP-hard
problem and hence several heuristics have been proposed [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. If we want to
provide the top-N best items S to the user u, the system originally computes
a list of top-K elements R (with K &gt; N ) with their associated ratings r (u; i)
and then re-ranks the list based on a given objective function. Most previous
diversi cation approaches are based on a greedy selection strategy which selects
the next most relevant item only if that item is diverse with respect to the items
already selected. For the purpose of this work, we consider xQuAD, one of the
most well-known intent-aware greedy heuristics. It maximizes the coverage of
the inferred interests while minimizing their redundancy. xQuAD was originally
proposed for search diversi cation in information retrieval by Santos et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
and, More recently, it has been adapted for recommendation diversi cation [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ],
replacing query and relative aspects with user and items features, respectively.
The expression of the xQuAD objective function is
(1)
(2)
fobj (i; S; u) =
r (u; i) + (1
) div(i; S; u)
with S representing the set of the items belonging to R not already in S and
div(i; S; u) de ned as
div(i; S; u) =
      </p>
      <p>X p(ijf; u) p(f ju)
f</p>
      <p>Y(1
j2S
p(jjf; u))
In (2) p(ijf; u) represents the likelihood of item i being chosen given the feature
f and is computed as a binary function that returns 1 if the item contains f , 0
otherwise; p(f ju) represents the interest of user u in the feature f and is usually
computed as the relative frequency of the feature f on the items rated by user
u. In other words, xQuAD fosters the idea of promoting items that are
simultaneously highly related to at least one of the features of interest for the user and
slightly related to the features of the items already recommended. In particular,
this work focuses on the intent modeling in the xQuAD framework, namely the
aforementioned p(f ju) component in the Equation (2). We now propose two
methods to exploit temporal analysis for intent modeling in diversi cation that
we call session-based and time-based intent modeling. Both relies on the
intuition that user intent can change during the interaction with the system and
evaluating the importance of a feature merely computing its frequency in the
user pro le may not represent the current user interests.</p>
      <p>Time-Based Intent Modeling. In order to valorize persistence and recency
of an intent, we propose to analyze the frequency of interaction between the user
u and the feature f and to weight each interaction by a temporal decay function.
More formally, the following formula computes the interest of the user u with
respect to the feature f :
p(f ju) =</p>
      <p>Pi2R(u) cov(f; i)disc(u; i)</p>
      <p>
        Pi2R(u) disc(u; i)
where R(u) indicates the set of rating provided by the user u; cov(f; i) is a binary
function returning 1 if the item i is associated with the feature f , 0 otherwise;
disc(i; u) is a temporal decay function returning lower values for older ratings,
and higher values for the most recent ones. Inspired by [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], as decay function we
adopted the following exponential function
disc(u; i) = e
jtu;last tu;ij
where tu;last indicates the timestamp of the last rating of the user u and tu;i the
timestamp when user u rated i; &gt; 0 controls the decay rate.
      </p>
      <p>Session-Based Intent Modeling. In our setting, in order to identify user
sessions we propose an EM clustering used to train two univariate Gaussian
Mixture Models (with equivariance and variable variance). The number of
clusters has been evaluated based on the Bayesian Information Criterion considering
the tted models with a number of clusters from 1 up to 300. In order to remove
outliers from each session s, for each computed cluster we do not consider ratings
falling outside the interval [ s s; s + s], with s and s being respectively
the mean and the standard deviation of ratings distribution for the session s.
Once user sessions are determined, they can be used to analyze the user
activities taking into account the temporal dynamics. In this work we present an
approach to model the users intents over time, by considering three key
properties: importance, persistence and recency of an intent among the user sessions.
The following formula computes the interest of the user u with respect to the
feature f :
p(f ju) =</p>
      <p>P
s2S(u) Pi2Ij(Fs)(sco)jv(f;i) disc(s; u)</p>
      <p>Ps2S(u) disc(s; u)
(3)
(4)
(5)
where S(u) indicates sessions computed for the user u; I(s) is the set of items in
s; cov(f; i) is a binary function returning 1 if the item i is associated with the
feature f, 0 otherwise; F (s) represents the set of features associated with all the
items in s; disc(s) is the temporal decay function adapted to handle the sessions
instead of the items, considering a session as an item in Equation (4) where the
session date is that of the last rated item in such session. As for the previous
case, value was set to 1/200.
3</p>
    </sec>
    <sec id="sec-2">
      <title>Experimental setting</title>
      <p>
        In order to verify our research questions and evaluate our proposal, we used the
popular movie datasets derived from the Net ix Prize Context [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and we tested
our approaches via a re-ranking of the BPRMF [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and BPRSLIM [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] algorithms
resulting recommendations. In our evaluation, the time-based and session-based
intent modelings proposed in Section 2 are used as alternatives to the pure
frequency based intent modeling in the original xQuAD. These two variations of
xQuAD, are denoted as: TB xQuAD, SB xQuAD, where TB stands for time-based
and SB for session-based.
      </p>
      <p>
        In order to evaluate accuracy, we measured nDCG. As for individual
diversity, namely the degree of dissimilarity among all items in the list provided to a
user, was measured by ERR-IA as it has been shown [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] to be the metric
targeted by xQuAD, while for aggregate diversity we computed the Catalog Coverage
(percentage of items recommended at least to one user). An evaluation on the
novelty of computed results has been done through EPC (Expected Popularity
Complement) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Our experiments show that the time-based variant of xQuAD
performs better than the session-based one but for Catalog Coverage where we
have better results for the session-based implementation of xQuAD. It is worth
noticing that the base version of xQuAD outperforms its time-based variants up
to a certain value of for both BPRMF and BPRSLIM. For the former this value lies
between 0.8 and 0.9 while for the latter between 0.7 and 0.8. Hence, in case we
are interested in higher values of diversity, time may play an important role. In
Table 1 we see that with = 0:8 we obtain the best result in terms of trade-o
among the various metrics we measured in our experiments.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>V. W.</given-names>
            <surname>Anelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Bellini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Di</given-names>
            <surname>Noia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. La</given-names>
            <surname>Bruna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Tomeo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E. Di</given-names>
            <surname>Sciascio</surname>
          </string-name>
          .
          <article-title>An analysis on time- and session-aware diversi cation in recommender systems</article-title>
          .
          <source>In Proceedings of the 25th Conference on User Modeling, Adaptation and Personalization</source>
          ,
          <source>UMAP '17</source>
          , pages
          <fpage>270</fpage>
          {
          <fpage>274</fpage>
          . ACM,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>J.</given-names>
            <surname>Bennett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lanning</surname>
          </string-name>
          , and
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>Net ix. The net ix prize</article-title>
          .
          <source>In In KDD Cup and Workshop in conjunction with KDD</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>N.</given-names>
            <surname>Koenigstein</surname>
          </string-name>
          , G. Dror, and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          .
          <article-title>Yahoo! music recommendations: Modeling music ratings with temporal dynamics and item taxonomy</article-title>
          .
          <source>In Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys '11</source>
          , pages
          <fpage>165</fpage>
          {
          <fpage>172</fpage>
          , New York, NY, USA,
          <year>2011</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          .
          <article-title>Collaborative ltering with temporal dynamics</article-title>
          .
          <source>In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09</source>
          , pages
          <fpage>447</fpage>
          {
          <fpage>456</fpage>
          , New York, NY, USA,
          <year>2009</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. O. Kucuktunc, E. Saule,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kaya</surname>
          </string-name>
          , and U. V.
          <article-title>Catalyurek. Diversifying citation recommendations</article-title>
          .
          <source>ACM Transactions on Intelligent Systems and Technology</source>
          ,
          <volume>5</volume>
          (
          <issue>4</issue>
          ):
          <volume>55</volume>
          :1{
          <fpage>55</fpage>
          :
          <fpage>21</fpage>
          ,
          <string-name>
            <surname>Dec</surname>
          </string-name>
          .
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>S. M.</given-names>
            <surname>McNee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          .
          <article-title>Being accurate is not enough: How accuracy metrics have hurt recommender systems</article-title>
          .
          <source>In CHI '06 Extended Abstracts on Human Factors in Computing Systems, CHI EA '06</source>
          , pages
          <fpage>1097</fpage>
          {
          <fpage>1101</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>X.</given-names>
            <surname>Ning</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Karypis</surname>
          </string-name>
          . Slim:
          <article-title>Sparse linear methods for top-n recommender systems</article-title>
          .
          <source>In Data Mining (ICDM)</source>
          ,
          <year>2011</year>
          IEEE 11th International Conference on, pages
          <volume>497</volume>
          {
          <fpage>506</fpage>
          . IEEE,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>S.</given-names>
            <surname>Rendle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Freudenthaler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Gantner</surname>
          </string-name>
          , and L.
          <string-name>
            <surname>Schmidt-Thieme</surname>
          </string-name>
          .
          <article-title>Bpr: Bayesian personalized ranking from implicit feedback</article-title>
          .
          <source>In Proceedings of the twenty- fth conference on uncertainty in arti cial intelligence</source>
          , pages
          <volume>452</volume>
          {
          <fpage>461</fpage>
          . AUAI Press,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>R.</given-names>
            <surname>Santos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Macdonald</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. Ounis.</surname>
          </string-name>
          <article-title>Exploiting query reformulations for web search result diversi cation</article-title>
          .
          <source>In WWW '10</source>
          , pages
          <fpage>881</fpage>
          {
          <fpage>890</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>S.</given-names>
            <surname>Vargas</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          .
          <article-title>Rank and relevance in novelty and diversity metrics for recommender systems</article-title>
          .
          <source>In Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys '11</source>
          , pages
          <fpage>109</fpage>
          {
          <fpage>116</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>S.</given-names>
            <surname>Vargas</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          .
          <article-title>Exploiting the diversity of user preferences for recommendation</article-title>
          .
          <source>In OAIR '13</source>
          , pages
          <fpage>129</fpage>
          {
          <fpage>136</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. S. Vargas,
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Vallet</surname>
          </string-name>
          .
          <article-title>Intent-oriented diversity in recommender systems</article-title>
          .
          <source>In Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '11</source>
          , pages
          <fpage>1211</fpage>
          {
          <fpage>1212</fpage>
          , New York, NY, USA,
          <year>2011</year>
          . ACM.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>