<!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>An Experiment in Cross-Representation Mediation of User Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Federica Cena</string-name>
          <email>federica.cena@unito.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cristina Gena</string-name>
          <email>cristina.gena@unito.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Claudia Picardi</string-name>
          <email>claudia.picardi@unito.it</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Università degli Studi di Torino</institution>
          ,
          <addr-line>Dipartimento di Informatica, Torino -</addr-line>
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Università degli Studi di Torino</institution>
          ,
          <addr-line>Dipartimento di Informatica, Torino -</addr-line>
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Università degli Studi di Torino</institution>
          ,
          <addr-line>Dipartimento di Informatica, Torino -</addr-line>
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper presents the result on cross-representation mediation of user models in the context of movie recommendation. We analyze the possibility of initializing the user models for a content-based recommender starting from movie ratings provided by users in other social applications. We focus in particular on (i) an approach for inferring user model preferences from rating and (ii) the experimentation of several methods to determine default user-model preferences from community-based ratings. We tested di erent variations of the proposed approach exploiting a subset of the MovieLens 10M Dataset, computing rating predictions, and analyzing the mean absolute error between such predictions and the actual ratings provided by users. The results show that the approach is in general feasible, with MAEs decreasing for users who provided more ratings and stabilizing around 0.15. They also show that community-based ratings are best used by inferring from them an \average user model", whose preferences can ll in missing values from individual user models.</p>
      </abstract>
      <kwd-group>
        <kwd>Information systems ! Recommender systems</kwd>
        <kwd>Social recommendation</kwd>
        <kwd>Social networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        Nowadays not only users leave a large amount of ratings
spread among several web sites, but also the same items
(e.g., movies, books, songs, hotels, restaurants, etc.) are
rated several times in di erent systems, from e-commerce
web sites to social network systems. On the one side, if a
user is new in a target system (i.e., has few to none rated
items), but has a rating history in another source system
in the same domain, the already rated items can be
imported and used to recommend relevant items in the
target domain [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. Moreover, knowledge acquired in a source
domain could be transferred and exploited in another
target domain. Cantador et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] propose to leverage all the
available user data provided in various systems and domains
in order to generate a more complete user model and
better recommendations, resulting in the so-called cross-domain
recommendation.
      </p>
      <p>
        On the other side, as a practical application of knowledge
transfer in the context of a single domain (e.g. movies), a
target system may import user ratings of overlapping items
from a source system as auxiliary data, in order to address
the data-sparsity problem, which is a common challenging
problem in many newly launched collaborative ltering (CF)
recommenders, see for example [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
      </p>
      <p>For instance, if a company decides to launch a new movie
CF recommender, it might import user ratings from another
CF recommender in order to have an initial and reliable
rating matrix. Such data is made available by several sources:
MovieLens1 makes its ratings and its rating matrix
publicly available, while theMovieDB 2 provides a large movies
database rich of information regarding movies such as title,
cast, images, keywords, trailers, similar movies, ratings and
so on, available through a public API. In this way a source
system may be used to overcome the cold start problem
related to users and items,</p>
      <p>
        Cantador et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] de ne this situation as the system
coldstart problem (system bootstrapping), related to situations
in which a recommender is unable to generate
recommendations due to an initial lack of user preferences. They propose
as possible solution to bootstrap the system with preferences
from another source outside the target domain by
transferring rating patterns.
      </p>
      <p>
        Information imported from a source system, for instance
