<!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>Explaining contextual recommendations: Interaction design study and prototype implementation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Joanna Misztal</string-name>
          <email>joanna.misztal@uj.edu.pl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bipin Indurkhya</string-name>
          <email>bipin.indurkhya@uj.edu.pl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Jagiellonian University</institution>
          ,
          <addr-line>Cracow</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We describe an architecture for generating context-aware recommendations along with detailed textual explanations to support the user in the decision-making process. CARE (Context-Aware Recommender with Explanation) incorporates a hierarchical structure, in which independent modules embodying di erent aspects of the context cooperate together to generate recommendations for the user with accompanying rationales. We follow the Interaction Design principles to develop personas, goals and user scenarios, based on which a prototype system is developed. We present here two examples of its performance when processing movieratings data set with contextual information. We argue that our architecture is extensible in that more modules can be added as needed, and the approach can be applied to other domains as well. context-aware recommender system, recommendations explanations, interaction design</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>An increasing number of available resources, and easy
online access to diverse goods has resulted in data overload,
making it di cult for many users to decide what items to
select, which often slows down their decision-making
process. A growing number of choices is leading to an emerging
interest in the development of decision-support systems to
help users in nding the most interesting or suitable items
for their personal needs. Most of the research in this domain
is focused on improving the accuracy and precision of
recommendations. However, it is equally important to provide
the user with some rationale for why a particular item is
being recommended to them. Moreover, in some domains such
as legal decision-making or moral and ethical reasoning, the
justi cations for recommendations are very crucial. Hence,
the main focus of our work is to design a system that can
explain why the user should select particular items.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for profit or commercial advantage and that copies
bear this notice and the full citation on the first page. To copy otherwise, to
republish, to post on servers or to redistribute to lists, requires prior specific
permission and/or a fee.</p>
      <p>Joint Workshop on Interfaces and Human Decision Making for
Recommender Systems, RecSys 2015, Vienna, Austria
Copyright 20XX ACM X-XXXXX-XX-X/XX/XX ...$15.00.</p>
      <p>
        As observed in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], the user's preferences may be in
uenced by factors as diverse as time of the day, day of the
week, the season or the weather at the moment, and so on.
In our system, we incorporate di erent independent modules
such that each module implements a particular approach to
generating a recommendation based on a single contextual
feature. This architecture allows generating a number of
diverse recommendations, as each piece of contextual
information is analyzed separately and the most approporiate
items are recommended by choosing from among the
various recommendations generated by di erent modules.
      </p>
      <p>
        As the main focus of our research is to improve user's
