<!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>A Bayesian User-Controllable Recommender System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jonathas Magalhães</string-name>
          <email>jonathas@copin</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Federal University of Campina Grande</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this research, we propose a Bayesian User-Controllable Recommender System. Our approach allows the user to control the contextual information, i.e., the user can de ne the content (other users and items) and parameters (users, items, novelty and popularity) used by the recommender to compute predictions. To demonstrate the usefulness of our proposal, we present di erent scenarios where we change the context con guration and discuss the system outputs. The student was supervised by Evandro Costa { Federal University of Alagoas &amp; Joseana Fechine { Federal University of Campina Grande.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>MOTIVATION AND RESEARCH CHAL</title>
    </sec>
    <sec id="sec-2">
      <title>LENGES</title>
      <p>
        Historically, the main goal of the Recommender Systems
(RS) have been increasing the accuracy of the
recommendation [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. However, the RS's accuracy is not always
correlated with a good user experience with the system [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
User experience is de ned as the analysis of the human
factors captured through user's interaction with the RS, e.g.,
user satisfaction and user engagement [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. A strategy to
enhance the user experience in RS is to give the control of
the system to the user. For example, Knijnenburg et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
allow users to order the recommendation list according to
di erent attributes in a RS of best practices for energy
efciency. Some approaches allow their users to modify the
content that will be used by the RS [
        <xref ref-type="bibr" rid="ref2 ref6">2, 6</xref>
        ]. Another line
of work, using hybrid models, allows their users to modify
the weights assigned to each recommender via sliders, e.g.,
[
        <xref ref-type="bibr" rid="ref10 ref4">10, 4</xref>
        ]. However, the e ects caused by giving the control to
the users and how they are related to the user characteristics
are issues that still need investigation.
      </p>
      <p>
        In this research, we address these issues by proposing an
approach to RS that allows the user to control the system.
Our research challenges are: (i) How to de ne the RS
elements controllable by the user? (ii) How to design a user
interface to capture the user's preferences? (iii) How to
dene the computational techniques used in the RS? (iv) How
to represent the items and users in the system? and (v) How
to validate our approach via user study? Until now, we have
de ned a Bayesian user-controllable model and apply it in
the scienti c paper recommendation. Our proposal is based
on the concept of context, Context-Aware RS make use of
contextual information with the aim of improving the
recommendation. Contextual information is any information
that could be used to impact the accuracy of
recommendation, e.g., climate weather information, demographic
information [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In our model, users can control the elements
(researchers and papers) that will be used as content to
generate the recommendations. Furthermore, users can setting
up the parameters weights of the RS, such as, users, items,
novelty and popularity. To demonstrate the utilization of
our approach, we present scenarios where we illustrate the
use of the system, i.e., showing the system inputs and
discussing the outputs. In summary, we aim to achieve the
following contributions for the eld: (i) a new
recommendation method to capture user preferences; (ii) a new user
interface for RS; and (iii) we intend to bring more evidence
on the relationship among the size of the control given to
the user, the user experience and the user characteristics.
2.
      </p>
    </sec>
    <sec id="sec-3">
      <title>RELATED WORK</title>
      <p>
        The analysis of the controllability in RS is a relatively
recent topic at the same time that is gaining more attention
from the academy. Knijnenburg et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] study the e ects
of di erent mechanisms of interaction in a RS for energy
saving. They conclude that the best interaction mechanism
depends on the user characteristics: more experienced users,
who had more domain knowledge had preferences for more
controllable interfaces, e.g., hybrid and explicit mechanisms.
In contrast, less experienced users opted for interfaces with
less controllable, e.g., non-personalized methods.
      </p>
      <p>
        Bostandjiev et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] present the TasteWeights, a
controllable hybrid RS of music that integrates the content from
three sources, Wikipedia, Facebook and Twitter. Their
results indicate that using their proposed interface to
explain the hybrid process of recommendation increased the
user satisfaction. Knijnenburg et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] also explore the
TasteWeights, they use the musics liked by the user in
Facebook (items) and the user's Facebook contacts (users). They
conclude that the controllability led to a better user
experience, however the di erences between the two types of
control, items and users, was not statistically signi cant.
      </p>
      <p>
        Harper et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] study the user controllability in the
context of movie recommendation using the MovieLens system.
They allow the users to control the weight of two variables,
the popularity of the movie and and the year of movie
release. They did not nd an overall optimization of
parameters that works for all users, simply, some users prefer to
change the con guration of the recommendation list and
others not. Also considering the MovieLens system, the
work of Ekstrand et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] allows the user to choose among
four algorithms, one to be used. However, the authors found
no evidence that would lead a user to choose a particular
algorithm.
      </p>
      <p>
        Considering article recommendation, Parra and Brusilovsky
[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] present the SetFusion, a controllable graphical interface
composed by sliders, where the users could assign weights to
di erent RS algorithms. In addition, the interface showed a
Venn diagram, indicating which algorithm was predominant
on the recommendation calculation. Their results indicated
that users were engaged and had a better user experience
with the controllable interface, however the e ect was
signi cant only in the case that the user has gained experience
with the basics of the system, i.e., the users who used the
controllable interface after the non-controllable.
      </p>
    </sec>
    <sec id="sec-4">
      <title>PROGRESS TO DATE</title>
      <p>We de ne a model that gives the RS control to the users
and, thus, they will be able to de ne the elements and
parameters that will be used as input by the recommendation
model. We use the following contextual information: Users
{ this variable concerns the researchers who are saved in the
system, the user can de ne which researchers she wants to
include into the context. Thus, to calculate the prediction
of the items, the RS will give more importance to the items
similar to those included researchers. Items { this attribute
represents the items that the user can insert into the context,
thus the RS will search for similar articles to compose the
recommendation list. Novelty { this variable is related to
how much novelty a paper has, e.g., we consider that survey
paper have a low level of novelty. Likewise, newer papers
receive a higher value than the new older articles.
Popularity - this attribute is de ned by how popular a paper
is, we consider that the more citations the article has, the
more popular it will be and increase the chance of it being
recommended.</p>
      <p>
        De nitions { Let U = fu1; :::; ujUjg; jU j &gt; 0 be the set of
all users in the systems and let D = fd1; :::; djDjg be the set
of all documents in the system. Each document dj 2 D has
three attributes represented by a 3-tuple dj = (sj ; yj ; rj ),
where sj represents a textual description of the document,
yj indicates the year that the document was released, and
rj 0 indicates the number of citations of the document.
Each user ui 2 U has a set Pi = fpi;1; :::; pi;jPijg; jPij 0,
that represents her portfolio. Each item pi;l 2 Pi has two
attributes pi;l = (si;l; yi;l), where si;l represents a textual
description of the document and yi;l yd indicates the year that
the item was included in her portfolio Let T = ft1; :::; tjT jg
be the set of terms used to index the documents and to
represent user pro les. So, each document dj 2 D is represented
by the vector d~j = (wj;1; :::; wj;jT j), where wj;k 0
represents the importance of the term tk 2 T to the document
dj . The user ui 2 U has a pro le denoted by the vector
u~i = (wi;1; :::; wi;jT j), where wi;k 0 represents the
importance of the term tk 2 T to the user ui. Each user ui 2 U
has a set Ci = fci;1; :::; ci;jCijg, 0 jCij 10 of contexts,
where a context ci;m 2 Ci is de ned by a 7-tuple ci;m =
ftitlei;m; Ui;m; Di;m; useri;m; itemi;m; novi;m; popi;mg , where:
titlei;m { is a not-empty string that represents the context
title; Ui;m U; 0 jUi;mj 5 and Di;m D; 0 jDi;mj 5
{ are, respectively, the researchers set and the items set
inserted by the user ui into the context ci;m; useri;m, itemi;m,
novi;m, popi;m 2 [0; 1] { represent, respectively, the weights
assigned by the user to the attributes Users, Items, Novety,
Popularity of the context ci;m. To build the user pro les
u~i; u~2; :::; u~jUj, we adopt our approach published in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. So,
given a user ui, we create the user portfolio Pi using her
curriculum vitae, i.e., resume, formation, projects and
production. We crawl the user curriculum vitae from the
CVLattes (http://lattes.cnpq.br/) and merged it with DBLP
publications. To index the items and create the vectors
d~1; d~2; :::; dj~Dj, we use the TF-IDF procedure, more details
can be found in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. In the rest of this section, when we
present the equation sim, we are referring to the cosine
similarity between two vectors.
      </p>
      <p>The Bayesian Network { The RS is a Bayesian
Network (BN), wherein for each available paper for
recommendation is created one BN that calculates its prediction for
the given context. This prediction is obtained by the value
of the variable P rediction of the BN, and it is in uenced
by four variables of the context, U sers, Items, P opularity
and N ovelty. Each context variable, receives the in uence
of two variables, one corresponding to a user's preference
and another related to an item feature. All BN nodes have
two states, T rue and F alse, the BN has four types of node:
Prediction node { in the BN, only the node Prediction
is such, it represents the predictive value of an item to a
user in a given context. In other words, the higher the value
of P (P rediction) greater will be the predicted value of the
item to the user. Parameter nodes { this type of node
represents the parameters used in the RS, the nodes of this
type are parents of the node Prediction. We de ne four
parameters, Users, Items, Popularity and Novelty, so we
create a node with the same name for each parameter. Each
node of this type has two parents, one representing a user
preference and another representing an item feature. User
preference nodes { this type of node represents the weight
given by the user to a speci c parameter, i.e., it serves as an
interface between the user and the model. There are four
nodes of this type, UserUsers, UserPopularity, UserNovelty
and UserItems. Item feature nodes { such node
represents a paper feature. There are four nodes of this type, one
for each parameter, ItemUsers, ItemPopularity, ItemNovelty
and ItemItems.</p>
      <p>
        To de ne the conditional probabilities of the Prediction
node, we follow the approach de ned by Zapata and Greer
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Their approach simpli es conditional probabilities
definition by simply de ning the in uence of each parent node
on the child node. In this work, we admit that all Parameter
nodes have a strong in uence on the Prediction node. To
de ne the conditional probabilities of the Parameter nodes
we use the Noisy-AND strategy with = 0:05 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Figure 1
presents the BN and its conditional probabilities tables.
      </p>
      <p>Computing the item prediction { Firstly, the user
preference nodes are calibrated by the values given by the
user on the context. Then, the weights inserted by the user
are mapped to the BN as follows: P (U serU sers) = useri;m,
P (U serItems) = itemi;m, P (U serN ovelty) = novi;m and
P (U serP opularity) = popi;m. This con guration of the BN
will be valid for the context ci;m while the user does not
perform new changes in their weights. Then, for each
available paper for recommendation, we make a copy of the BN
and modify the weights of its item feature nodes according
to the paper features. Given a document dj 2 D, in the
following we present how the item feature nodes, ItemUsers,
ItemItems, ItemNovelty and ItemPopularity, are calibrated.</p>
      <p>ItemUsers node { Given the users set Ui;m U created
by the user ui in the context ci;m and the paper dj 2 D, the
weight of this node is obtained by the average of the
similarities between the document dj and the users u 2 Ui;m:</p>
      <p>
        Pu2Ui;m sim(d~j;u~)
P (ItemU sers) = jUi;mj . ItemItems node {
Given the items set Di;m D of the context ci;m created
by the user ui, its weight is calculated by the average of the
similarities between the document dj and the documents
Pd02Di;m sim(d~j;d~0)
d0 2 Di;m: P (ItemItems) = jDi;mj .
ItemNovelty node { We calculate its weight using the auxiliary
BN presented in Figure 2. The weights of the BN also
follow the Zapata and Greer's approach [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], where nodes
ItemYear and ItemSurvey have a strong in uence on the node
ItemNovelty. We calculate the weight of the node
ItemSurvey analyzing the document description sj, if the
description contains the terms survey or review, your weight will
be P (ItemSurvey) = 0, otherwise P (ItemSurvey) = 1.
The weight of the node ItemYear is calculated based on
the date of publication yj of the item dj: P (ItemY ear) =
0:9ynow yj , where ynow is the current year.
ItemPopularity node { The weight of this node is proportional to
the number of citations rj of the document dj. Let R =
(r1:::; rjDj) be a list of all citation numbers of the papers
dj 2 D, so, we calculate the probability P (ItemP opularity)
according to:
      </p>
      <p>P (ItemP opularity) =
if rj 2]Q1(R); Q2(R)]; (1)
80 if rj = 0;
&gt;
&gt;
&gt;&gt;0:25 if rj 2]0; Q1(R)];
&gt;
&lt;</p>
      <p>0:5
&gt;&gt;&gt;0:75 if rj 2]Q2(R); Q3(R)];
&gt;
:&gt;1 otherwise,
where Q1(R); Q2(R); Q3(R) are, respectively, the 1st, 2nd
and 3rd quartiles of the list R.</p>
      <p>Scenarios { For each scenario we present the model input
and discuss its outputs. Table 1 presents the papers we
use in the scenarios to compose the recommendation list.
Table 2 presents the models outputs for all scenarios.</p>
      <p>Scenario 1 { In this rst scenario, which consists of the
most basic case, we suppose that the user started and saved
a context without changing the parameters. So, the context
ci;m is set up with the following parameters: Ui;m = ?,
Di;m = ?, useri;m = 0:5, itemi;m = 0:5, novi;m = 0:5
and popi;m = 0:5. We can see from the Table 2 that the
paper d2 has the best balance of P opularity and N ovelty,
so, therefore it is on the top of the list.</p>
      <p>
        Scenario 2 { Now, assume that the user has made the
following changes in the context. She added the researcher
D. Parra, the papers [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and changed the con
guration to give more importance to the U sers variable. Thus,
the context will have the following con guration: Ui;m =
fD:P arrag, Di;m = f[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]g, useri;m = 1:0, itemi;m =
0:3, novi;m = 0:3 and popi;m = 0:3. Thus, rst we
calculate the similarities among the papers and the elements that
may be used in context, Table 1 displays such similarities.
Note that the values shown in Table 1 are illustrative and
may vary according to the dataset used. It also presents
the probabilities P (ItemU sers) and P (ItemItems).
Verifying Table 2, we can see that the recommendation order has
been modi ed, this was because the article d3 has a greater
similarity with the elements in the context.
      </p>
      <p>
        Scenario 3 { In this scenario, we assume that the user
wants to receive more similar items to the papers she
inserted into the context. Thus, the user changes the context
to: Ui;m = fD:P arrag, Di;m = f[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]g, useri;m = 0:3,
itemi;m = 1:0, novi;m = 0:3 and popi;m = 0:3. We can see
in Table 2 that the list ordering has changed and the paper
d2 is on the top of the list, because it has higher similarity
with the items d 2 Di;m.
      </p>
      <p>
        Scenario 4 { Now, the user is concerned with the
popularity of the recommended papers and change the context
to the following con guration: Ui;m = fD:P arrag, Di;m =
f[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]g, useri;m = 0:3, itemi;m = 0:3, novi;m = 0:3 and
popi;m = 1:0. Analyzing Table 2, we verify that the papers
are ordered by the citation number, then the paper with
more citations, d1, is on the top of the list now.
      </p>
      <p>
        Scenario 5 { In this last scenario, the user wants more
recency papers, i.e., paper with novelty, thus she modi es
the context to: Ui;m = fD:P arrag, Di;m = f[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]g,
useri;m = 0:3, itemi;m = 0:3, novi;m = 1:0 and popi;m =
0:3. In this con guration, the paper d2 assumes the top of
.
the list, because it is a relatively new paper and it is not a
survey, and it presents a good balance among variables.
      </p>
    </sec>
    <sec id="sec-5">
      <title>FUTURE WORK</title>
      <p>For future work, we aim two steps, the rst one is to de ne
a controllable interface for the user to manage her contexts.
Basically, the interface must provides the following features
to the users: (i) create a context; (ii) set up a context (iii)
save a context; (iv) delete a context; (v) duplicate a context;
and (vi) provide feedback on the recommendation. In the
second step, we aim to perform a user study in laboratory.
Thus, we must de ne the experiment planning, i.e., de ne
the procedure, subjects, variables, statistical tests, etc.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <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>
          .
          <source>Recommender Systems Handbook, chapter Context-Aware Recommender Systems</source>
          , pages
          <fpage>217</fpage>
          {
          <fpage>253</fpage>
          .
          <string-name>
            <surname>Springer</surname>
            <given-names>US</given-names>
          </string-name>
          , Boston, MA,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bostandjiev</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. O'Donovan</surname>
            , and
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Ho</surname>
          </string-name>
          <article-title>llerer. Tasteweights: A visual interactive hybrid recommender system</article-title>
          .
          <source>In Proceedings of the Sixth ACM Conference on Recommender Systems, RecSys '12</source>
          , pages
          <fpage>35</fpage>
          {
          <fpage>42</fpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Ekstrand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kluver</surname>
          </string-name>
          ,
          <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>Letting users choose recommender algorithms: An experimental study</article-title>
          .
          <source>In Proceedings of the 9th ACM Conference on Recommender Systems, RecSys '15</source>
          , pages
          <fpage>11</fpage>
          {
          <fpage>18</fpage>
          , New York, NY, USA,
          <year>2015</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Harper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kaur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Condi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Terveen</surname>
          </string-name>
          .
          <article-title>Putting users in control of their recommendations</article-title>
          .
          <source>In Proceedings of the 9th ACM Conference on Recommender Systems, RecSys '15</source>
          , pages
          <fpage>3</fpage>
          {
          <fpage>10</fpage>
          , New York, NY, USA,
          <year>2015</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Henrion</surname>
          </string-name>
          .
          <article-title>Some Practical Issues in Constructing Belief Networks</article-title>
          . In L. N. Kanal,
          <string-name>
            <given-names>T. S.</given-names>
            <surname>Levitt</surname>
          </string-name>
          , and
          <string-name>
            <surname>J. F</surname>
          </string-name>
          . Lemmer, editors,
          <source>Uncertainty in Arti cial Intelligence</source>
          <volume>3</volume>
          , pages
          <fpage>161</fpage>
          {
          <fpage>173</fpage>
          . North-Holland,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>B. P.</given-names>
            <surname>Knijnenburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bostandjiev</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>O'Donovan, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Kobsa</surname>
          </string-name>
          .
          <article-title>Inspectability and control in social recommenders</article-title>
          .
          <source>In Proceedings of the Sixth ACM Conference on Recommender Systems, RecSys '12</source>
          , pages
          <fpage>43</fpage>
          {
          <fpage>50</fpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B. P.</given-names>
            <surname>Knijnenburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. J.</given-names>
            <surname>Reijmer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Willemsen</surname>
          </string-name>
          .
          <article-title>Each to his own: How di erent users call for di erent interaction methods in recommender systems</article-title>
          .
          <source>In Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys '11</source>
          , pages
          <fpage>141</fpage>
          {
          <fpage>148</fpage>
          , New York, NY, USA,
          <year>2011</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          .
          <article-title>Recommender systems: From algorithms to user experience. User Modeling</article-title>
          and
          <string-name>
            <surname>User-Adapted</surname>
            <given-names>Interaction</given-names>
          </string-name>
          ,
          <volume>22</volume>
          (
          <issue>1-2</issue>
          ):
          <volume>101</volume>
          {
          <fpage>123</fpage>
          ,
          <string-name>
            <surname>Apr</surname>
          </string-name>
          .
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Magalha</surname>
          </string-name>
          ~es,
          <string-name>
            <given-names>C.</given-names>
            <surname>Souza</surname>
          </string-name>
          , E. Costa, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Fechine</surname>
          </string-name>
          .
          <article-title>Recommending scienti c papers: Investigating the user curriculum</article-title>
          . In The Twenty-Eighth International Flairs Conference,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Parra</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Brusilovsky</surname>
          </string-name>
          .
          <article-title>User-controllable personalization: A case study with setfusion</article-title>
          .
          <source>International Journal of Human-Computer Studies</source>
          ,
          <volume>78</volume>
          :
          <fpage>43</fpage>
          {
          <fpage>67</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <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>Evaluating the e ectiveness of explanations for recommender systems</article-title>
          .
          <source>User Modeling</source>
          and
          <string-name>
            <surname>User-Adapted</surname>
            <given-names>Interaction</given-names>
          </string-name>
          ,
          <volume>22</volume>
          (
          <issue>4-5</issue>
          ):
          <volume>399</volume>
          {
          <fpage>439</fpage>
          ,
          <string-name>
            <surname>Oct</surname>
          </string-name>
          .
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>J.-D.</surname>
            Zapata-Rivera and
            <given-names>J. E.</given-names>
          </string-name>
          <string-name>
            <surname>Greer</surname>
          </string-name>
          .
          <article-title>Interacting with inspectable bayesian student models</article-title>
          .
          <source>International Journal of Arti cial Intelligence in Education</source>
          ,
          <volume>14</volume>
          (
          <issue>2</issue>
          ):
          <volume>127</volume>
          {
          <fpage>163</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>