a CF movie recommender, could be also used to initialize a
content-based (CB) recommender. This approach has been
de ned as (cross-representation) mediation of user models,
which is typical from CF to CB recommender systems [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
According to this approach, a CB recommender system,
having partial or no user model (UM) data, can generate
recommendations for users by mediating UM data of the same
users, collected by a CF system. The mediation process
transforms the UMs from the representation used by the
CF recommender (i.e. ratings) to the content-based
repre1https://movielens.org/
2https://www.themoviedb.org/
sentation (i.e. expressions of interest toward item features).
The mediation process exploits the item descriptions that
are typically not used by CF recommender systems. Such
user model mediation may o er a potential solution to
mitigate the cold-start and sparsity problems in recommender
systems, and it may also help avoiding the paradox of the
active user [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], which recommender systems may su er from:
Users often refuse to visit the sites that ask them to reply to
an interview rst (or ll in forms and questionnaires, rating
long list of items, etc.) because they would save time getting
their immediate task done. However, user model mediation
does not solve the problem of missing values in the user
model at the beginning of the interaction. While it is true
that missing values in a user model can be predicted by a
content-based approach, this can be done after the user has
made a certain amount of interaction of the system. In a
CF scenario, instead, a common solution for these problems
is to ll the missing ratings with default values such as the
middle value of the rating range, and the average user or
item rating, see [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
      </p>
      <p>
        In this paper we experiment with an approach that
combines some of the solutions described above. We in fact
analyze a cross-representation mediation method which, in
the context of movie recommendations. imports knowledge
on items and users from external sources, on order to avoid
asking users for information on their tastes. The knowledge
on users is in the form of user ratings, as it comes from
a CF movie recommender (in our case, MovieLens). The
user model is inferred from such ratings. In this respect,
the task is analogous to the one described in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], although
our algorithm for inferring the user model, and for
generating rating predictions, is di erent. Also, we enrich the
inferred user models with default values, computed from other
users' data imported again from external sources. We
experimented with several approaches to compute such default
values. Default values are also useful in the extreme case
where no information is present in the user model. When a
new user registers into the system she may not wish to (or
be able to) provide access to her data (explicitly given, or
from other sources); in this case we have a reticent user. In
this situation, the system will ll the missing user model
values with the default values coming from the community of
users. As soon as the user's interest value become available,
this will override community's interest values.
      </p>
      <p>To summarize, this paper provides experimental results
on:
the exploitation of user model mediation to enable a
warm start in a cross-system recommendation scenario,
thus avoiding the well known cold start problem in
recommender systems and the paradox of active users.
the exploitation of di erent strategies for calculating
default values, which are generated starting from
values of the user community of the system, in order to
solve the problem of missing values in the user model,
which is especially problematic in the early
interactions.</p>
      <p>This paper is organized as follows: Section 2 describes
our general approach and motivations; Section 3 present
related work in the eld; Section 4 describes the user modeling
approach, and the methods we experimented with for
computing default values; Section 5 describes the experiments
and their results; and Section 6 presents some discussion on
future work and concludes the paper.
2.</p>
    </sec>
    <sec id="sec-2">
      <title>BACKGROUND AND APPROACH</title>
      <p>The approach presented in this paper has been inspired by
the development of ReAL CODE3 (Recommendation Agent
for Local Contents in an Open Data Environment), a movie
social network and a movie recommender system. ReAL
CODE retrieves information from external sources, such as
Facebook and TheMovieDatabase, and automatically maps
it into its own knowledge base.</p>
      <p>
        In particular ReAL CODE is designed to import user
data from Facebook as bootstrapping information to
initialize the user model at the beginning of the interaction,
to solve the cold start problem and to avoid the paradox of
the active user. We consider actions that users can make
on movies within Facebook: in particular we consider
ratings, expressed on a 1-5 rating scale4. Information imported
from Facebook is used to initialize the CB user model, which
however could be in principle enriched with ratings coming
from other sources as well. In ReAL CODE, user model
interest values are then updated by considering all the
possible user actions as an implicit source of interest following
an approach similar to the one described in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. A detailed
description of this system is out of the scope of this paper,
but we presented the system as it was the context of the
experiments described in the paper.
      </p>
      <p>The content-based user model of ReAL CODE (see Sec.
4) contains the user interest towards all the features of the
\movie" object. The \movie" object is represented by means
of the following ve main features:
genres, whose values are taken from the genres
taxonomy of TheMovieDB containing 17 values;
tags, that are keywords assigned by users to the movie
actors, who play roles in the movie;
directors, that direct the movie;
production countries, countries in which the movie has
been produced and those in which has been distributed.</p>
      <p>Notice that both the above features and the related data
set are imported from TheMovieDB, which is in fact the
main source for the movie knowledge base of the system.</p>
      <p>
        For each imported rating (user; movie; rating), our goal is
to propagate the rating values to the features characterizing
movie in the user model of user. Sec. 4 details the
propagation method. This mediation is inspired by the work of
Berkovsky et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], with a di erent approach concerning
user model extraction. As is it suggested in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], a
collaborative ltering UM in the movie domain comprises a set
of movie ratings explicitly provided by the user. The CF
user model may contains information as fStar wars:1, Blade
runner:0.8, Serendipity:0.2, Sleepless in Seattle: 0.2g, where
the movie ratings are translated on a continuous scale
ranging between 0 and 1. Although this collaborative ltering
UM represents the user with only a few rating, it can be
3http://www.realcode.it/. ReAL CODE is a research
project funded in the context of POR FESR 2007/2013 of
the Piedmont Region, Italy.
4We do not consider other input from Facebook.
hypothesized that the user likes science- ction movies and
dislikes romantic comedies. Hence, the content-based UM
of this user may be fscience- ction:0.9, romantic comedy:
0.2g, where the genre weights are computed as an average
of the ratings for the movies from this genre. Similarly to the
genre weights, Berkovsky et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] propose that the weights
of other movie features, such as directors, producers, and
actors, can be inferred from ratings.
      </p>
      <p>Regarding recommendations, suggestions are given using a
content-based approach, as will be described in section 5.</p>
      <p>
        According to the classi cation by Cantador et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] our
system can be classi ed as i) a cross-system recommender
since items may correspond across di erent systems, and
users may overlap in a single domain (i.e., movie); ii) a cross
(representation) mediator (from CF to a CB approach).
To summarize, our system:
is designed to import domain data (e.g., movie
description) from external sources;
is designed to import user ratings from another (source)
system in order to overcome the cold start problem of
the user model, and the paradox of active user;
mediate the imported user data from a rating
representation to a content-based representation;
      </p>
      <p>ll the missing values of the user model with default
