<!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>The Role of Emotions in Context-aware Recommendation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yong Zheng</string-name>
          <email>yzheng8@cs.depaul.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Robin Burke</string-name>
          <email>rburke@cs.depaul.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bamshad Mobasher</string-name>
          <email>mobasher@cs.depaul.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Center for Web Intelligence School of Computing, DePaul University Chicago</institution>
          ,
          <addr-line>Illinois</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <fpage>21</fpage>
      <lpage>28</lpage>
      <abstract>
        <p>Context-aware recommender systems try to adapt to users' preferences across different contexts and have been proven to provide better predictive performance in a number of domains. Emotion is one of the most popular contextual variables, but few researchers have explored how emotions take effect in recommendations especially the usage of the emotional variables other than the effectiveness alone. In this paper, we explore the role of emotions in context-aware recommendation algorithms. More specifically, we evaluate two types of popular context-aware recommendation algorithms - context-aware splitting approaches and differential context modeling. We examine predictive performance, and also explore the usage of emotions to discover how emotional features interact with those context-aware recommendation algorithms in the recommendation process. RecSys'13, October 12-16, 2013, Hong Kong, China. Paper presented at the 2013 Decisions@RecSys workshop in conjunction with the 7th ACM conference on Recommender Systems. Copyright c 2013 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.</p>
      </abstract>
      <kwd-group>
        <kwd>Recommendation</kwd>
        <kwd>Context</kwd>
        <kwd>Context-aware recommendation</kwd>
        <kwd>Emotion</kwd>
        <kwd>Affective recommender system</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        Advances in affective computing have enabled recommender