experience and understanding during the interaction with
the system, we designed a Context-Aware Recommender
with Explanation (CARE) system, following the Interaction
Design paradigm [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Personas, user goals and scenarios
are developed after interviewing potential
recommendationsystem users and a domain expert, based on which the
prototype of the system is designed.
      </p>
      <p>We motivate here our approach in the context of the
current state of the art, summarize the interaction design
process, and present examples of persona and scenarios. Then
we describe the system architecture and present some results
generated by our prototype implementation.
2.</p>
    </sec>
    <sec id="sec-2">
      <title>BACKGROUND</title>
      <p>
        As de ned in [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], the main goal of a recommender system
is to support the user in a decision-making process by
suggesting items that they might nd interesting. Since
information overload is a growing problem for Web users, because
of an exponential increase in the amount of web content that
is being generated, development of such tools has become a
thriving research area in recent years. Consequently, several
techniques have been developed for predicting users'
preferences.
2.1
      </p>
    </sec>
    <sec id="sec-3">
      <title>Content-based recommender systems</title>
      <p>
        Content-based recommenders try to nd items similar to
what the user previously liked [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. These work by
identifying key features of the items highly rated by the user in the
past, and by building a user-preference model from those
characteristics [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>A signi cant problem in many recommendation techniques
is the cold-start problem, which occurs when a new user or a
new item is presented to the system and there is not enough
data to perform a reliable prediction - the user has not rated
enough products to de ne his or her preferences, or an item
has not been rated by a su cient number of users.</p>
      <p>Content-based recommenders deal well with situations when
a new item is added to the system. It also maintains
independence among the users as a particular user's ratings are
su cient to perform the recommendation process for that
user. For our research, a major advantage of content-based
recommenders is their transparency | the features that
triggered the recommendation results may be listed along with
the output.</p>
      <p>However, content-based recommenders su er from
overspecialization: i.e. they recommend items similar to those
seen in the past, preventing a serendipity of
recommendations. Also, when a new user, who does not have a previous
history with the system and so lacks any ratings, enters the
system, the cold-start problem may occur.</p>
      <p>Content-based analysis operates on vectors representing
features of each object. Two basic techniques for ltering
similar items are similarity calculation (such as cosine
similarity) and distance measurement (such as Euclidean
distance).
2.2</p>
      <p>Collaborative filtering recommender
systems</p>
      <p>
        In collaborative ltering (CF), a user's preferences are
predicted based on modelling other users behaviors [
        <xref ref-type="bibr" rid="ref16 ref24">24, 16</xref>
        ].
The basic idea behind this approach is that the rating of a
user for a new item should be close to the ratings of users
who have similar tastes.
      </p>
      <p>This approach su ers from the data-sparsity and
newitem problems. Another disadvantage is that
collaborativeltering recommenders mostly work as black-box systems,
therefore they lack transparency and cannot explain why
certain items are being recommended. However, this
approach is proving to be an e ective technique for making
recommendations and is widely used in commercial
applications. It has an advantage of being able to recommend
items with unknown content. CF also supports
serendipity in recommendations, for recommended items may di er
signi cantly from the previous ones.</p>
      <p>
        Common approaches to CF for recommendations use
neighbourhood-based or model-based methods.
Neighbourhoodbased methods try to nd the most similar items (item-based
approaches) or most similar users (user-based approaches)
when predicting the rating of an item for a particular user.
Basic technique may incorporate correlation measures (such
as Pearson's similarity) when comparing the vector of
ratings for users or items [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Model-based methods work
by nding the latent features that characterize the user's
ratings, and build a predictive model of their preferences.
Such methods may employ Matrix Factorization algorithms,
Bayesian models, Support Vector Machines or other such
techniques.
2.3
      </p>
    </sec>
    <sec id="sec-4">
      <title>Context-aware recommender systems</title>
      <p>
        As observed in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], a person's preferences may be in
uenced by factors as diverse as time of the day, day of the
week, the season, the weather at the moment, and so on.
Context-aware recommender systems (CARS) try to model
user's preferences considering changing contexts that may
a ect user's moods and tastes [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Contextual data may be
collected explicitly by asking the user some questions, or
implicitly from the environment (information such as time, day
of week, season or location). Some information may also be
statistically inferred from the other data (such as the
companion or mood). In CARS, the input data from the
standard recommendation approach in the form &lt; user; item; rating &gt;
is extended by an additional parameter of context. Some
standard approaches to recommendations have been adapted
to model the additional dimension of context. In [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], the
authors present a Tensor Factorization model-based technique
using N-dimensional tensor of User-Item-Context instead of
the 2D User-Item matrix.
      </p>
      <p>
        Standard approaches for CARS implementation
incorporate contextual pre- ltering (items ltered by context before
recommendation), post- ltering (context applied to
recommendation results) and contextual modeling (context as a
part of ratings prediction). Common approaches based on
standard pre- ltering techniques represent item and
usersplitting algorithms [
        <xref ref-type="bibr" rid="ref28 ref6">28, 6</xref>
        ]. In these methods, items (or
users) in di erent contexts are treated as separate objects
for the recommendation algorithm. Context-aware systems
are known to increase the accuracy of recommendations [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
However, they face the data sparsity problem, as the
number of ratings is restricted to given context. As discussed in
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], the most e cient approach to context-splitting is single
split, where objects are split considering a single contextual
feature.
2.4
      </p>
    </sec>
    <sec id="sec-5">
      <title>Other approaches</title>
      <p>
        Some recommenders are implemented as knowledge-based
systems [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], where the recommendation algorithm is
performed by a set of constraints representing the knowledge
about the domain. Such systems may be applicable to the
domains for which historical data is not available, or when
the user does not perform the action often enough, so there
is little data to make a prediction (e.g. buying a car).
      </p>
      <p>Another approach is to use demographic information about
the users to predict their tastes based on their social group.
Such recommendations may depend on user's age, gender,
nationality, and so on.
2.5</p>
    </sec>
    <sec id="sec-6">
      <title>Hybrid solutions</title>
      <p>
        Each of the techniques mentioned above has some
advantages as well as some drawbacks, and each may be e ective
for a certain domain or a certain type of problem [
        <xref ref-type="bibr" rid="ref13 ref9">13, 9</xref>
        ].
In order to build a more general recommender system, or
to improve the quality of recommendations, hybrid systems
combine diverse recommendation algorithms. There are
different ways to combine outputs of various recommendation
strategies, which are classi ed by Burke [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] as follows:
      </p>
      <p>Weighted: the scores from several recommenders are weighted
into one result.</p>
      <p>Switching: the most appropriate technique is selected
depending on the input data.</p>
      <p>Mixed: outputs from diverse algorithms are presented
simultaneously.</p>
      <p>Feature combination: features of di erent algorithms are
combined into a new feature.</p>
      <p>Cascade: the recommendation is performed hierarchically
and the outputs are re ned by the subsequent recommenders.</p>
      <p>Feature augmentation: output from one system is the
input to the following one.</p>
      <p>Meta-level: the model created by one system is used by
another.
2.6</p>
    </sec>
    <sec id="sec-7">
      <title>Multi-agent approaches</title>
      <p>
        Hybrid recommender systems are often implemented based
on diverse multi-agent system (MAS) architectures.
Distributed approaches to recommendations have been
previously studied in [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ], where a collaborative recommendation
algorithm is implemented using cloud computing. Sabater,
Singh and Vidal [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] proposed a protocol in which a group
of sel sh agents can decide how to share their
recommendations with the others. In [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], the authors introduce
recommender agents to enable the user's interaction with the
system and to combine the outputs of the recommendation
algorithms with other techniques such as other users
bookmarks and tags.
      </p>
      <p>
        Another example of MAS architecture that may be used
for implementing a recommender system is the blackboard
architecture. This architecture may be visualized by the
metaphor [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] of a group of independent experts with
diverse knowledge who are sharing a common workspace (the
blackboard). They work on the solution together and each
of them adds some contribution to the blackboard, whenever
possible, until the problem is solved.
      </p>
      <p>
        The blackboard model provides an e cient platform for
problems that require many diverse sources of knowledge.
It allows a range of di erent experts represented as diverse
computational agents, and provides an integration
framework for them. It seems a promising platform for
recommendation tasks, and has already been incorporated in [
        <xref ref-type="bibr" rid="ref12 ref21">12,
21</xref>
        ].
      </p>
    </sec>
    <sec id="sec-8">
      <title>OVERVIEW OF CARE SYSTEM</title>
    </sec>
    <sec id="sec-9">
      <title>Architecture</title>
      <p>CARE (Context-Aware Recommender with Explanation)
is built as a hybrid architecture that adapts a mixed
approach to recommendations, and incorporates some features
of the multi-agent blackboard architecture. We implemented
each module as an independent subsystem that uses some
particular approach to generating a recommendation by
incorporating a particular contextual feature. As some of
those factors may be non-deterministic, we present the
nal result as an array of alternate choices and allow the user
to choose from the recommendations generated by analyzing
diverse contextual factors. Hence the diversity of nal
recommendation outputs is ensured by presenting the analysis
from multiple points of view. This approach also
incorporates serendipity, and gives the users a choice of possible
actions. The users actions can be noted and used for
ordering future recommendations.</p>
      <p>Our solution also embodies some aspects of the feature
augmentation approach | we perform the recommendations
hierarchically on di erent levels of abstraction. We
introduce some inter-level recommenders that are responsible for
de ning the features of items that are most liked by the
users in a given context. Their outputs are used to lter the
data with identi ed characteristics, which is then sent as an
input to the higher layer of recommendations.
3.2</p>
    </sec>
    <sec id="sec-10">
      <title>Evaluation</title>
      <p>Most of the solutions for automatic recommendations are
focused on development of techniques improving the
overall performance and accuracy of ratings prediction.
Accordingly, most popular evaluation approaches incorporate
precision metrics for the estimations. However, there are
other factors that impact the e ectiveness of
recommendations and in uence the user experience.</p>
      <p>
        A major limitation of the existing recommendation
systems is overspecialization and a lack of diversity in
recommender outputs [
        <xref ref-type="bibr" rid="ref19 ref29">29, 19</xref>
        ]. As described in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], during the
challenge on Context-Aware Movie Recommendation (CAMRa
2010), competing systems were evaluated according to
diverse factors divided into two groups. The rst set of
criteria consisted of precision metrics while the other set
contained the following Subjective Evaluation Criteria:
Context, Contextualization of recommendations, Extensibility,
Serendipity, Creativity, Scalability, Sparsity, Domain
dependence, and Adoptability
      </p>
      <p>In our research, we aim to address some of these
subjective criteria to improve user experience, and also develop
an architecture that is easily adaptable to other domains.
We use contextual ltering to model user preferences. Our
architecture enables one to implement exible and generic
recommender systems that can easily be extended with new
independent modules in a hierarchical structure. Our
approach promotes diversity and serendipity among the
recommendation outputs as each module processes information
from a di erent point of view.
3.3</p>
    </sec>
    <sec id="sec-11">
      <title>Explaining recommendations</title>
      <p>
        We mentioned above that aspects such as user
satisfaction play an important role in the evaluation of a
recommender system. As noted by [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], a limitation of many
recommenders is that they work as black-box systems and do
not provide the users with any reasons for providing a
particular recommendation. Some of the commercial systems are
striving to overcome this limitation by producing a rationale
accompanying each recommendation. A number of diverse
styles have emerged to provide this rationale [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]:
CaseBased (... because you highly rated Item A..., used in Net ix
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]), Collaborative (Customers who bought this Item were
also interested in... used by Amazon), Content-Based (We
are playing this music because it has a slow tempo by
Pandora [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]). In [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], the authors use information visualization
techniques to improve interaction with their recommender
system. Such system transparency not only increases the
user satisfaction, but also helps the users in making easier
and faster decision in selecting an item.
      </p>
      <p>In CARE, each module is provided with an
explanationgenerating function, which produces a description of the
features that determined the recommendation. The style of this
message is dependent on the module's implementation. The
nal explanation may combine di erent styles of messages
produced independently by separate modules. We
incorporate modules that process information on di erent levels of
abstraction, hence the nal description contains rationales
at multiple granularity levels. Our goal is to generate a
rationale explaining to the user why she or he should nd
certain items interesting (contextual reason, e.g. because it
is rainy and what features make this particular item a
relevant choice (e.g. because you like rock music when it is
rainy).
4.</p>
    </sec>
    <sec id="sec-12">
      <title>GOAL-DIRECTED DESIGN</title>
      <p>
        In designing the CARE system, we follow the principles of
Interaction Design [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], according to which the design of a
system is developed iteratively through continuous
interaction with the user. In the subsequent sections, we summarize
the conclusions from the interviews with three users and a
movie-domain expert.
4.1
      </p>
    </sec>
    <sec id="sec-13">
      <title>Domain expert’s opinion</title>
      <p>Following the Interaction Design paradigm, we consulted a
lm analysis academic to nd out what factors may in uence
the popularity of a movie among the users.</p>
      <p>The expert noted that the genre is not the only feature
that the users consider when deciding which movie to watch.
Other factors which may determine their preferences are
narrative description, its tempo, atmosphere and tension.</p>
      <p>Moreover, the users often want to watch the same kind of
movies that they have already watched. Thus, they select
well-known names, plots or recognizable brands. Such a
brand may be de ned by the director, movie star or award
such as Oscar or some Film Festival.</p>
      <p>Considering all these factors, our system design should
embody modules that analyze relevant movie features such
as genre, cast, director, awards won as well as information
about the atmosphere of the movie. The prototype
implementation incorporates the genre ltering modules, and we
plan to extend it with modules that will analyze other
factors as well.</p>
      <p>Another major factor that in uences a user's choice is the
current trend or fashion. There are some must-see movies
that many users desire to watch. Moreover, some people
rely on the public opinion more than on their own
impressions. In our design, the public opinion is modelled by a
collaborative ltering recommendation algorithm.
4.2</p>
    </sec>
    <sec id="sec-14">
      <title>Defining User Goals</title>
      <p>We interviewed three potential users to determine their
expectations from a recommender system. The volunteers
were technical faculty graduates who are familiar with using
recommender systems to nd items of their interest. Each
of them was interviewed separately, in their natural
environment. They were asked to describe their experiences in one
of the three domains of recommendations: books, movies
and music. First, each person was asked to describe his or
her general preferences in the given area and if they could
identify some factors that may in uence it. Then they were
asked to describe some particular situations in which they
use recommendations, considering the context details. The
nal question was about the expected recommendation
output in these situations. We are planning to extend this
research by incorporating interviews with a broader group of
users with more diverse backgrounds.</p>
      <p>It was observed that every person has some general tastes,
but particular preferences change according to the time and
the mood. Thus, the system should consider some
contextual information in generating the recommendations.
However, some of these factors, such as the user's mood, who
they are with, and so on, may be di cult to predict. Hence
the approach we chose is to give the user a choice of possible
actions considering di erent contextual or a ective states so
that the user can decide what she or he needs at the moment.</p>
      <p>Finally, we found that the users like to know why any
particular item is recommended to them. Hence the
system should aggregate information from di erent levels of
abstraction, and present it to the user in an intuitively
understandable way. We plan to present a rationale for each
recommendation as an accompanying text message.
4.3</p>
    </sec>
    <sec id="sec-15">
      <title>User scenarios</title>
      <sec id="sec-15-1">
        <title>Persona: Mark</title>
        <p>Goals: getting movies recommendations; nding
uncommon yet interesting movies when alone; nding lights
comedies to watch with his girlfriend</p>
        <p>Scenario 1</p>
        <p>It is a cold winter Friday and Mark and his girlfriend want
to spend the evening with a light movie and a glass of wine.
Mark opens CARE and a message pops out:</p>
        <p>Hi Mark! Finally, it's the weekend! It's freezing, isn't
it? Are you dreaming of little holidays? What about Woody
Allen's "Vicky Cristina Barcelona" to warm you up a little?
I know you like this director. Or maybe you had a tough
week and feel like watching something to cheer you up with
a bit of dark humor, like "Grand Budapest Hotel"?
Scenario 2</p>
        <p>On Monday, Mark's girlfriend is o for a ladies night with
her friends so nally he can choose a movie on his own.
CARE greets him:</p>
        <p>Hi Mark! Maybe something positive for the new week?
How about "Intouchables"? Or maybe you're fed up with the
city life in Krakow and want to watch the story of a man in
the heart of nature, like "Into the wild"? You like non- ction
movies!
5. SYSTEM ARCHITECTURE OF CARE</p>
        <p>General architecture of the CARE system is presented in
Figure 1. Modules in our prototype system work on di erent
levels of abstraction.</p>
        <p>First group of modules perform contextual features
ltering based on the input with current context, user
information and ratings history with context. The goal of this
processing phase is to determine the most relevant item features
for a given context. Each component on this level analyzes
the information about a single contextual information. To
address the problem of sparsity, we also incorporate a
module that considers all users' ratings without any contextual
ltering. The output of each lter is a list of items
characterized by the identi ed features. This architecture is
extensible with di erent types of lters that analyze other aspects
of recommendations (such as demographic data). In this
paper we focus only on the contextual information processing.</p>
        <p>In the next stage of recommendation process, we
incorporate recommender algorithms that select items that should
be most liked by the user, considering each of the item
groups received from the former stage as a separate
recommendation problem. The modules on this stage may
represent diverse recommendation techniques and algorithms,
however our prototype implementation includes
collaborative ltering algorithms. The result of recommendation is
the best choice of items for each set of items.</p>
        <p>Each component generates a short description of its
results and the reason of recommendation. The messages are
nally composed by the explanation templates module and
presented to the user along with the recommended items.</p>
        <p>The hierarchical structure of the system and the inter-level
ltering of item features enables a more thorough
explanation of the process in generated outputs. Hence the output
does not only provide the user with the information Item A
was recommended because it is summer, but also emphasizes
the feature that was crucial for this choice (Item A was
recommended because you seem to like this type of items during
summer.).</p>
        <p>The system is being developed using Django, a Web
framework for Python. The system interface will be provided as
a web application, however at present the system output is
in plain textual form as presented in the results section.</p>
      </sec>
    </sec>
    <sec id="sec-16">
      <title>EXPERIMENT</title>
      <p>We present phases of the recommendation algorithm along
with an illustrative example of recommendations for user
John.
6.1</p>
    </sec>
    <sec id="sec-17">
      <title>Testing data</title>
      <p>
        CARE system architecture is applicable to many
recommendation domains where the context may in uence user
preferences. Possible domains of application include books,
music or movies as well as restaurants recommendations
as user's choice may depend on aspects such as changing
weather or time. Here we present the results from testing
our prototype on the LDOS-CoMoDa dataset [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] that
contains movie ratings along with contextual information, and
user and item characteristics. Contextual data contain
information about the season, type of day (weekend, working
day or holiday), time of day (morning, afternoon, evening),
companion, and so on.
      </p>
      <p>The dataset also contains information about the mood of
the movie and it could be interesting to consider this data
as well. However, the dataset only provides the dominant
and end emotional values, without any information about
the user's mood before watching the movie. Since we treat
contextual factors as facts known at the moment of
recommendation (as the initial data), we cannot make a
recommendation considering user's mood after or during
watching the movie. In future work, we plan to add a feature to
query user's mood at the moment of recommendation, and
consider this information as a contextual parameter.</p>
      <p>Table 2 contains a part of John's ratings for the analyzed
example along with contextual information.
6.2</p>
    </sec>
    <sec id="sec-18">
      <title>Recommendation process</title>
      <p>We present below a brief description of the di erent stages
of our algorithm along with illustrative examples. The main
steps of algorithm are listed below and described in the
subsequent sections:
1. Initialization with contextual input data.
2. Contextual type-splitting - identifying signi cant
contextual factors and relevant data types.
3. Collaborative ltering items recommendation for each
of the types de ned in 2.
4. Explanation generation for each of the recommended
types and a corresponding contextual factor.
6.2.1</p>
      <sec id="sec-18-1">
        <title>Input data</title>
        <p>Input for the recommendation is the user data and the
information about the context in which the recommendation
takes place. This data may contain information explicitly
provided by the user (such as whether they are alone or
with a companion) or implicit information extracted
automatically from the date and location data (such as day of
week, time of the day, weather, and so on).</p>
        <sec id="sec-18-1-1">
          <title>Example:</title>
        </sec>
        <sec id="sec-18-1-2">
          <title>Context:</title>
          <p>Season: Summer
Day type: working day
Time: evening
Weather: sunny
Companion: alone
6.2.2</p>
        </sec>
      </sec>
      <sec id="sec-18-2">
        <title>Contextual type-splitting</title>
        <p>For the context-aware recommendation process, we
introduced contextual type-splitting algorithm which is an
adaptation of the standard contextual item-splitting approach.
We incorporated an additional abstraction level and treated
the item features as the recommendation objectives. Table
2 illustrates the di erence between approaches.</p>
        <sec id="sec-18-2-1">
          <title>Contextual item-splitting</title>
          <p>In the rst phase of the basic algorithm, each item is
associated with the most relevant contextual feature
that diversi es its ratings. Then the ratings for this
item are split according to this division. The mean
rating values for each item are compared for the situation
where particular circumstance occurs and otherwise.
For example, we could compare ratings for a particular
movie that were given during the weekend with ratings
from all other days. If they are signi cantly di erent,
we can infer that the user preferences for this item are
in uenced by the day of the week.</p>
        </sec>
        <sec id="sec-18-2-2">
          <title>Contextual type-splitting</title>
          <p>In our approach, we perform analogical computations,
but instead of comparing the contexts for each movie,
we analyze each context for a group of movies with a
common feature (such as a genre). As a result we can,
for example, nd out that the user prefers to watch
horror movies during the weekends than on other days.
This step may be generalized to recommend items grouped
by other features, such as the director, country of
origin, etc.</p>
          <p>This approach allows us to give more transparent and
intuitive recommendations for the user by presenting
the features that lead to the nal recommendation.
It also addresses a major drawback of the context
preltering approaches, namely the data sparsity after
applying the lter. As the number of recommendations
for a particular type of movies is signi cantly higher
than for each movie separately, we expect the results
to be more accurate. Reducing number of
comparisons to groups of items also contributes to decreasing
complexity of computations and speeds up the
recommendation process. In subsequent steps, the
recommendations are performed for selected groups only.</p>
          <p>
            We verify the signi cance of each contextual feature using
the two-tailed Student's t-test, assuming the p-value
threshold of 10%. Additionally, we consider the signi cance of
only those features where the mean rating is higher when
a particular context occurs. The t-test is a basic approach
(as presented in [
            <xref ref-type="bibr" rid="ref28">28</xref>
            ]), however its use is limited for normally
distributed data. In other cases, it may be replaced by other
statistical methods such as Wilcoxon signed-rank test.
          </p>
          <p>The features signi cance testing in a context is performed
as follows:</p>
          <p>For each type ti of items (eg. for each of the genres) we
compare the mean rating for items of this type when
each of the input contextual circumstances ci occurs
and otherwise (eg. ratings for comedies in summer
and other seasons).
signif icance(ci; tj ) = ttest(Ratingstjjci ); Ratingstjj:ci )
If the statistical test for both groups of ratings split
by the contextual feature ci indicates a signi cant
difference in mean ratings, and the mean rating for type
when ci occurs (Ratingstjjci ) is higher then otherwise
(Ratingstjj:ci ), we conclude that the type ti is a
relevant recommendation in given context ci.</p>
        </sec>
        <sec id="sec-18-2-3">
          <title>Example:</title>
        </sec>
        <sec id="sec-18-2-4">
          <title>Contexts signi cance testing:</title>
          <p>Input context: summer, working day, evening, sunny, alone
Ratings in summer vs other seasons: mean ratings for
comedies are signi cantly higher during summer.</p>
          <p>Ratings on working days vs other days: no relation found.</p>
          <p>Ratings in the evening vs other time: mean ratings for
comedies are signi cantly higher in the evening.</p>
          <p>Ratings on sunny days vs other weather: no relation found.</p>
          <p>Ratings for movies watched alone and other companion:
no relation found.
6.2.3</p>
        </sec>
      </sec>
      <sec id="sec-18-3">
        <title>Types pre-filtering</title>
        <p>After identifying the types of movies that are most
relevant for a given context, we lter the set of ratings for each
type separately. For example, if we consider a
recommendation for Saturday morning and we nd out that horror
movies are the most preferred genre during the weekend,
and comedies get the highest ratings in the mornings, we
rst consider recommendations for horror movies and then
for comedies separately.</p>
        <p>We also calculate general recommendations considering
the user preferences of all the items, without any pre- ltering.
This addresses the sparsity problem for context
recommendations and deals with the situation when no relevant
contextual information is provided.</p>
      </sec>
      <sec id="sec-18-4">
        <title>6.2.4 Items recommendation</title>
        <p>After ltering the items by their types, we perform a
standard collaborative- ltering recommendation algorithm
to nd the most suitable choices considering a particular
user's taste. We calculate the similarity between users using
Pearson's correlation measure. Then we consider the ratings
of the most similar users with the K-Nearest-Neighbours
algorithm. In further research we plan to address the problem
of scalability by users clustering.</p>
        <p>For each of the identi ed categories we perform a
separate recommendation process, hence the nal output
contains the recommendation results from diverse perspectives.
For the current implementation, we incorporated the
standard user-based CF algorithm. However the system may be
easily extend by other modules performing di erent
recommendation algorithms since the calculations are performed
independently.</p>
        <p>A major goal of our research is to develop a
recommendation system that can present the recommendations along
with accompanying explanations. Hence, we incorporated
modules responsible for generating textual messages to give
rationales for recommendations. Each sentence of the
accompanying message consists of the following information:
item type; recommended item; context.</p>
        <p>The message is generated in the form of a textual
template. Future improvements of CARE will consider
increasing the serendipity aspect of the recommendations by
generating more advanced and surprising commentaries for the
outputs.</p>
        <p>The messages generated by all the modules that analyzed
the situation from di erent perspectives are aggregated in
one template and presented to the user as a message.</p>
        <p>Producing a textual explanation containing descriptions
from all former steps of algorithm:</p>
        <p>Hi John! You might like a comedy "Le Concert" as it
is something in your taste. You might like a drama like
"Shutter Island" because it is evening. Maybe you feel like
watching a comedy like "Intouchables" because it is summer?</p>
        <p>CONCLUSIONS AND FUTURE WORK
We proposed an architecture to generate context-aware
recommendations along with accompanying rationales to help
the user choose the most interesting item. In CARE
(ContextAware Recommender with Explanation), the
recommendation process is performed hierarchically, and with
transparency at each abstraction level so as to produce detailed
explanations for the suggested choices. Our approach
promotes a diversity of recommendation results since each piece
of contextual information is analyzed separately, and the
most appropriate items are recommended with a rationale
accompanying each suggestion.</p>
        <p>Our architecture enables one to implement a exible and
generic recommender systems that can easily be extended
with new independent modules in a hierarchical structure.
In the current stage of our research, we have tested the
performance of the CARE prototype on a movie-ratings
dataset. Following the suggestions of a domain expert, we
plan to extend the system with modules that incorporate
other diverse movie features such as the director, cast,
atmosphere and so on. We also plan to follow the Interaction
Design principles during the evaluation of our system and
will perform user testing with a working system. In future
work, we will also address the evaluation of results quality
with standard methods such as RMSE or nDCG.</p>
        <p>Our approach is applicable to other domains as well.
Currently we are working on adapting this architecture for
supporting legal decision making, and moral and ethical
reasoning.
8.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Pandora</surname>
          </string-name>
          . http://www.pandora.com,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>[2] Net ix dataset</article-title>
          . http://www.net ixprize.
          <source>com/</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>G.</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Tuzhilin</surname>
          </string-name>
          .
          <article-title>Context-aware recommender systems</article-title>
          .
          <source>In Proceedings of the 2008 ACM Conference on Recommender Systems, RecSys '08</source>
          , pages
          <fpage>335</fpage>
          {
          <fpage>336</fpage>
          , New York, NY, USA,
          <year>2008</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Tuzhilin</surname>
          </string-name>
          .
          <article-title>Context-aware recommender systems</article-title>
          .
          <source>In Recommender Systems Handbook</source>
          , pages
          <volume>217</volume>
          {
          <fpage>253</fpage>
          .
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Balabanovic</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shoham</surname>
          </string-name>
          . Fab:
          <article-title>Content-based, collaborative recommendation</article-title>
          .
          <source>Commun. ACM</source>
          ,
          <volume>40</volume>
          (
          <issue>3</issue>
          ):
          <volume>66</volume>
          {
          <fpage>72</fpage>
          ,
          <string-name>
            <surname>Mar</surname>
          </string-name>
          .
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <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 ltering</article-title>
          .
          <source>In Proceedings of the Third ACM Conference on Recommender Systems, RecSys '09</source>
          , pages
          <fpage>245</fpage>
          {
          <fpage>248</fpage>
          , New York, NY, USA,
          <year>2009</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <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 ltering using item splitting</article-title>
          .
          <volume>24</volume>
          (
          <issue>1-2</issue>
          ):7{
          <fpage>34</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bridge</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. H. G oker</surname>
          </string-name>
          , L.
          <string-name>
            <surname>McGinty</surname>
            , and
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Smyth</surname>
          </string-name>
          .
          <article-title>Case-based recommender systems</article-title>
          .
          <source>The Knowledge Engineering Review</source>
          ,
          <volume>20</volume>
          :
          <fpage>315</fpage>
          {
          <issue>320</issue>
          , 9
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R.</given-names>
            <surname>Burke</surname>
          </string-name>
          .
          <article-title>Hybrid recommender systems: Survey and experiments</article-title>
          .
          <source>User Modeling</source>
          and
          <string-name>
            <surname>User-Adapted</surname>
            <given-names>Interaction</given-names>
          </string-name>
          ,
          <volume>12</volume>
          (
          <issue>4</issue>
          ):
          <volume>331</volume>
          {
          <fpage>370</fpage>
          ,
          <string-name>
            <surname>Nov</surname>
          </string-name>
          .
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Cooper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Reimann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Cronin</surname>
          </string-name>
          . About Face:
          <article-title>The Essentials of Interaction Design</article-title>
          . John Wiley &amp; Sons, Inc., New York, NY, USA,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D. D.</given-names>
            <surname>Corkill</surname>
          </string-name>
          .
          <article-title>Blackboard systems</article-title>
          .
          <source>AI Expert</source>
          ,
          <volume>6</volume>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A. H.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Shan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ruan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Zuo</surname>
          </string-name>
          .
          <article-title>The design and implementation of an intelligent apparel recommend expert system</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>B. S.</given-names>
            <surname>Francesco</surname>
          </string-name>
          <string-name>
            <surname>Ricci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Lior</given-names>
            <surname>Rokach</surname>
          </string-name>
          .
          <article-title>Introduction to recommender systems handbook</article-title>
          . In F. Ricci,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          , and P. B. Kantor, editors,
          <source>Recommender Systems Handbook</source>
          , pages
          <fpage>1</fpage>
          <lpage>{</lpage>
          35.
          <string-name>
            <surname>Springer</surname>
            <given-names>US</given-names>
          </string-name>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>G.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N.</given-names>
            <surname>Yorke-Smith</surname>
          </string-name>
          .
          <article-title>A novel bayesian similarity measure for recommender systems</article-title>
          .
          <source>In Proceedings of the Twenty-Third International Joint Conference on Arti cial Intelligence</source>
          ,
          <source>IJCAI '13</source>
          , pages
          <fpage>2619</fpage>
          {
          <fpage>2625</fpage>
          . AAAI Press,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Karatzoglou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Amatriain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Baltrunas</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N.</given-names>
            <surname>Oliver</surname>
          </string-name>
          .
          <article-title>Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative ltering</article-title>
          .
          <source>In Proceedings of the fourth ACM conference on Recommender systems</source>
          , pages
          <volume>79</volume>
          {
          <fpage>86</fpage>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Bell</surname>
          </string-name>
          .
          <article-title>Advances in collaborative ltering</article-title>
          . In F. Ricci,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          , and P. B. Kantor, editors,
          <source>Recommender Systems Handbook</source>
          , pages
          <volume>145</volume>
          {
          <fpage>186</fpage>
          .
          <string-name>
            <surname>Springer</surname>
            <given-names>US</given-names>
          </string-name>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lops</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. De Gemmis</surname>
            , and
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          .
          <article-title>Content-based recommender systems: State of the art and trends</article-title>
          .
          <source>In Recommender systems handbook</source>
          , pages
          <volume>73</volume>
          {
          <fpage>105</fpage>
          .
          <string-name>
            <surname>Springer</surname>
            <given-names>US</given-names>
          </string-name>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <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>Kosir</surname>
          </string-name>
          . In G. Adomavicius, editor,
          <source>Proceedings of the 4th Workshop on Context-Aware Recommender Systems in conjunction with the 6th ACM Conference on Recommender Systems (RecSys</source>
          <year>2012</year>
          ), volume
          <volume>889</volume>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>L.</given-names>
            <surname>Qin</surname>
          </string-name>
          and
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhu</surname>
          </string-name>
          .
          <article-title>Promoting diversity in recommendation by entropy regularizer</article-title>
          .
          <source>In Proceedings of the Twenty-Third International Joint Conference on Arti cial Intelligence</source>
          ,
          <source>IJCAI '13</source>
          , pages
          <fpage>2698</fpage>
          {
          <fpage>2704</fpage>
          . AAAI Press,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          , and P. B. Kantor, editors.
          <source>Recommender Systems Handbook</source>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ruiz-Iniesta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Jimenez-D az</surname>
          </string-name>
          , M.
          <string-name>
            <surname>Gomez-Albarran</surname>
          </string-name>
          , et al.
          <article-title>A framework for the rapid prototyping of knowledgebased recommender systems in the learning domain</article-title>
          .
          <source>Journal of Research and Practice in Information Technology</source>
          ,
          <volume>44</volume>
          (
          <issue>2</issue>
          ):
          <fpage>167</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>J.</given-names>
            <surname>Sabater</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and J. M.</given-names>
            <surname>Vidal</surname>
          </string-name>
          .
          <article-title>A Protocol for a Distributed Recommender System</article-title>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>A.</given-names>
            <surname>Said</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Berkovsky</surname>
          </string-name>
          , and E. W. De Luca.
          <article-title>Introduction to special section on camra2010: Movie recommendation in context</article-title>
          .
          <source>ACM Trans. Intell. Syst. Technol.</source>
          ,
          <volume>4</volume>
          (
          <issue>1</issue>
          ):
          <volume>13</volume>
          :1{
          <issue>13</issue>
          :9,
          <string-name>
            <surname>Feb</surname>
          </string-name>
          .
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>J.</given-names>
            <surname>Schafer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Frankowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Herlocker</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Sen</surname>
          </string-name>
          .
          <article-title>Collaborative ltering recommender systems</article-title>
          . In P. Brusilovsky,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kobsa</surname>
          </string-name>
          , and W. Nejdl, editors,
          <source>The Adaptive Web</source>
          , volume
          <volume>4321</volume>
          of Lecture Notes in Computer Science, pages
          <volume>291</volume>
          {
          <fpage>324</fpage>
          . Springer Berlin Heidelberg,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>N.</given-names>
            <surname>Tintarev</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Mastho</surname>
          </string-name>
          .
          <article-title>Designing and evaluating explanations for recommender systems</article-title>
          . In F. Ricci,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          , and P. B. Kantor, editors,
          <source>Recommender Systems Handbook</source>
          , pages
          <volume>479</volume>
          {
          <fpage>510</fpage>
          .
          <string-name>
            <surname>Springer</surname>
            <given-names>US</given-names>
          </string-name>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>K.</given-names>
            <surname>Verbert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Parra-Santander</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Brusilovsky</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Duval</surname>
          </string-name>
          .
          <article-title>Visualizing recommendations to support exploration, transparency and controllability</article-title>
          .
          <source>In Proceedings of the 2013 international conference on Intelligent user interfaces - IUI '13, page 351</source>
          . ACM Press,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>Y.</given-names>
            <surname>ZHANG</surname>
          </string-name>
          , H. Liu, and
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>A Distributed Collaborative Filtering Recommendation Mechanism for Mobile Commerce Based on Cloud Computing</article-title>
          .
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R. D.</given-names>
            <surname>Burke</surname>
          </string-name>
          .
          <article-title>The role of emotions in context-aware recommendation</article-title>
          . In L. Chen,
          <string-name>
            <surname>M. de Gemmis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Felfernig</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Lops</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Ricci</surname>
          </string-name>
          , G. Semeraro, and M. C. Willemsen, editors,
          <source>Decisions@RecSys</source>
          , volume
          <volume>1050</volume>
          <source>of CEUR Workshop Proceedings</source>
          , pages
          <volume>21</volume>
          {
          <fpage>28</fpage>
          . CEUR-WS.org,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>C.-N. Ziegler</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          <string-name>
            <surname>McNee</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          <string-name>
            <surname>Konstan</surname>
            , and
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Lausen</surname>
          </string-name>
          .
          <article-title>Improving recommendation lists through topic diversi cation</article-title>
          .
          <source>In Proceedings of the 14th International Conference on World Wide Web, WWW '05</source>
          , pages
          <fpage>22</fpage>
          {
          <fpage>32</fpage>
          , New York, NY, USA,
          <year>2005</year>
          . ACM.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>