values generated starting from the user community, as
will be described in Section 4. Since at the
beginning, the system, as usual, will miss community data,
we propose to bootstrap the system with rating
values coming from a source system (in particular we
exploited the MovieLens data set). This solution may
also help in solving the data sparsity problem. As soon
as real user data become available, user data will
override community and user data.</p>
      <p>Notice that, we could also use the Facebook data for
bootstrapping the system community, as example, the ratings
given by the user's friends. However, from our initial
testing, this approach does not completely solve the problem of
missing values, since rating coming from user's friends may
be extremely sparse.</p>
    </sec>
    <sec id="sec-3">
      <title>RELATED WORK</title>
      <p>In this article, we investigate the idea of user model
transfer as a way to infer missing user models values for new users
or reticent ones.</p>
      <p>
        First, we present a study on cross-representation
mediation of user models from collaborative ltering to
contentbased between di erent systems in the same domain, in
order to address the new user problem. This issue takes place
when a user starts to use a new recommender, which has
no knowledge of the user's interests and is not therefore
able to provide recommendations. This can be addressed
by transferring user models created in another (source)
system, \translating" and importing them to the target
system. Many works exploit cross-system personalization for
this goal, such as [
        <xref ref-type="bibr" rid="ref1 ref11 ref16 ref19 ref2 ref20 ref22 ref23 ref3 ref4">23, 1, 20, 19, 4, 2, 3, 16, 11, 22</xref>
        ].
      </p>
      <p>
        User model transfer can happen in di erent ways,
depending on representation modalities: the simpler case is when
the representation modalities are the same, while the case
when representation modalities are di erent (e.g., from CF
to CB) is more complex and needs some form of
\translation" or mediation. The most favorable scenario implies that
di erent systems share user preferences of the same type
and the same type of representation. This scenario was
addressed, for example, by Berkovsky et al. with a mediation
strategy for cross-domain collaborative ltering [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ].
      </p>
      <p>
        An example of user model transfer from CB to CB is
provided by Wongchokprasitti et al. [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], who compare di
erent transfer strategies in an academic information setting
where the source system is a search system for scienti c
papers and the target system is a system for sharing academic
talks. Both systems represent the user with keyword-based
user models. Another example is provided by Abel et al.
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] where users are modelled exploiting their Social Web
activities in di erent systems (tags-based and form-based user
models).
      </p>
      <p>
        When data coming from the source system have a di erent
representation, a cross-representation mediation is necessary
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Mediation aims at resolving the heterogeneity in the
representations of the same user for the same item in the same
context. In this paper we propose an approach to this issue:
inferring the CB user model from user ratings coming from
a CF system. A similar approach is the one by Berkovsky et
al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which proposes a mediation framework by importing
and integrating in a CB system the data collected by CF
systems. Here the authors discuss an approach that seems
particularly e ective for users with a small number of
ratings. This suits their goals, as they aim at replacing the CB
recommendation with a CF recommendation once the user
has provided a larger number of rating. Our approach di ers
from theirs in (i) how we infer the user model, (ii) how we
apply it in order to compute rating predictions and (iii) how
we treat the case of missing values in the user model. Also
our goal is di erent, as we are interested in CB
recommendations that are e ective also for users with larger numbers
of ratings,.
      </p>
      <p>
        The problem of lling in missing ratings/user's interest