systems to take advantage of emotions and personality, leading to the
development of affective recommender systems (ARS) [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. At
the same time, the emerging technique of context-aware
recommender systems (CARS) takes contexts into consideration,
converting a two-dimensional matrix of ratings organized by user and item:
Users Items ! Ratings, into a multidimensional rating space [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
CARS have been demonstrated to be effective in a variety of
applications and domains [
        <xref ref-type="bibr" rid="ref10 ref13 ref15 ref24 ref4">4, 15, 10, 24, 13</xref>
        ]. Emotional variables are
often included as contexts in CARS, which enables the further
development of both ARS and CARS. Typical emotional contexts in
recommender system domain are the ones relevant to users’ subject
moods or feelings, for example, user mood when listening to music
tracks (e.g. happy, sad, aggressive, relaxed, etc) [
        <xref ref-type="bibr" rid="ref19 ref9">19, 9</xref>
        ], or users’
emotions after seeing a movie (e.g. user may feel sad after seeing
a tragic movie) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>
        Emotional context was first exploited by Gonzalez et al [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] for
the recommender system domain. This work was followed by
others [
        <xref ref-type="bibr" rid="ref13 ref17 ref18 ref9">9, 18, 13, 17</xref>
        ] considering emotions as contexts in CARS
research. While the effectiveness of emotions as contextual variables
is therefore well-established, there is little research that has
examined specifically the role that these emotional variables play. We
define "the role of emotions" as the concerns from two aspects –
whether emotions are useful or effective to improve
recommendation performance? And, the usage of emotions in the
recommendation process – how emotions are used in the recommendation
algorithms, e.g. which emotional variables are selected? which
algorithm components are they applied to? and so forth.
Currently, most research are focused on demonstrating the effectiveness of
emotional variables, and few research further explore the usage of
the emotions in the recommendation process.
      </p>
      <p>In this paper, we explore the role of emotions by two classes
of popular context-aware recommendation algorithms –
contextaware splitting and differential context modeling. Since both of
these approaches require that the algorithm learn the importance
and utility of different contextual features, they help reveal how
emotions work in each algorithm and what roles they can play in
recommendation.</p>
      <p>The purpose of this study is therefore to address the following
research questions:
1. Emotional Effect: Are emotions useful contextual variables
for context-aware recommendation?
2. Algorithm Comparison: What algorithms are best suited to
make use of emotional variables? Do they outperform the
baseline algorithms?
3. Usage of Contexts: How do emotional variables compete
with other contextual variables, such as location and time?
4. Roles: How can we understand the specific roles emotional
variables can play in those context-aware recommendation
algorithms?
2.</p>
    </sec>
    <sec id="sec-2">
      <title>RELATED WORK</title>
      <p>
        Gonzalez et al [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] explored emotional context in recommender
systems in 2007. They pointed out that,"emotions are crucial for
user’s decision making in recommendation process. The users always
transmit their decisions together with emotions." With the rapid
development of context-aware recommender systems, emotion turns
out to be one of important and popular contexts in different kinds
of domains, especially in the music and movie domain. For
music recommendation, the emotional context is appealing because it
can be used to establish a bridge between music items and
items from other different domains, and perform cross-media
recommendations [
        <xref ref-type="bibr" rid="ref1 ref6 ref9">6, 1, 9</xref>
        ]. Movie recommendation is another domain
where emotion turns out to be popular in recent years. In 2010,
Yue et al [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] produced the overall winner in a recent challenge
on context-aware movie recommendation by mining mood-specific
movie similarity with matrix factorization. More recent research
[
        <xref ref-type="bibr" rid="ref13 ref18">18, 13</xref>
        ] motivates the tendency of taking emotions as contexts
to assist contextual recommendations. Research has
demonstrated that emotions can be influential contextual variables in making
recommendations, but few of them explore how emotions interact
with recommendation algorithm – the usage of emotional variables
in the recommendation process.
      </p>
      <p>
        As described in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], there are three basic approaches to
develop context-aware recommendation algorithms: pre-filtering,
postfiltering, and contextual modeling. A pre-filtering approach applies
a context-dependent criterion to the list of items, selecting those
appropriate to a given context. Only the filtered items are
considered for recommendation. A post-filtering approach is similar
but applies the filter after recommendations have been computed.
Contextual modeling takes contextual considerations into the
recommendation algorithm itself. In this paper, we explore
contextaware splitting approaches (a class of pre-filtering algorithms), and
differential context modeling (a contextual modeling approach.)
      </p>
      <p>The remainder of this paper is organized as follows. In
Section 3 and Section 4, we formally introduce the two types of
recommendation algorithms we are studying, including their capability to
capture the role of emotional contexts in recommendation process.
Sections 5 and 6 discuss the experimental evaluations and mining
the role of emotions through those context-aware recommendation
algorithms, followed by the conclusions and future work in
Section 7.
3.</p>
    </sec>
    <sec id="sec-3">
      <title>CONTEXT-AWARE SPLITTING</title>
    </sec>
    <sec id="sec-4">
      <title>APPROACHES</title>
      <p>
        Contextual pre-filtering is popular as it is straightforward to
implement, and can be applied with most recommendation techniques.
Item splitting [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ] is considered one of the most efficient
prefiltering algorithms and it has been well developed in recent
research. The underlying idea of item splitting is that the nature of
an item, from the user’s point of view, may change in different
contextual conditions, hence it may be useful to consider it as
two different items [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. User splitting [
        <xref ref-type="bibr" rid="ref15 ref2">2, 15</xref>
        ] is based on a similar
intuition – it may be useful to consider one user as two different
users, if he or she demonstrates significantly different preferences
across contexts. In this section, we introduce those two approaches
and also propose a new splitting approach – UI splitting, a simple
combination of item and user splitting.
      </p>
      <p>To better understand and represent the splitting approaches,
consider the following movie recommendation example:
In Table 1, there are one user U 1, one item T 1 and two ratings
(the first two rows) in the training data and one unknown rating that
we are trying to predict (the third row). There are three contextual
dimensions – time (weekend or weekday), location (at home or
cinema) and companion (friend, girlfriend or family). In the following
discussion, we use contextual dimension to denote the
contextual variable, e.g. "Location" in this example. The term contextual
condition refers to a specific value in a contextual dimension, e.g.
"home" and "cinema" are two contextual conditions for "Location".
3.1</p>
    </sec>
    <sec id="sec-5">
      <title>Item Splitting</title>
      <p>
        Item splitting tries to find a contextual condition on which to split
each item. The split should be performed once the algorithm
identifies a contextual condition in which items are rated significantly
differently. In the movie example above, there are three
contextual conditions in the dimension companion: friend, girlfriend and
family. Correspondingly, there are three possible alternative
conditions: "friend and not friend", "girlfriend and not girlfriend",
"family and not family". Impurity criteria [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] are used to
determine whether and how much items were rated differently in these
alternative conditions, for example a t-test or other statistical
metric can be used to evaluate if the means differ significantly across
conditions.
      </p>
      <p>Item splitting iterates over all contextual conditions in each
context dimension and evaluates the splits based on the impurity
criteria. It finds the best split for each item in the rating matrix and
then items are split into two new ones, where contexts are
eliminated from the original matrix – it transforms the original
multidimensional rating matrix to a 2D matrix as a result. Assume that
the best contextual condition to split item T1 in Table 1 is
"Location = home and not home", T1 can be split into T11 (movie T1
being seen at home) and T12 (movie T1 being seen not at home).
Once the best split has been identified, the rating matrix can be
transformed as shown by Table 2(a).</p>
      <p>
        This example shows a simple split, in which a single contextual
condition is used to split the item. It is also possible to perform a
complex split using multiple conditions across multiple context
dimensions. However, as discussed in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], there are significant costs
of sparsity and potential overfitting when using multiple conditions.
We use only simple splitting in this work.
be transformed as shown by Table 2(b). The first two rows contain
the same user U 12 because U 1 saw this movie with others (i.e. not
family) rather than family as shown in the original rating matrix.
3.3
      </p>
    </sec>
    <sec id="sec-6">
      <title>UI Splitting</title>
      <p>UI splitting is a new approach proposed in this paper – it applies
item splitting and user splitting together. Assuming that the best
split for item and user splitting are the same as described above,
the rating matrix based on UI splitting can be shown as Table 2(c).
Here we see that both users and items were transformed, creating
new users and new items.</p>
      <p>
        Thus, given n items, m users, k contextual dimensions and d
distinct conditions for each dimension, the time complexity for those
three splitting approaches is the same as O(nmkd) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The
process in UI splitting is simply an application of item splitting
followed by user splitting on the resulting output. We keep the
contextual information in the matrix after the transformation by item
splitting so that user splitting can be performed afterwards.
3.4
      </p>
    </sec>
    <sec id="sec-7">
      <title>Role of Emotions in Splitting</title>
      <p>Context-aware splitting approaches have been demonstrated to
improve predictive performance in previous research, but few of those
research results report on the details of the splitting process. More
specifically, it is useful to know which contextual dimensions and
conditions are selected, and the statistics related to those
selections. For our purposes, it is possible to explore how emotions interact
with the splitting process by the usage of contexts in the splitting
process, which may help discover the role of emotions from this
perspective. In this paper, we try all three context-aware splitting
approaches, empirically compare their predictive performance, and
also explore the distributions of the usage of contexts (emotional
variables included) for splitting operations.</p>
    </sec>
    <sec id="sec-8">
      <title>DIFFERENTIAL CONTEXT MODELING</title>
      <p>
        Differential context modeling (DCM) is a general contextual
recommendation framework proposed in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. It can be applied to
any recommendation algorithm. The "differential" part of the
technique tries to break down a recommendation algorithm into
different functional components to which contextual constraints can be
applied. The contextual effect for each component is maximized,
and the joint effects of all components contribute the best
performance for the whole algorithm. The "modeling" part is focused on
how to model the contextual constraints. There are two
approaches: context relaxation and context weighting, where context
relaxation uses an optimal subset of contextual dimensions, and context
weighting assigns different weights to each contextual factor.
Accordingly, we have two approaches in DCM: differential context
relaxation (DCR) [
        <xref ref-type="bibr" rid="ref20 ref21 ref22">21, 22, 20</xref>
        ] and differential context weighting
(DCW) [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
4.1
      </p>
    </sec>
    <sec id="sec-9">
      <title>DCM in UBCF</title>
      <p>
        We have successfully applied DCM to user-based collaborative
filtering (UBCF), item-based collaborative filtering (IBCF) and
SlopeOne recommendation algorithms in our previous research [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ],
showing that DCM is an efficient approach to improve context-aware
prediction accuracy. However, we did not explore much about the
modeling part in our previous work; that is, how contexts are
selected, relaxed or weighted.
      </p>
      <p>Recall that we separate different functional components from the
recommendation algorithm, therefore, how the algorithms relax or
weigh contextual variables can tell the role of the contexts in
different components. In this paper, we continue to apply DCM to
UBCF, where the four components we separate in UBCF can be
described as follows:
Neighborhood selection UBCF applies the well-known k
nearestneighbor (kNN) approach, where we can select the top-k
neighbors from users who have rated on the same item i. If
contexts are taken into consideration, the neighborhood can
be further restricted so that users have also rated the item i
in the same contexts. This gives a context-specific
recommendation computation. However, the strict application of
such a filter greatly increases the sparsity associated with
user comparisons. There may only be a small number of cases
in which recommendations can be made. DCM offers two
potential solutions to this problem. DCR searches for the
optimal relaxation of the context, generalizing the set of
contextual features and contextual conditions to reduce sparsity.
DCW uses weighting to increase the influence of neighbors
in similar contexts.</p>
      <p>Neighbor contribution The neighbor contribution is the difference
between a neighbor’s rating on an item i and his or her
average rating over all items. Context relaxation and
context weighting can be applied to the computation of ru. This
computation is replaced by one in which this average is
computed over ratings from a relaxed set of contexts in DCR, or
the average rating can be aggregated by a weighted average
across similar contexts under DCW.</p>
      <p>User baseline The computation of ra is similar to the neighbor’s
average rating and can be made context-dependent in the
same way.</p>
      <p>User similarity The computation of neighbor similarity sim(a; u)
involves identifying ratings ru;i and ra;i where the users
have rated items in common. For context-aware
recommendation, we can additionally add contextual constraints to this
part: use ratings given in matching contexts with context
relaxation or ratings weighted by contextual similarity using
context weighting.</p>
      <p>
        With these considerations in mind, we can derive a new rating
prediction formula by applying DCR or DCW to UBCF. More
details about the prediction equations and technical specifications can
be found in [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
4.2
      </p>
    </sec>
    <sec id="sec-10">
      <title>The Role of Emotions in DCM</title>
      <p>One advantage of DCM is that it allows us to explore the role of
contexts in each algorithm component. DCM seeks to optimize the
contribution of context in each component, and so, the output of
the optimization phase, in which contextual dimensions are
selected and/or weighted, can reveal the relative importance of different
contextual features in different algorithm components. In this
paper, we provide comparisons and also explore the role of emotions
in these two classes of context-aware recommendation algorithms.</p>
    </sec>
    <sec id="sec-11">
      <title>EXPERIMENTAL SETUP</title>
      <p>In this section, we introduce the data sets, evaluation protocols and
the specific configurations in our experiments.
5.1</p>
    </sec>
    <sec id="sec-12">
      <title>Data Sets</title>
      <p>
        We examine context-aware splitting approaches and DCM with the
real-world data set LDOS-CoMoDa, which is a movie dataset
collected from surveys and used by Odic et al [
        <xref ref-type="bibr" rid="ref12 ref13 ref17">12, 13, 17</xref>
        ]. After
filtering out subjects with less than 5 ratings and rating records with
incomplete feature information, we got the final data sets
containing 113 users, 1186 items, 2094 ratings, 12 contextual dimensions
and the rating scale is 1 to 5. We created five folds for cross
validation purposes and all algorithms are evaluated on the same five
folds. Specific descriptions of all the contextual dimensions and
conditions can be found in previous work [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and the description
of the data set online 1.
      </p>
      <p>In our experiments, we use all 12 contextual dimensions,
including three emotional contexts: Mood, DominantEmo and EndEmo,
and non-emotional contexts, including Location, time, etc. The
goal is to compare emotional contexts with others. For example,
in DCR, only influential contextual variables for a specific
component are selected – whether emotional contexts are selected or not
can indicate the significance of their impacts for this component.
For a comprehensive comparison, we also performed experiments
without emotional contexts to better evaluate the importance of the
emotional dimensions.</p>
      <p>In this data, there are the three contextual dimensions that
contain emotional information. "EndEmo" is the emotional state
experienced at the end of the movie. "DominantEmo" is the
emotional state experienced the most during watching, i.e. what emotion
was induced most times during watching. "Mood" is what mood
the user was in during that part of the day when the user watched
the movie. Mood has lower maximum frequency than emotions,
it changes slowly, so we assumed that it does not change during
watching. "EndEmo" and "DominantEmo" contain the same
seven conditions: Sad, Happy, Scared, Surprised, Angry, Disgusted,
Neutral, where "Mood" only has simple three conditions: Positive,
Neutral, Negative.
5.2</p>
    </sec>
    <sec id="sec-13">
      <title>Configurations</title>
      <p>
        To evaluate the performance of context-aware splitting
approaches, we used four splitting criteria described in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]: tmean, tchi,
tprop and tIG. tmean estimates the statistical significance of the
difference in the means of ratings associated to each alternative
contextual condition using a t-test. tchi and tprop estimates the
statistical significance of the difference between two proportions –
high ratings (&gt;R) and low ratings ( R) by chi square test and
ztest respectively, where we choose R = 3 as in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. tIG measures
the information gain given by a split to the knowledge of the item i
rating classes which are the same two proportions as above.
1http://212.235.187.145/spletnastran/raziskave/um/comoda/
comoda.php
      </p>
      <p>Usually, a threshold for the splitting criteria should be set so that
users or items are only be split when the criteria meets the
significance requirement. We use an arbitrary value of 0.2 in the tIG case.
For tmean, tchi and tprop, we use 0.05 as the p-value threshold. A
finer-grained operation is to set another threshold for each impurity
value and each data set. We deem it as a significant split once the
p-value is no larger than 0.05. We rank all significant splits by the
impurity value, and we choose the top first (highest impurity) as the
best split. Items or users without qualified splitting criteria are left
unchanged.</p>
      <p>
        In DCM, we used the same configuration in our previous work
[
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]: we select the top-10 neighbors in UBCF, choose 100 as the
maximal iteration in the optimization process, and Pearson
Correlation is used as the user similarity measure. See our previous work
for more details.
5.3
      </p>
    </sec>
    <sec id="sec-14">
      <title>Evaluation Protocols</title>
      <p>For the evaluation of predictive performance, we choose the root
mean square error (RMSE) evaluated using the 5-fold cross
validation. The data set is relatively small and some subjects in the
survey were required to rate specific movies, thus precision and
recall may be not a good metric, but we plan to evaluate them and
other metrics in our future work.</p>
      <p>
        We applied DCM only to user-based collaborative filtering. For
splitting approaches, there are more options – we evaluate the
performance of three recommendation algorithms: user-based
collaborative filtering (UBCF), item-based collaborative filtering (IBCF)
and matrix factorization (MF) for each splitting approach.
Koren [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] introduced three MF techniques: MF with rating bias
(BiasMF), Asymmetric SVD (AsySVD) and SVD++; we found that
BiasMF was the best choice for this data.
      </p>
      <p>
        We used the open source recommendation engine MyMediaLite
v3.07 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] to evaluate UBCF, IBCF and BiasMF in our experiments.
(We choose K=30 for KNN-based UBCF and IBCF.) In order to
better evaluate MF techniques, we tried a range of different
factors (5 N 60, increment 5) and training iteration T (10
T 100, increment 10). Other parameters like learning and
regularization factors are handled by MyMediaLite, where stochastic
gradient descent is used as the optimization method.
      </p>
      <p>
        For comparison purposes, we choose the well-known
contextaware matrix factorization algorithm (CAMF) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], i.e. CAMF_C,
CAMF_CI and CAMF_CU 2 as the baseline. We tried our best
to fine-tune the configurations (e.g. learning parameters, training
iterations, etc) for CAMF in order to make a reasonable and
comprehensive comparison.
6.
      </p>
    </sec>
    <sec id="sec-15">
      <title>EXPERIMENTAL RESULTS</title>
      <p>In this section, the comparisons of predictive performance are
introduced first, followed by the discussion of emotional roles
discovered in our experiments.
6.1</p>
    </sec>
    <sec id="sec-16">
      <title>Prediction</title>
      <p>
        We use three treatments of the context information – one is the
data with All Contexts where both emotional contexts and
nonemotional variables are included, and the second one is the data
omitting the emotional context dimensions marked by No
Emotions in the table below. The third one is the data with Emotions
Only emitting all non-emotional variables. The overall
experimental results are shown in Table 3, where the numbers in underlined
in italic are the best RMSEs by each approach (i.e. the best one in
2CAMF_CU is a CAMF approach which utilizes the interaction
between contexts and users. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]
each row), and the bold numbers are the best RMSEs by each data
forms (i.e. the best one in each column).
      </p>
      <p>The comparison of performances of those approaches over the