values in recommender systems, both for new and reticent
users, is discussed by several authors. One possible solution
is to ll the value with community-based preferences from
another source outside the target system [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In CF
recommenders, in particular, the missing ratings of items are lled
with default values [
        <xref ref-type="bibr" rid="ref12 ref6">6, 12</xref>
        ], such as the middle value of the
rating range, or the average user or item rating.
      </p>
      <p>We adopt a similar approach (i.e. using community-based
information), but we combine it with cross-representation
mediation (i.e. the community-based information is a set of
ratings from which we infer user model default preferences).</p>
      <p>
        This is in line with the idea of social information access
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], i.e., methods for organizing users past interaction within
an information system, in order to provide better access to
information to the future users of the system. Usually, this
approach has been used for improving search results, for
example re-ordering link using social wisdom, suggest
additional results found by earlier searches or providing
social annotations of search results based on link popularity
or past link selection by other users [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Another
application is adaptive community-based course planning, to
provide personalized access to course information and provide
social recommendation about courses [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
4.
      </p>
    </sec>
    <sec id="sec-4">
      <title>USER MODEL</title>
      <p>As already discussed, our goal is to infer the user model
for content-base recommendation from a set of movie
ratings the user may have provided either within the system
itself, or in other systems | possibly collaborative- ltering
recommenders, collecting movie ratings as part of the user
pro le.</p>
      <p>In order to do this, we rst need to describe how each
item - in our case, movie - is described.
4.1</p>
    </sec>
    <sec id="sec-5">
      <title>Movie Description</title>
      <p>As it is common in content-based systems, each movie m,
besides being characterized by an id and a title, is further
described by a set of features desc(m) = fF1; : : : ; Fng where
each feature Fi is a pair (category; value).</p>
      <p>In our experiments, we extracted movie descriptions from
TheMovieDB5 and focused on the following set of categories:
FCat = fgenre; directors; actors; production country; tagsg:
In extracting the actor features, we limited ourselves to the
ve actors identi ed as main cast.
4.2</p>
    </sec>
    <sec id="sec-6">
      <title>User Model Extraction</title>
      <p>For each user u, her user model UM(u) is constituted by
two functions:
the interest function intu : Features ! [0; 1]
expresses the interest of user u in a certain feature F
as a real number in the [0; 1] interval;
the action count function actu : Features ! N
counts the number of action user u performed within
the system that are pertinent to a certain feature F .</p>
      <p>Given a set of movie ratings provided by user u on a scale
[l; u], we denote by mov(u) the set of movies rated by u, and
by rat(u; m) the normalization on a [0; 1] scale of the true
rating originally given by u. Moreover, for a given feature F ,
we denote by mov(ujF ) the set of movies rated by u having
F in their description; formally mov(ujF ) = fm 2 mov(u) j
F 2 desc(m)g.</p>
      <p>We then compute interest and action count as follows:
actu(F ) =
intu(F ) =
jmov(ujF )j;
P
mi2movies(ujF ) ri :
actu(F )
(1)
(2)</p>
      <p>As an example, let us suppose F = (actor; Ewan McGregor)
and that a user u has rated three movies with this F in their
description:</p>
      <p>Trainspotting
Moulin Rouge!
Star Wars - Episode I
there are a lot of possible di erent feature values. As the
number of ratings provided by the user grows larger, the
number of missing values decreases; however there are bound
to be missing values even for user models inferred from a
large number of ratings.</p>
      <p>In order to tackle this problem, we chose to test a
communitybased approach where a default interest function intdef is
computed from other users' ratings. Such function is used
in place of intu whenever we need to evaluate a feature F
with actu(F ) = 0.</p>
      <p>We experimented with three methods, resulting in three
di erent default interest functions:</p>
      <p>Middle value: the external ratings are used to
compute a global average rating. If ratings were given
randomly in the [0; 1] interval, this value would be 0.5.
However it is well known that users tend to use more
frequently higher ratings than lower ones, as either
they do not rate things they do not like, or - being
good recommenders to themselves - they do not watch
movies that are evidently not to their tastes. The
default interest function intmid is in this case a constant,
and it is equal to the global average rating.</p>
      <p>Average user: the external ratings are used as if they
all belonged to the same user, to infer - in the same
way described above - an average user model, with its
own interest function intave. This \average" interest
function is then used as default.</p>
      <p>Notoriety-based: it may be argued that, if a
feature does not appear among a user ratings, it is
because that user never watches - and therefore never
rates - movies with that feature. So, absence from
the user model may suggest a dislike. On the other
hand, a feature may be absent from the user model
because it is not very common and therefore the user
has never encountered it, so she does not know whether
she likes it or not. In order to take into account these
di erent situations, we use external ratings to de ne
a notoriety measure for each feature. The notoriety
ntr(F ) of a feature F with category C is therefore
computed as the number of ratings given to movies with F
in it, normalized by the maximum notoriety achieved
within C in order to obtain a value between 0 and
1. The default interest function then is computed as:
intntr(F ) = intmid(F ) ntr(F ).</p>
      <p>We denote by intu+def the interest function obtained
combining a given user's interest function intu with a default
interest function intdef:
intu+def(F ) =
(intu(F ) if actu(F ) &gt; 0
intdef
otherwise.
5.</p>
    </sec>
    <sec id="sec-7">
      <title>EVALUATION</title>
      <p>
        We evaluated our approach using the MovieLens 10M Dataset
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] and, in order to compare our results with existing work,
we replicated the experimental settings by Berkovsky et al.
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The main di erence with their settings relies on the
dataset. In fact Berkovsky et al. exploited the EachMovie
dataset, storing 2,811,983 ratings of 72,916 users on 1,628
(a) Comparison of weight sets with intmid as default interest function.
(b) Comparison of weight sets with intave as default interest function.
(c) Comparison of weight sets with intntr as default interest function.
movies, which is no longer available.; nonetheless,
MovieLens is an evolution of this dataset.
      </p>
      <p>Therefore in our evaluation all users are regarded as \new"
to our system (which has no information on them prior to
user model extraction), while movies are assumed to be
already described within our system (i.e. user model
extraction does not have to deal with\new" movies).</p>
      <p>We rst randomly selected 5000 users from the MovieLens
DB, whose 701017 samples were used as community ratings
to compute the three default interest functions intmid, intave,
and intntr, according to the three di erent methods (middle
value, average user, notoriety-based) described in the
previous section.</p>
      <p>We then created 10 groups of 325 users according to the
number of ratings available for each of them. The rst group
contained users with 1 to 25 samples, the second group
contained users with 26 to 50 samples, and so on, up to the
tenth group, containing users with 226 to 250 samples. The
325 users in each group were randomly selected among those
with the proper number of samples.</p>
      <p>For each group i = 1; : : : ; 10 we randomly split users
samples into ten subsets j = 1; : : : ; 10 to be analyzed for ten-fold
cross-evaluation: in fold j, the evaluation set Eij coincided
with the j-th subset, while the training set Tij contained all
the remaining samples. Thus for each user, 9=10 of her
samples were used for the training set, while the remaining 1=10
was used for the evaluation set.</p>
      <p>For each user in each group, we extracted from her
training set a user model, as described in section 4.2. We then
run a basic content-based recommender on the movies in
the users' evaluation set, and obtained rating predictions.
Finally, we computed the mean absolute error (MAE)
between such predictions and the actual ratings provided by
the user herself.</p>
      <p>In order to ensure the statistical signi cance of the
observed di erences between approaches, we performed a paired
t-test for each hypothesis of the form \approach X has a
lower MAE than approach Y on group i".
that is, as the normalized weighed sum of feature category
scores scorec(u; m). Each feature category score is in turn
computed as the average interest the user has for the movie
features associated with category c:
scorec(u; m) =</p>
      <p>PF 2desc(m);cat(F )=c intu+def(F )
jfF 2 desc(m)jcat(F ) = cgj
:</p>
      <p>As to the weights used in formula (3), we experimented
with two weight sets:</p>
      <p>Equal weights, all categories (EQ): wc = 1 for
every feature category c;
Equal weights, excluding production country
category (FS): wc = 0 for c = production country; wc =
1 for all other categories.</p>
      <p>
        The second weight set exploits the feature selection
analysis presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], whose results lead the authors to exclude
from their content-based recommender two categories:
production country and language. The latter, however, does
not belong to our category set FCat.
      </p>
      <p>As an example, let us suppose we want to recommend the
movie The Men Who Stare at Goats to a user u with the
following pertinent interest values in her user model:
(genre; comedy)
(actor; Ewan McGregor)
(actor; George Clooney)
(production country; us)
(tag; new age)</p>
      <p>Some features are missing from the user model; therefore
we need to resort to the default interest function. Let us
suppose we are using the intmid function, which assigns to
all features the constant value 0:706.</p>
      <p>With the combined interest function intu+mid we can now
score the ve categories:
scoreproduction country
scoregenre
scoreactor
scoredirector
scoretag</p>
      <p>We tested each combination of a default interest method
(mid, ave, ntr ) and a weight set (EQ, FS). For each
combination we repeated the experiment ten times, each with a
di erent partition of the initial samples between training and
evaluation sets (ten-fold cross evaluation). We then checked
the resulting MAEs for each pair of combinations in order
to test the statistical signi cance of their di erences.</p>
      <p>For each combination, we plotted the average MAE of
each user group. In all the following diagrams, MAE values
are represented on the vertical axis, while the number of
ratings provided by users (i.e., user groups) are represented
on the horizontal axis.</p>
      <p>Figure 1 shows the comparison, for each default interest
method, of the two weight sets, while gure 2 shows the
comparison, for each weight set, of the three default interest
methods.</p>
      <p>We see that with both weight sets the intave default
function provides the best results ( gure 2). Also, with both
weight sets the middle value method (mid ) outperforms the
notoriety-based approach (ntr ). The observed di erences
are statistically signi cant: for the FS diagram (a), t 3:828
corresponding to a con dence 99:9%, while for the EQ
diagram (b) t 2; 908, corresponding to a con dence 99%.</p>
      <p>On the other hand, excluding the production country
category ( gure 1) does not result in signi cant changes in
MAEs. While we can observe, in the case of default function
intave, a consistently lower average MAE for the FS weights,
the observed di erence is statistically signi cant with
condence 95% (t 2:16) only for user groups with more
than 125 samples. This should not be taken as a negative
result with respect to feature selection, since it shows that
excluding the production country category does not
generally a ect the prediction accuracy, even improving it under
some circumstances.</p>
      <p>
        Figure 3 compares our best-performing combination (FS+ave)
with the results in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which in turn compared their
crossrepresentation mediation approach (CBFS) with a standard
collaborative ltering technique (CF) applied to the same
data. The cross-representation mediation approach proposed
by Berkovsky and colleagues obtains a lower MAE for users
with less than 70 samples; for more than 70 samples,
predictions tend to worsen as the number of samples increases,
stabilizing approximately at 0.20.
(a) Comparison of default interest methods with EQ weight set.
(b) Comparison of default interest methods with FS weight set.
      </p>
      <p>
        We can see in gure 3 that our approach e ectively
contrasts the tendency to obtain worse predictions for users
with larger training sets. Although it could be expected
that using a default interest function would signi cantly
improve rating predictions (in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] features missing from the user
model are simply ignored), it is interesting to notice that
such improvements appears to be more evident for larger
training sets, where the user model is bound to be richer
and the impact of the default interest function should
consequently be lower. This suggests that the improvements
we see are at least partly due to our di erent approach in
extracting the user model.
      </p>
      <p>
        However, for users with 1 to 25 samples, i.e., for the
smaller training sets, the CBFS approach in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] obtains a
lower MAE (approximately 0.16 vs. approximately 0.17).
This suggests that a combination of the two may be more
e ective than each separately.
      </p>
    </sec>
    <sec id="sec-8">
      <title>DISCUSSION AND CONCLUSION</title>
      <p>In this paper we discussed the results of an
experimental study on cross-representation mediation of user models
in the context of movie recommendation. The goal was to
analyze the possibility of initializing the user models for a
content-based recommender starting from movie ratings
provided by users in other social applications. While previous
ratings are commonly used as user model in
collaborativeltering approaches, in order to determine user similarity,
content-based recommenders need the user model to express
an \interest function", associating with each possible feature
in the domain items characterization a value expressing the
interest of the user for the feature itself.</p>
      <p>In our study we focused in particular on two points
concerning content-based user models:</p>
      <p>An algorithm to infer a content-based user model from
the user's previous ratings. Such an algorithm can be
exploited both to initialize the user model from the
ratings she provided to other (not necessarily
recommender) applications, and to maintain the user model
without explicitly asking for her preferences in terms
of movie features.</p>
      <p>A comparison of di erent methods for determining a
default interest function from community ratings, to
be used when the user's previous ratings do not
allow to infer an interest value for a certain feature. In
particular we experimented with a xed default value
established as the average of all community ratings,
with a default user model inferred by considering the
whole community as a single user, and with a mixed
approach based on the notoriety of a feature.</p>
      <p>Both the user model inference algorithm and the default
interest function are particularly useful in case of system
bootstrapping. The user model can be initialized importing
data the same user provided to other applications.
Whenever these are insu cient, default values from community
ratings can be used.</p>
      <p>
        We benchmarked our experimental results against the