three forms of data can be visualized by Figure 2. We see that
including emotions as contexts can improve RMSE compared with
the situation we only use non-emotional contexts (i.e. No
Emotions). The results differ when we switch our attention to the
"Emotions Only" one. In CAMF, it helps achieve the lowest RMSE with
Emotions Only data. But, including all of the contextual
information yielded the best RMSE for the other approaches: DCM and
context-aware splitting algorithms.</p>
      <p>1.11
1.08
1.05
1.02
0.99
0.96
0.93
0.9
0.87</p>
      <p>CAMF_C CAMF_CI CAMF_CU</p>
      <p>DCR</p>
      <p>DCW
All Contexts</p>
      <p>No Emotions</p>
      <p>Item</p>
      <p>Splitting
Emotions Only</p>
      <p>User
Splitting</p>
      <p>This result is not surprising because both DCM and splitting
approaches choose among contextual features, deciding which to
apply in recommendation. CAMF, on the other hand, uses all
available context information in performing its factorization. Without
the benefit of feature selection, adding additional features to
CAMF may increase noise.</p>
      <p>From an overall view, UI splitting has the best RMSE across all
data treatments among those context-aware recommendation
algorithms. Table 4 shows more details of the predictive performance
among the three splitting approaches if we include emotions as the
contexts (i.e. using all contexts). The numbers are shown as RMSE
values, where the numbers in bold are the best performing RMSE
values for each recommendation algorithm across all three splitting
approaches. The numbers in underlined in italic are the best RMSE
values achieved for the data set using each splitting approach. The
numbers in underlined in bold are the global best RMSE for the
data set.</p>
      <p>These tables show that adding emotions to contexts is able to