approach discussed in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], recreating a similar experimental
settings and comparing the mean average error (MAE). The
analysis shows that:
      </p>
      <p>
        As it could be expected, the MAE decreases when the
user model is inferred from a larger number of ratings
(the approach presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] has the opposite
behavior).
      </p>
      <p>The best results (lowest MAE) are obtained when the
default interest function is computed as a default user
model, inferred from community ratings by considering
the overall community as a single user.</p>
      <p>
        The feature selection results presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] prove
useful in our case too, as removing the unselected features
provides similar, when not better, MAEs.
      </p>
      <p>
        For users with a number of previous ratings higher
than 25 (up to 250 in our analysis), our system
improves over [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and the improvement grows with the
number of ratings. For users with less than 25 ratings,
the approach presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] has a lower MAE.
      </p>
      <p>
        These results open the door to several further
investigations. A rst line of inquiry goes in the direction of
combining our approach with [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], in order to bene t from the
advantages of both. In fact, the two algorithms for user model
inference take into account quite di erent aspects, and this
is re ected in the di erent behavior they exhibit when used
in recommendation. As future work, we will implement their
approach using the MovieLens dataset, in order two have the
two studies completely comparable.
      </p>
      <p>A second study may investigate the possibility of using
community ratings for ne tuning the weight of each feature
category, rather than adopting the coarser approach of
feature selection, where each category basically weights either
1 (selected) or 0 (discarded).</p>
      <p>Finally, is better to remind that the system here described