provide improvement in terms of RMSE, thus answering research
question 1 in the affirmative. It also suggests an answer to question
2: that the UI splitting approach outperforms other two splitting
approaches if it is configured optimally. In particular, the best RMSE
values are achieved by UI splitting using MF as the
recommenda</p>
      <p>Item Splitting</p>
      <p>User Splitting</p>
      <p>UI Splitting
Generally, MF is the best performing recommendation
algorithm. This is not surprising because splitting increases sparsity and
MF approaches are designed to handle sparsity data. Because the
difference in RMSE is small, we show the boxplot of RMSEs
among the best performing item splitting, user splitting and UI
splitting approaches (i.e. the configuration as the underlined values
in Table 4) in Figure 3. The data in the figure are the 120 RMSE
values which comes from the training iterations – different factors
(5 N 60, with 5 increment in each step) and training
iteration T (10 T 100, with 10 increment in each step). The
figure confirms the comparative effectiveness of UI splitting – the
box is significantly lower than the other two approaches with the
same training iterations.
6.2</p>
    </sec>
    <sec id="sec-17">
      <title>The Role of Emotions</title>
      <p>As mentioned before, one reason we sought to explore the usage
of emotional contexts to discover how emotions interact within
context-aware recommendation algorithms. Both splitting and
DCM offer insights into how contextual dimensions and features are
influential for recommendation.
6.2.1</p>
      <sec id="sec-17-1">
        <title>Context-aware Splitting</title>
        <p>In splitting approaches, the splitting statistics help discover how
contexts were applied in our experiments. In Figure 4 and 5, we
show the top selected contextual dimensions for item splitting and
user splitting3. The right legend indicates the contextual
dimensions, and the y axis denotes the percentage of splits (item splits
or user splits) using each dimension. For a clearer representation in
the figures, we only show contextual dimensions used on more than
5% (item splitting) or 6% (user splitting) of the recommendations.
We do not show results of tIG because this splitting criterion had
the worst performance.</p>
        <p>In general, the top two dimensions are consistent across those
three impurity criteria: EndEmo and Time for item splitting and
EndEmo and DominantEmo for user splitting. However, the
percentages as y axis in the figures are different, not to mention that
the selected condition in each dimension differs too, which
results in different performance by using various impurity criteria. In
terms of the specific selected emotional conditions, the results are
not consistent – the top context dimension for item and user
splitting is the same – EndEmo, but the most frequent selected
condition in this dimension is "Happy" for item splitting and "Neutral"
for user splitting.
3The actual splitting is based on a specific contextual condition
in a dimension, but the results of selected contextual conditions
are fuzzy, thus the distribution of selected contextual dimensions is
explored and reported here.</p>
        <p>
          EndEmo denotes the emotion of the users after seeing the movie,
and this result is consistent with previous work [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] on this
data. Obviously, emotion is a personal quality and can be considered
as more dependent with users other than items – we conjecture that
this may be the underlying clue explaining why user splitting works
better than item splitting for the LDOS-CoMoDa data. And in user
splitting, the top two selected contextual dimensions are the two
emotional variables: EndEmo and DominantEmo – emotions are
generated and owned by users, therefore they are more dependent
with users other than items. This pattern is confirmed by the
comparison between two CAMF approaches: CAMF_CI and
CAMF_CU – contexts are more dependent with users than with items,
which results in better performances by CAMF_CU.
        </p>
        <p>In short, the statistics based on splitting approaches reveal the