has been presented as it was in the context of the experiment
detailed in the paper. As described, in the running system
the user model is initialized getting user data from Facebook
as bootstrapping information at the beginning of the
interaction, while the community values are bootstrapped in the
way we described in the paper. In the future, we can
further investigate the bene t of using the data coming from
the preferences of the user's friends, which could be mixed
with the ratings coming from the bootstrapping community,
since Facebook data are in general too sparse for covering
all the user's model missing values. However, our system is
designed to acquire data from di erent sources, both for the
user model, and regarding the community values used for
the system bootstrapping. Thus, in the future, we may also
consider other sources of information to replace or complete
the ones here described.
7.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            <surname>Abel</surname>
          </string-name>
          , E. Herder,
          <string-name>
            <given-names>G.-J.</given-names>
            <surname>Houben</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Henze</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Krause</surname>
          </string-name>
          .
          <article-title>Cross-system user modeling and personalization on the social web</article-title>
          .
          <source>User Modeling</source>
          and
          <string-name>
            <surname>User-Adapted</surname>
            <given-names>Interaction</given-names>
          </string-name>
          ,
          <volume>23</volume>
          (
          <issue>2</issue>
          ):
          <volume>169</volume>
          {
          <fpage>209</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Berkovsky</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Ku ik, and</article-title>
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Cross-domain mediation in collaborative ltering</article-title>
          . In C. Conati,
          <string-name>
            <given-names>K.</given-names>
            <surname>McCoy</surname>
          </string-name>
          , and G. Paliouras, editors,
          <source>User Modeling</source>
          <year>2007</year>
          : 11th International Conference, UM 2007, Corfu, Greece,
          <source>July 25-29</source>
          ,
          <year>2007</year>
          . Proceedings, pages
          <volume>355</volume>
          {
          <fpage>359</fpage>
          , Berlin, Heidelberg,
          <year>2007</year>
          . Springer Berlin Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Berkovsky</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Ku ik, and</article-title>
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Distributed collaborative ltering with domain specialization</article-title>
          .
          <source>In Proceedings of the 2007 ACM Conference on Recommender Systems, RecSys '07</source>
          , pages
          <fpage>33</fpage>
          {
          <fpage>40</fpage>
          , New York, NY, USA,
          <year>2007</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Berkovsky</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Ku ik, and</article-title>
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Mediation of user models for enhanced personalization in recommender systems</article-title>
          .
          <source>User Model. User-Adapt. Interact.</source>
          ,
          <volume>18</volume>
          (
          <issue>3</issue>
          ):
          <volume>245</volume>
          {
          <fpage>286</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Berkovsky</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Ku ik, and</article-title>
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Cross-representation mediation of user models</article-title>
          .
          <source>User Model. User-Adapt. Interact.</source>
          ,
          <volume>19</volume>
          (
          <issue>1-2</issue>
          ):
          <volume>35</volume>
          {
          <fpage>63</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Breese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Heckerman</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Kadie</surname>
          </string-name>
          .
          <article-title>Empirical analysis of predictive algorithms for collaborative ltering</article-title>
          .
          <source>In Proceedings of the Fourteenth Conference on Uncertainty in Arti cial Intelligence</source>
          ,
          <source>UAI'98</source>
          , pages
          <fpage>43</fpage>
          {
          <fpage>52</fpage>
          , San Francisco, CA, USA,
          <year>1998</year>
          . Morgan Kaufmann Publishers Inc.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>Brusilovsky</surname>
          </string-name>
          .
          <article-title>Social information access: The other side of the social web</article-title>
          . In V. Ge ert, J. Karhumaki,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bertoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Preneel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Navrat</surname>
          </string-name>
          , and M. Bielikova, editors,
          <source>SOFSEM 2008: Theory and Practice of Computer Science: 34th Conference on Current Trends in Theory and Practice of Computer Science</source>
          , Novy Smokovec, Slovakia, January
          <volume>19</volume>
          -
          <issue>25</issue>
          ,
          <year>2008</year>
          . Proceedings, pages
          <volume>5</volume>
          {
          <fpage>22</fpage>
          , Berlin, Heidelberg,
          <year>2008</year>
          . Springer Berlin Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>I.</given-names>
            <surname>Cantador</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Fernandez-Tob as, S. Berkovsky, and</article-title>
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          .
          <source>Recommender Systems Handbook, chapter Cross-Domain Recommender Systems</source>
          , pages
          <fpage>919</fpage>
          {
          <fpage>959</fpage>
          .
          <string-name>
            <surname>Springer</surname>
            <given-names>US</given-names>
          </string-name>
          , Boston, MA,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>F.</given-names>
            <surname>Carmagnola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Cena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Console</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Cortassa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Goy</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Torre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Toso</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Vernero</surname>
          </string-name>
          .
          <article-title>Tag-based user modeling for social multi-device adaptive guides. User Model. User-Adapt</article-title>
          . Interact.,
          <volume>18</volume>
          (
          <issue>5</issue>
          ):
          <volume>497</volume>
          {
          <fpage>538</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Carroll and M. B. Rosson</surname>
          </string-name>
          .
          <article-title>Paradox of the active user. In Interfacing thought: cognitive aspects of human-computer interaction</article-title>
          , pages
          <volume>80</volume>
          {
          <fpage>111</fpage>
          . The MIT Press, Cambridge, MA,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Quadrana</surname>
          </string-name>
          .
          <article-title>Cross-domain recommendations without overlapping data: Myth or reality</article-title>
          ?
          <source>In Proceedings of the 8th ACM Conference on Recommender Systems, RecSys '14</source>
          , pages
          <fpage>297</fpage>
          {
          <fpage>300</fpage>
          , New York, NY, USA,
          <year>2014</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>M.</given-names>
            <surname>Deshpande</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Karypis</surname>
          </string-name>
          .
          <article-title>Item-based top-n recommendation algorithms</article-title>
          .
          <source>ACM Trans. Inf</source>
          . Syst.,
          <volume>22</volume>
          (
          <issue>1</issue>
          ):
          <volume>143</volume>
          {
          <fpage>177</fpage>
          ,
          <string-name>
            <surname>Jan</surname>
          </string-name>
          .
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R.</given-names>
            <surname>Farzan</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Brusilovsky</surname>
          </string-name>
          .
          <article-title>Social navigation support in a course recommendation system</article-title>
          . In V. P. Wade,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ashman</surname>
          </string-name>
          , and B. Smyth, editors,
          <source>Adaptive Hypermedia and Adaptive Web-Based Systems: 4th International Conference, AH 2006</source>
          , Dublin, Ireland, June 21-23,
          <year>2006</year>
          . Proceedings, pages
          <volume>91</volume>
          {
          <fpage>100</fpage>
          , Berlin, Heidelberg,
          <year>2006</year>
          . Springer Berlin Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Harper</surname>
          </string-name>
          and
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          .
          <article-title>The movielens datasets: History and context</article-title>
          .
          <source>ACM Transactions on Interactive Intelligent Systems</source>
          ,
          <volume>5</volume>
          (
          <issue>4</issue>
          ):
          <fpage>19</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>X.</given-names>
            <surname>Xue</surname>
          </string-name>
          .
          <article-title>Can movies and books collaborate?: Cross-domain collaborative ltering for sparsity reduction</article-title>
          .
          <source>In Proceedings of the 21st International Jont Conference on Arti cal Intelligence</source>
          ,
          <source>IJCAI'09</source>
          , pages
          <year>2052</year>
          {
          <year>2057</year>
          , San Francisco, CA, USA,
          <year>2009</year>
          . Morgan Kaufmann Publishers Inc.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nakatsuji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fujiwara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tanaka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Uchiyama</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Ishida</surname>
          </string-name>
          .
          <article-title>Recommendations over domain speci c user graphs</article-title>
          .
          <source>In Proceedings of the 2010 Conference on ECAI 2010: 19th European Conference on Arti cial Intelligence</source>
          , pages
          <fpage>607</fpage>
          {
          <fpage>612</fpage>
          , Amsterdam, The Netherlands, The Netherlands,
          <year>2010</year>
          . IOS Press.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>X.</given-names>
            <surname>Ning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Desrosiers</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Karypis</surname>
          </string-name>
          .
          <source>Recommender Systems Handbook, chapter A Comprehensive Survey of Neighborhood-Based Recommendation Methods</source>
          , pages
          <volume>37</volume>
          {
          <fpage>76</fpage>
          .
          <string-name>
            <surname>Springer</surname>
            <given-names>US</given-names>
          </string-name>
          , Boston, MA,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>W.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. W.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. N. N.</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yang</surname>
          </string-name>
          .
          <article-title>Transfer learning in collaborative ltering for sparsity reduction</article-title>
          .
          <source>In Proceedings of the 24th AAAI Conference on Arti cial Intelligence</source>
          ,
          <source>AAAI'10</source>
          , pages
          <fpage>210</fpage>
          {
          <fpage>235</fpage>
          . AAAI Press,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sahebi</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Brusilovsky</surname>
          </string-name>
          .
          <article-title>Cross-domain collaborative recommendation in a cold-start context: The impact of user pro le size on the quality of recommendation</article-title>
          .
          <source>In Proceedings of the 21st Conference on User Modeling, Adaptation and Personalization, Umap13</source>
          , pages
          <fpage>289</fpage>
          {
          <fpage>295</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Freilikhman</surname>
          </string-name>
          .
          <article-title>Facebook single and cross domain data for recommendation systems</article-title>
          .
          <source>User Modeling</source>
          and
          <string-name>
            <surname>User-Adapted</surname>
            <given-names>Interaction</given-names>
          </string-name>
          ,
          <volume>23</volume>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>B.</given-names>
            <surname>Smyth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Freyne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Coyle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Briggs</surname>
          </string-name>
          , and
          <string-name>
            <surname>E. Balfe.</surname>
          </string-name>
          <article-title>I-spy | anonymous, community-based personalization by collaborative meta-search</article-title>
          . In F. Coenen,
          <string-name>
            <given-names>A.</given-names>
            <surname>Preece</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A</surname>
          </string-name>
          . Macintosh, editors,
          <source>Research and Development in Intelligent Systems XX: Proceedings of AI2003, the Twenty-third SGAI International Conference on Innovative Techniques and Applications of Arti cial Intelligence</source>
          , pages
          <fpage>367</fpage>
          {
          <fpage>380</fpage>
          , London,
          <year>2004</year>
          . Springer London.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>A.</given-names>
            <surname>Tiroshi</surname>
          </string-name>
          and
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Ku ik. Domain ranking for cross domain collaborative ltering</article-title>
          . In J. Mastho ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mobasher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Desmarais</surname>
          </string-name>
          , and R. Nkambou, editors,
          <source>User Modeling</source>
          , Adaptation, and Personalization: 20th International Conference,
          <string-name>
            <surname>UMAP</surname>
          </string-name>
          <year>2012</year>
          , Montreal, Canada,
          <source>July 16-20</source>
          ,
          <year>2012</year>
          . Proceedings, pages
          <volume>328</volume>
          {
          <fpage>333</fpage>
          , Berlin, Heidelberg,
          <year>2012</year>
          . Springer Berlin Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>C.</given-names>
            <surname>Wongchokprasitti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Peltonen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ruotsalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bandyopadhyay</surname>
          </string-name>
          , G. Jacucci, and
          <string-name>
            <given-names>P.</given-names>
            <surname>Brusilovsky</surname>
          </string-name>
          .
          <article-title>User model in a box: Cross-system user model transfer for resolving cold start problems</article-title>
          . In F. Ricci,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bontcheva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Conlan</surname>
          </string-name>
          , and S. Lawless, editors,
          <source>User Modeling, Adaptation and Personalization: 23rd International Conference, UMAP 2015</source>
          , Dublin, Ireland, June 29 { July 3,
          <year>2015</year>
          . Proceedings, pages
          <volume>289</volume>
          {
          <fpage>301</fpage>
          ,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          ,
          <year>2015</year>
          . Springer International Publishing.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>