importance of emotions – at least the top first selected contextual
dimension is the "EndEmo" for both item splitting and user
splitting.
6.2.2</p>
      </sec>
      <sec id="sec-17-2">
        <title>Differential Context Modeling</title>
        <p>In DCM, the context selection and context weighting can be
examined and show, in a detailed way, the contribution of each
contextual dimension in the final optimized algorithm. The results are
shown in Table 5, where the four components in UBCF were
described in the previous section. "N/A" in the table indicates no
contextual constrains were placed. For clearer representation, we
did not show specific weights of contexts in DCW; instead, we
only list variables which were assigned weights above a threshold of
0.7. The weights are normalized to 1, and 0.7 therefore represents
a very influential dimension.</p>
        <p>We can see in the table that emotional variables are selected in
DCR and weighted significantly in DCW and for which
components. Emotion is influential for a specific component but may not
for other ones. In DCR for example, EndEmo turns out to be
influential when measuring user similarities and user baselines, but it is
not that significant in computing the neighbor contribution.</p>
        <p>It is not surprising that the results from DCW are not fully
consistent with ones from DCR. DCW is a finer-grained approach.
Emotional variables are assigned to neighbor selection in DCW but not
for the same component in DCR, and the specific selected emotions
are different too, e.g. it is DominantEmo selected in DCW for user
similarity calculation, but it is the EndEmo in DCR. In DCW, the
weights for EndEmo and DominantEmo are close to 1 (the weights
are all above 0.92) in the component of user baseline, which
implies significant emotional influence on this component. Emotional
contexts are important in DCM, where it can be further confirmed
by Table 3 – the RMSE values are increased if we remove emotions
from the contexts.</p>
        <p>The result by DCM is useful for further applications, such as
affective computing or marketing purposes. Take the results of DCW
in Table 5 for example, Mood is influential for selecting neighbors,
which implies that if two users rated the same item under the same
mood situation, it is highly possible that they are the good neighbor
candidates for each other (though neighbor selection also depends
on the user similarities). Similarly, DominantEmo is useful to
measure user similarities, which infers that users rated items similarly
with the same dominant emotions are probably the good neighbors
in user-based collaborative filtering.</p>
      </sec>
    </sec>
    <sec id="sec-18">
      <title>CONCLUSION AND FUTURE WORK</title>
      <p>In conclusion, both context-aware splitting approaches and DCM
are able to reveal how emotions interact with algorithms to
improve recommendation performance by exploring the usage of
contexts in the recommendation or splitting process. More specifically,
in context-aware splitting approaches, the percentage of emotional
contexts used by item splits or user splits can tell the importance
of emotions in distinguishing different user rating behavior. DCM
provides a way to see very specifically which emotional contexts
are influential for which components in the recommendation
process.</p>
      <p>Table 6 examines how our research questions are answered for
each type of context-aware recommendation. As discussed above,
we find that contextual dimensions keyed to emotions are very
useful in recommendation (Question 1) and that UI splitting
outperforms the DCM and CAMF approaches (Question 2).</p>
      <p>Question 3 asks about how emotional dimensions compare with
other contextual information. Our results show that emotion-linked
context makes an important contribution to context-aware
recommendation, although other dimensions are also certainly important.
For example, we see that EndEmo is the top selected contextual
dimension in item and user splitting, with Time running the
second in item splitting, and DominantEmo is the top second selected
contextual dimension in user splitting.</p>
      <p>Our fourth research question asks about how those two
classes of context-aware recommendation algorithms can tell the roles
of emotions by usage of contexts. Context-aware approaches are
able to infer the roles by the distribution of usage of emotions
selected for the splitting process. DCM techniques help answer this
question, by pointing out which components make good use of
different contextual variables – showing here that DominantEmo is
important for calculating the user’s baseline. Note that the
neighbor contribution component in DCW is alone in making significant
use of non-emotional context dimensions. This is interesting
because in this component we are determining which movies to use
to compute the neighbor’s baseline for prediction. It appears that
the system prefers to use non-emotional considerations in making
use of others’ ratings, even though the user’s baseline is computed
based on emotional dimensions.</p>
      <p>In addition, we can get extra information from our splitting
experiments because splitting is performed based on specific
contextual conditions. As described above, we found in particular that
"Happy" vs not-"Happy" was the important split on the EndEmo
dimension for item splitting. Essentially, the algorithm is
indicating that there is an important difference between users who feel
happy at the conclusion of a given movie and those that do not.</p>
      <p>In our future work, we plan to continue our exploration of these
algorithms and more data using additional metrics, such as recall
and/or normalized discounted cumulative gain. We are also
looking at additional data sets to see if similar effects are found with
respect to emotions, as well as the empirical comparison among
those context-aware recommendation algorithms. We also plan to
examine the effects by the correlations between different
contextual variables, e.g. how emotional effects change if emotions are
significantly dependent with other contexts or features. In addition,
it is interesting to explore the association among emotions, user
profiles, item features and users’ ratings. For example, user may
feel "sad" after seeing a tragedy movie, but the emotion could be
"happy" because he or she saw such a good movie even if it is a
tragedy. Therefore, which specific emotions will result in a higher
rating? the "sad" or the "happy"?</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Tuzhilin</surname>
          </string-name>
          .
          <article-title>Context-aware recommender systems</article-title>
          .
          <source>AI Magazine</source>
          ,
          <volume>32</volume>
          (
          <issue>3</issue>
          ):
          <fpage>67</fpage>
          -
          <lpage>80</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L.</given-names>
            <surname>Baltrunas</surname>
          </string-name>
          and
          <string-name>
            <given-names>X.</given-names>
            <surname>Amatriain</surname>
          </string-name>
          .
          <article-title>Towards time-dependant recommendation based on implicit feedback</article-title>
          .
          <source>In ACM RecSys' 09, Proceedings of the 4th International Workshop on Context-Aware Recommender Systems (CARS</source>
          <year>2009</year>
          ),
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>L.</given-names>
            <surname>Baltrunas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ludwig</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Matrix factorization techniques for context aware recommendation</article-title>
          .
          <source>In Proceedings of the fifth ACM conference on Recommender systems</source>
          , pages
          <fpage>301</fpage>
          -
          <lpage>304</lpage>
          . ACM,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>L.</given-names>
            <surname>Baltrunas</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Context-based splitting of item ratings in collaborative filtering</article-title>
          .
          <source>In Proceedings of the third ACM conference on Recommender systems</source>
          , pages
          <fpage>245</fpage>
          -
          <lpage>248</lpage>
          . ACM,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L.</given-names>
            <surname>Baltrunas</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Experimental evaluation of context-dependent collaborative filtering using item splitting. User Modeling and User-Adapted Interaction</article-title>
          , pages
          <fpage>1</fpage>
          -
          <lpage>28</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Berkovsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kuflik</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Cross-domain mediation in collaborative filtering</article-title>
          .
          <source>In User Modeling</source>
          <year>2007</year>
          , pages
          <fpage>355</fpage>
          -
          <lpage>359</lpage>
          . Springer,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Gantner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rendle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Freudenthaler</surname>
          </string-name>
          , and L.
          <string-name>
            <surname>Schmidt-Thieme</surname>
          </string-name>
          .
          <article-title>Mymedialite: A free recommender system library</article-title>
          .
          <source>In Proceedings of the fifth ACM conference on Recommender systems</source>
          , pages
          <fpage>305</fpage>
          -
          <lpage>308</lpage>
          . ACM,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>G.</given-names>
            <surname>Gonzalez</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. L. de la Rosa</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Montaner</surname>
            , and
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Delfin</surname>
          </string-name>
          .
          <article-title>Embedding emotional context in recommender systems</article-title>
          .
          <source>In Data Engineering Workshop</source>
          , 2007 IEEE 23rd International Conference on, pages
          <fpage>845</fpage>
          -
          <lpage>852</lpage>
          . IEEE,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B</given-names>
            <surname>.-</surname>
          </string-name>
          j. Han,
          <string-name>
            <surname>S</surname>
          </string-name>
          . Rho,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jun</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Hwang</surname>
          </string-name>
          .
          <article-title>Music emotion classification and context-based music recommendation</article-title>
          .
          <source>Multimedia Tools and Applications</source>
          ,
          <volume>47</volume>
          (
          <issue>3</issue>
          ):
          <fpage>433</fpage>
          -
          <lpage>460</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Hariri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Burke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          .
          <article-title>Context-aware recommendation based on review mining</article-title>
          .
          <source>In IJCAI' 11, Proceedings of the 9th Workshop on Intelligent Techniques for Web Personalization and Recommender Systems (ITWP</source>
          <year>2011</year>
          ), pages
          <fpage>30</fpage>
          -
          <lpage>36</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          .
          <article-title>Factorization meets the neighborhood: a multifaceted collaborative filtering model</article-title>
          .
          <source>In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          , pages
          <fpage>426</fpage>
          -
          <lpage>434</lpage>
          . ACM,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Odic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tkalcic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Tasic</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Košir</surname>
          </string-name>
          .
          <article-title>Relevant context in a movie recommender system: Users' opinion vs. statistical detection</article-title>
          .
          <source>In ACM RecSys' 12, Proceedings of the 4th International Workshop on Context-Aware Recommender Systems (CARS</source>
          <year>2012</year>
          ),
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Odic´</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. Tkalcˇicˇ</surname>
            ,
            <given-names>J. F.</given-names>
          </string-name>
          <article-title>Tasicˇ, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Košir</surname>
          </string-name>
          .
          <article-title>Predicting and detecting the relevant contextual information in a movie-recommender system</article-title>
          .
          <source>Interacting with Computers</source>
          ,
          <volume>25</volume>
          (
          <issue>1</issue>
          ):
          <fpage>74</fpage>
          -
          <lpage>90</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>P.</given-names>
            <surname>Resnick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Iacovou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Suchak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bergstrom</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          .
          <article-title>Grouplens: an open architecture for collaborative filtering of netnews</article-title>
          .
          <source>In Proceedings of the 1994 ACM conference on Computer supported cooperative work</source>
          , pages
          <fpage>175</fpage>
          -
          <lpage>186</lpage>
          . ACM,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Said</surname>
          </string-name>
          , E. W. De Luca, and
          <string-name>
            <given-names>S.</given-names>
            <surname>Albayrak</surname>
          </string-name>
          .
          <article-title>Inferring contextual user profiles - improving recommender performance</article-title>
          .
          <source>In ACM RecSys' 11, Proceedings of the 4th International Workshop on Context-Aware Recommender Systems (CARS</source>
          <year>2011</year>
          ),
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanjalic</surname>
          </string-name>
          .
          <article-title>Mining mood-specific movie similarity with matrix factorization for context-aware recommendation</article-title>
          .
          <source>In Proceedings of the Workshop on Context-Aware Movie Recommendation</source>
          , pages
          <fpage>34</fpage>
          -
          <lpage>40</lpage>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>M. Tkalcˇicˇ</surname>
            , U. Burnik,
            <given-names>A</given-names>
          </string-name>
          . Odic´,
          <string-name>
            <given-names>A.</given-names>
            <surname>Košir</surname>
          </string-name>
          , and
          <string-name>
            <surname>J. Tasicˇ.</surname>
          </string-name>
          <article-title>Emotion-aware recommender systems-a framework and a case study</article-title>
          .
          <source>In ICT Innovations</source>
          <year>2012</year>
          , pages
          <fpage>141</fpage>
          -
          <lpage>150</lpage>
          . Springer,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Tkalcic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kosir</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Tasic</surname>
          </string-name>
          .
          <article-title>Affective recommender systems: the role of emotions in recommender systems</article-title>
          .
          <source>In ACM RecSys Workshop on Human Decision Making</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Uitdenbogerd and R. G. van Schyndel</surname>
          </string-name>
          .
          <article-title>A review of factors affecting music recommender success</article-title>
          .
          <source>In ISMIR</source>
          , volume
          <volume>2</volume>
          , pages
          <fpage>204</fpage>
          -
          <lpage>208</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Burke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher</surname>
          </string-name>
          .
          <article-title>Assist your decision-making in various situations: Differential context relaxation for context-aware recommendations</article-title>
          .
          <source>In Research Colloquium</source>
          , School of Computing, DePaul University, Chicago IL, USA,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Burke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher.</surname>
          </string-name>
          <article-title>Differential context relaxation for context-aware travel recommendation</article-title>
          .
          <source>In 13th International Conference on Electronic Commerce and Web Technologies (EC-WEB 2012)</source>
          , pages
          <fpage>88</fpage>
          -
          <lpage>99</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Burke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher</surname>
          </string-name>
          .
          <article-title>Optimal feature selection for context-aware recommendation using differential relaxation</article-title>
          .
          <source>In ACM RecSys' 12, Proceedings of the 4th International Workshop on Context-Aware Recommender Systems (CARS</source>
          <year>2012</year>
          ). ACM,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Burke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher.</surname>
          </string-name>
          <article-title>Differential context modeling in collaborative filtering</article-title>
          .
          <source>In School of Computing Research Symposium</source>
          . DePaul University, USA,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Burke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher</surname>
          </string-name>
          .
          <article-title>Recommendation with differential context weighting</article-title>
          .
          <source>In The 21st Conference on User Modeling, Adaptation and Personalization (UMAP</source>
          <year>2013</year>
          ), pages
          <fpage>152</fpage>
          -
          <lpage>164</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>