<!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>From Recommendation to Curation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nevena Dragovic∗</string-name>
          <email>nevena.dragovic@markmonitor.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ion Madrazo Azpiazu</string-name>
          <email>ionmadrazo@boisestate.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maria Soledad Pera</string-name>
          <email>solepera@boisestate.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>MarkMonitor</institution>
          ,
          <addr-line>Boise, Idaho</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>People &amp; Information Research Team, Boise State University</institution>
          ,
          <addr-line>Boise, Idaho</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <abstract>
        <p>Curation is the act of selecting, organizing, and presenting content. Some applications emulate this process by turning users into curators, while others use recommenders to select items, seldom achieving the focus or selectivity of human curators. We bridge this gap with a recommendation strategy that more closely mimics the objectives of human curators. We consider multiple data sources to enhance the recommendation process, as well as the quality and diversity of the provided suggestions. Further, we pair each suggestion with an explanation that showcases why a book was recommended with the aim of easing the decision making process for the user. Empirical studies using Social Book Search data demonstrate the efectiveness of the proposed methodology.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>CCS CONCEPTS</title>
      <p>• Information systems → Recommender systems;</p>
    </sec>
    <sec id="sec-2">
      <title>INTRODUCTION</title>
      <p>Recommenders have been studied for decades. Regardless of the
domain, they influence businesses’ success and users’ satisfaction.
From a commercial standpoint, recommenders enable companies
to advertise items to potential buyers. From a user perspective,
they enhance users’ experience by easing identification of items
of interests while addressing information overload concerns. The
degrees of personalization recommenders ofer, however, can be
hindered by their limited ability to provide diverse enough
suggestions, restricting users’ exposure to new, prospective items of
interest. This occurs because common recommendation strategies
rely on community data, thus suggesting the same items to similar
users, which can be vague and impersonal.</p>
      <p>
        Inspired by the results of the work conducted by Willemsen et
al. [
        <xref ref-type="bibr" rid="ref45">45</xref>
        ], who demonstrated that “diverse, small item sets are just
as satisfying and less efortful to choose from than Top-N
recommendations," we argue that emulating the curation process—the act
of selecting, organizing, and presenting content [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]—to suggest a
∗Work conducted while the author was a student at Boise State.
small set of diverse items could lead to an enriched
recommendation process. In this paper, we present the algorithmic foundation
to make this possible, and facilitate future user studies. A number
of applications, e.g. Pinterest, let the user be the decision maker:
they ofer individualized selections and then allow the user play
the role of a curator in choosing appealing items. However, given
the ability of a recommender to collect and examine large amounts
of data about users and items, the system itself can get to know
users better—their interests and behaviors— and act as a curator.
      </p>
      <p>Due to scope limitations, we use books as a case study and
focus our research eforts on the techniques that lead to QBook, a
curated book recommender (Figure 1). QBook does not only find
books that are appealing to a user, but also presents a meaningful
set of suggestions with corresponding explanations that pertain
to the various preferences of the user. QBook takes the role of the
curator upon itself; make connections between suggested items and
the reasons for their selection; and enriches the recommendation
process by addressing issues that afect these systems: (1) Using
historical data, we capture suitable candidate items for each user;
(2) Understanding items’ metadata, we access potentially relevant
items that otherwise might be ignored by solely relying on ratings;
(3) Considering user reviews, we infer which item features each user
cares about and their degree of importance; (4) Examining experts’
reviews, we ensure overall quality of books to be recommended;
(5) Exploring the type of data sources a user favors, we learn about
the user and understand why he could be interested in an item;(6)
Analyzing users’ change in genre preferences over time, we better
identify the current reading interests of individual users.</p>
      <p>QBook can be seen as an interpretable diversification strategy for
recommendation, where evidence factors from (1)-(6) are combined
using a diversification technique adapted to each user’s interest.
Further, explanations on why each book was selected are provided
so that the user can better select the book he is interested in.</p>
      <p>
        With this work, we improve research related to recommenders by
combining traditional approaches with novel preference matching
methods into a single strategy that ofers suggestions containing
information related to the interests of each user. Moreover, we
explicitly undertake diversity and personalization–key aspects as
common collaborative filtering algorithms are known to not
propagate users’ preferences on diversity into their recommendations
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]—by exploring user reviews and time analysis to understand
change of reading preference in time. To assess the efectivenesses
of QBook we conduct experiments measuring the utility of
individual components as well as comparing the recommendation quality
of the system as a whole with respect to state-of-the-art systems.
      </p>
    </sec>
    <sec id="sec-3">
      <title>RELATED WORK</title>
      <p>
        We discuss work pertaining to book recommenders, as well as the
use of explanations and curation for recommendation purposes.
Recommenders &amp; Books. A number of recommenders have been
designed to generate suggestions that help users select suitable
books to read [
        <xref ref-type="bibr" rid="ref17 ref34 ref4">4, 17, 34</xref>
        ]. They are based on purchasing or rating
patterns, click-through data, content/tag analysis, or ontologies.
      </p>
      <p>
        Some book recommenders are tailored towards specific group of
users: By emulating the readers’ advisory service, the authors in
[
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] describe the process of recommending books for K-12 students,
based on the topics, contents, and literary elements that appeal to
each individual user, whereas K3Rec [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] uses information about
grade levels, contents, illustrations, and topics together with length
and writing style, to generate suggestions for emergent readers.
Garrido and Illarri [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] rely on content-based data for making book
suggestions. Their proposed TMR [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] examines items’ descriptions
and reviews and relies on lexical and semantic resources to infer
users’ preferences. However, TMR can only work if descriptions
and reviews are available, unlike QBook, for which these are only
two of the multiple data points considered in the recommendation
process. The authors in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] present a strategy based on graph
analysis and PageRank that exploits clicks, purchasing patterns, and
book metadata. This strategy is constrained to the existence of a
priori pairwise similarity between items, e.g. “similar products",
which is not a requirement for QBook. The authors in [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ] highlight
the importance of book recommenders as library services, and thus
propose a fuzzy analytical hierarchy process based on a priori rules
mining that depends upon the existence of book-loan histories. The
empirical analysis presented in [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ] is based on a limited and
private dataset, which constrains the task of verifying its applicability
on large-scale benchmark datasets. More importantly, the proposed
strategy is contingent on book-loan historical information that due
to privacy concerns libraries rarely, if at all, make available.
      </p>
      <p>
        Recommenders &amp; Explanations. An ongoing challenge faced
by recommenders is to get users to trust them, as they still operate as
“black boxes" [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. A powerful way to build successful relationships
between users and recommenders is by providing information on
how each system works and why items are suggested [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ]. This
can be accomplished by including explanations that justify the
suggestions, which are known to provide transparency and enhance
trust on the system [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ]. Unfortunately, justifying the reasons why
an item has been suggested to a user is not an easy task [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Recent
works in this area focus on determining how diferent types of
explanations influence users while making decisions [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Among
the most common strategies we should highlight those based on
exploring previous activity of a user [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], information collected from
user reviews [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ], and content-based tag cloud explanations. The
goal of QBook is to provide explanations that reveal reasoning and
data behind the recommendation process and contain other users’
and experts’ (objective) opinions on item characteristics that are of a
specific interest for each individual user. Many researchers consider
sentiment-based explanations as more efective, trustworthy, and
persuasive than the ones that capture relationship between previous
activity of the user and suggested items [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. We, however, follow
the premise presented in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and do not include sentiment in order
to make QBook look unbiased from users’ perspectives, i.e., we do
not select feature descriptions based on their polarity.
      </p>
      <p>
        Recommenders &amp; Curation. Few research works focus on
simulating the curation process for recommendation purposes
[
        <xref ref-type="bibr" rid="ref21 ref22 ref37">21, 22, 37</xref>
        ]. In [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], the authors discussed the development of a
news application that learns from users’ interactions with the
system while they swipe through provided news articles and like them.
In this research, the authors use social networks and users’
browsing history to create and recommend crowd curated content, but
using users as curators. The work conducted by Saaya et al. [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ],
on the other hand, relies on a content-based strategy that considers
information authors collect from users’ profiles, which are then
managed by the users themselves. The most recent study conducted
by Kislyuk at al. [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], combines a user-based curation method along
with a traditional collaborative filtering strategy to improve
Pinterest’s recommendation process. The aforementioned alternatives
simply let users organize suggested content based on their personal
preferences, since all three studies treat users as curators. However,
no recommendation system takes the role of the curator upon
itself. We take a diferent approach and allow the system to take the
curator role using existing user and item data.
3
      </p>
    </sec>
    <sec id="sec-4">
      <title>THE ANATOMY OF QBOOK</title>
      <p>Each step of QBook’s recommendation process addresses a
particular research problem on its own: Can item metadata complement
the lack of historical data (and vice versa)? How can a time
component influence recommendation systems?, Can experts’ opinions
align with readers’ preferences?, Are users’ features of interests a
valuable asset to a recommendation process?, How does curation
work as a part of a recommendation process?, Can personalized
explanation aid users in selecting relevant suggestions?.
3.1</p>
    </sec>
    <sec id="sec-5">
      <title>Selecting Candidate Books</title>
      <p>To initiate the recommendation process (described in Algorithm 1),
QBook identifies a set of books CB from a given collection to be
curated for a user U . The two strategies considered for candidate
selection (i.e., matrix factorization and content-based filtering)
complement each other and ensure diversity among candidate books.
While the former examines users’ rating patterns, the latter focuses
on books characteristics and does not require user-generated data.
Moreover, by considering rating patterns and content, novelty of
the recommendations increases, as users are exposed to a variety of
books to chose from. We anticipate QBook to handle data sparsity
and cold start in this step, since even if candidate books do not
Algorithm 1 The Recommendation Process of QBook
have (suficient) ratings assigned to them, they might still have tag
descriptions that can help the recommender determine if they are
indeed potentially of interest to a user and vice-versa.</p>
      <p>
        Matrix Factorization. To take advantage of U ’s historical data,
QBook adopts a strategy based on Matrix factorization [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
Specifically, it uses LensKit’s [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] FunkSVD for candidate generation and
includes in CB any book b for which its predicted rating for U (rU ,b )
is above 3–ensuring the potential appeal of b to U .
      </p>
      <p>
        Content Analysis. Content-based filtering methodologies
create suggestions by comparing items’ characteristics and users’
preferences. Available content representations (e.g., metadata) are used
to describe items, as well as users’ profiles based on items users
favored in the past [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]. QBooks uses tags, which capture books’
content from diverse users’ perspectives. Thereafter, it applies Lenskit’s
implementation of the content-based algorithm [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] (based on the
Vector Space Model and T F -I DF weighting scheme), and includes in
CB any book b for which its similarity with respect to U ’s content
preferences (CrU ,b ) is 3 or above.
      </p>
    </sec>
    <sec id="sec-6">
      <title>3.2 Getting to Know Users and Books</title>
      <p>
        QBook aims to provide U with a set of appealing, personalized
suggestions based on information he values. QBook examines reviews
written by U and identifies the set of literary elements (features)
that he cares the most about1. Thereafter, it determines the degree
to which each book in CB addresses U ’s features of interest. To
identify features of interest to U , QBook performs semantic analysis
on reviews and considers the frequency of occurrence of terms U
employs in his reviews. By adopting the set of literary elements and
the extraction strategy described in [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], QBook explores features
that characterize book content, such as character descriptions or
1If U does not have reviews, then the most popular user features are treated as U ’s
features of importance.
      </p>
      <p>Literary Element
characters
pace
storyline
tone
writing style
frame</p>
      <p>
        Sample of Related Terms
stereotypes, detailed, distant, dramatic
fast, slow, leisurely, breakneck, compelling
action-oriented, character-centered
happy, light, uplifting, dark, ironic, funny
austere, candid, classic, colorful
descriptive, minimal, bleak, light-hearted
writing style. As defined in [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], each literary element (i.e., feature)
is associated with a set of terms used to describe that element, since
diferent words can be used to express similar book elements. A
sample of literary elements and related terms is shown in Table 1.
      </p>
      <p>QBook computes the overall frequency of occurrence of each
feature mentioned by U by normalizing the occurrence of the feature
based on the number of reviews written by U . This score captures
the importance (i.e., weight) of each particular feature for U .</p>
      <p>On the same manner, QBook examines reviews available for b
following the process defined for identifying features of interest to
U , in order to gain a deeper understanding of the literary elements
that are often used to describe b. This is done by analyzing the
subjective opinions of all users who read and reviewed b.</p>
      <p>QBook leverages U ’s preferences in the recommendation process
by calculating the degree of similarity between U ’s feature
preferences and b’s most-discussed features, as Sim(U , b) =
U®V ·B®V
U®V × B®V
where U®V = &lt;WFU ,1 , ...,WFU ,n &gt; and B®V = &lt;WFb,1 , ...,WFb,m &gt; are
vector representations associated with feature discussions of U
and b, n and m are numbers of distinct features describing U and
b, respectively, and WFU ,i and WFb,i capture the weight, i.e.,
degree of importance, of the ith feature for U and b, based on their
normalized frequencies of occurrence (in reviews).</p>
      <p>By using Sim(U , b), QBook triggers the generation of
personalized suggestions, as it captures all features of interests for U and
compares them with the most-discussed features of b to determine
how likely b is relevant to U .</p>
    </sec>
    <sec id="sec-7">
      <title>3.3 Considering Experts’ Opinions</title>
      <p>To further analyze b, QBook takes advantage of experts’ reviews in
order to consider unbiased and objective opinions as another data
point in its recommendation process. Unlike the polarity-neutral
strategy adopted to identify user/item features of interest, in the
case of experts we explicitly examine the polarity of their
opinions. By doing so Qbook leverages expert knowledge to ensure that
recommended books are of good quality. QBook explores publicly
available book critiques to determine experts’ opinions on
candidate books by performing semantic analysis to examine which
books experts valued more. QBook examines ER, the set of expert
reviews available for b, from two complementary perspectives: it
captures sentiment at a word and sentence levels using two popular
sentiment analysis tools. By involving experts’ reviews in the
recommendation process, QBook can help overcome the data sparsity
issue, since some books do not have suficient user-generated data,
but have professional critiques which provide valuable information.</p>
      <p>
        Sentiment at Word Level. SentiWordNet [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] is a lexical
resource for opinion mining that assigns a sentiment score to each
WordNet synset. Using SentiWordNet, QBook determines ER’s
overall sentiment, denoted sW N r , by calculating an average score based
on the sentiment of each word in ER. Based on the study described
in [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ], and our own analysis, we observe that reviewers often
summarize their overall thoughts in the last sentence of their review.
For this reason, QBook also analyses the sentiment of the last
sentence in each review in ER and calculates its overage score, denoted
sW N s, to ensure the real tone of the review is captured.
      </p>
      <sec id="sec-7-1">
        <title>Sentiment at Sentence Level. In some cases, the polarity of</title>
        <p>
          a word on its own does not properly capture the intended
polarity of a sentence. Thus, QBook uses CoreN LP [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] which builds
up a representation of whole sentences based on their structure.
QBook applies CoreN LP ’ parser to extract sentences from ER and
calculates a sentiment score for each respective sentence. These
scores are combined into a single (average) score, denoted cN LPr ,
which captures the overall sentiment of ER based on the sentiment
of its individual sentences. Similar to the data points extracted at
word level, QBook also considers the average sentiment of the last
sentence in each review in ER, denoted cN LPs.
3.4
        </p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Incorporating a Time-Based Component</title>
      <p>
        To better serve their stakeholders, recommenders must predict
readers’ interest at any given time. Users’ preferences, however, tend to
evolve, which is why it is crucial to consider a time component to
create suitable suggestions [
        <xref ref-type="bibr" rid="ref44">44</xref>
        ]. QBook examines genre, which is a
category of literary composition, determined by literary technique,
tone, content, or even length, from a time-sensitive standpoint.
Including this component provides the likelihood of reader(s) interest
in each genre based on its occurrences at a specific point in the
past, not only the most recent or the most frequently read one.
QBook uses a genre prediction strategy2 that examines a genre
distribution and applies a time series analysis model, Auto-Regressive
Integrated Moving Average (ARI MA) [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]. In doing so, QBook can
discover diferent areas of U ’s reading preferences along with U ’s
degree of interest on each of them.
      </p>
      <p>Predicting genre preference to inform the recommendation
process involves examining genres read by U . We first obtain the genre
distribution among the books read by U during continuous periods
of time and estimate a significance score for each genre дn or U
at a specific time period t : GenreImportance= |дn,t,b | , where Gt is
|Gt |
the set of books read in t дn,t is the frequency of occurrence of a
specific genre among books in Gt , and |Gt | is a size of Gt .</p>
      <p>
        Since changes in reading activity between fixed and known
periods of time are not constant, QBook applies non-seasonal ARI MA
models. By doing this, QBook is able to determine a model tailored
to each genre distribution to predict its importance for U in real
time based on its previous occurrences. ARI MA forecasting (i.e.,
temporal prediction) model uses a specific genre distribution to
predict the likelihood of future occurrences of that genre based on
its importance in previous periods of time. This is why our strategy
conducts a search over possible ARI MA models that capture user
preference and selects the one with a best fit for a specific genre
distribution in time for U —the one that best describes the pattern
of the time series and explains how the past afects the future.
2We first discussed the benefits of explicitly considering changes in user preferences
over time in [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>Using ARIMA and genre information about books read by U ,
QBook can estimate the likelihood of occurrence of a given genre дn
at time frame TW , i.e., the recommendation time in our case. This
information is used to determine the degree to which U is interested
in reading each genre and subsequently the number of books in each
genre that should be recommended to satisfy U ’s varied interests
(see Section 3.5). For example, with the described time series genre
prediction strategy, QBook is able to prioritize the recommendation
of fantasy books for U (a genre U recently started reading more)
over comedy books (a genre known to be favored by U in the past),
even if proportionally U read more comedy than fantasy books. The
described prediction approach provides an additional data point to
further personalize the recommendation process.
3.5</p>
    </sec>
    <sec id="sec-9">
      <title>Curating Book Suggestions</title>
      <p>
        The last step of QBook’s recommendation process focuses on
curating CB to generate top-K suggestions tailored to U . In this step,
QBook’s goal is to emulate the curation process (as defined in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ])
and become a personal docent that understands U and provides
relevant books to read that appeal to his diverse, yet unique,
preferences. To do so, QBook simultaneously considers diferent data
points and builds a model that creates a single score that quantifies
the degree to which U prefers b ∈ CB. For model generation, QBook
adopts the Random Forest3 algorithm [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>As part of the curation process, QBook represents b ∈ CB as a
vector AU®,b =&lt; rU ,b , CrU ,b , Sim(U , b), sW N r , sW N s, cN LPr , cN LPr &gt;
which captures the degree of appeal of b for U from multiple
perspectives and is used as an input instance to the trained Random
Forest to generate the corresponding ranking score for b. Note that
unlike traditional recommenders that train a model for all the users
in the community, in QBook a random forest model is trained per
user. This allows the model to specifically learn each user’s interests
similar to what a personal docent would do.</p>
      <p>Reading Activity. Reading activity varies among users,
influencing QBook’s ability to manipulate ranked candidate books for
curation. For non-active readers–who rate less than 35 books- the
lack of available information can hinder the process of further
personalizing suggestions. In this case, QBook generates the top-K
recommendations for U by simply ordering the predictions scores
obtained using the trained Random Forest model on books in CB.</p>
      <p>For active readers (who read at least 35 books4), it is important
to identify what motivates their reading selections, which can vary
among diferent readers. For example, some users are biased by
experts opinions while others by the preferences of similar-minded
individuals. QBook explicitly considers these individual biases in
the book selection process for each active reader, leading to
further personalize suggestions. If U is an active reader, then QBook
captures correlations among diferent data points involved in the
process of creating AU®,b for U . QBook uses Pearson correlation
to indicate the extent to which variables fluctuate together (as
illustrated in Figure 2). By exploring U past rating behavior, QBook
can determine the data point that has the most influence on U in
3Empirically verified that Random Forests are best suited for our curation task;analysis
omitted due to page limitations.
4Analysis of recent statistics on average number of books read by Americans on
a yearly basis along with examination of rating distributions on development data
influenced our threshold selection for experimental purposes.
the process of ratings books, i.e., which data point yield the
highest correlated value with respect to U ’s ratings. This data point is
treated as the most important one, in terms of biasing U ’s decision
making process. QBook further re-orders the scores computed for
each book in CB based on the score of the most influential data
point and thus provides top-K suggestions further tailored for U .</p>
      <p>Genre Preference. In the case of active readers, the final step of
QBook for curating their suggestions involves explicitly considering
U ’s genre preferences. This is accomplished using the strategy
described in Section 3.4. To determine the number of representative
candidates from each genre that should be part of the final set
of books presented to U , QBook relies on the genre preference
distribution calculated using ARIMA time series analysis and the
process discussed in Section 3.4. In doing so, QBook can account
for the degree to which U will be likely interested in reading each
particular genre at the moment the recommendation is generated.</p>
      <p>The final list of top-K suggestions for U are generated by
considering not only ranking scores and user bias, but also by ensuring
that the genre distribution of books among the K suggested match
the genre distribution uniquely expected for U .</p>
      <p>By performing this curation step, QBook looks for diversity
among the suggestions by including books from all diferent areas
of users’ interests and improves personalization by ordering
suggestions based on a specific feature for U . Consequently, QBook
enables U to choose books from the exhibit tailored solely to him
in order to satisfy his reading needs in a given time.</p>
      <p>Generating Explanations. In order to be a curator, QBook can
not only recommend books to read without justifying why the
suggestions were generated. To do so, QBook pairs each
recommendation with an explanation enabling U to make the most informed
and fastest decisions in terms of selecting a single item among the
suggested ones. To generate explanations, QBook uses archived
book reviews, experts’ reviews, and the set of steps taken to
generate curated recommendations and provides U with personalized
and valuable information.</p>
      <p>QBook creates explanations for a curated book bc by extracting
sentences in reviews pertaining to bc that refer to the most
important literary element of interest to U . Note that if there are multiple
sentence describing the same feature, QBook arbitrarily selects one
to be shown to U . More importantly, QBook does not emphasize
the sentiment of the features, since QBook’s intent is not to make U
like one option more than another, but to save time on identifying
information important for him in the process of choosing the book
to read. Along with the other users’ opinions, QBook includes in its
explanations experts’ opinions on the book’s quality, as described
in Section 3.3. In other words, QBook includes in the corresponding
explanations a sentence from experts’ reviews that also reference
users’ top feature of interest. This way, U is provided with objective
opinions by extracting sentences from experts’ reviews pertaining
to the feature of U . This increases U ’s trust in QBook, since U can
read unbiased opinions that help him determine if he would like to
read a particular recommendation or not. For its final step for
explanation generation, QBook looks into the steps taken in curating
each book suggestion. For example, if bc was selected based on U ’s
rating history, then corresponding explanation includes a simple
sentence of the form bc was chosen since it has been highly rated
by users with similar rating patterns to yours. If, instead, experts’
opinion had a strong influence in the curation process, then QBook
makes sure that the user is aware of it.</p>
      <p>
        The explanation paired with bc includes three sentences
specifically selected for U . While we pick 3 for simplicity purposes, the
number of sentences included in the explanation can be adjusted.
By providing personalized explanations, QBook is able to tell a story
to U about how each suggestion is related him, which increases
users’ trust in the system, as well as the system’s transparency [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ].
Unlike the majority of existing strategies, QBook does not act like a
“black box" to the user since it provides information regarding the
selection and curation of the final set of books that are suggested.
Therefore, with this step QBook acts as a personal docent for U .
4
      </p>
    </sec>
    <sec id="sec-10">
      <title>EVALUATION</title>
      <p>In this section, we discuss the results of the studies conducted to
validate QBook’s performance and design methodology.
4.1</p>
    </sec>
    <sec id="sec-11">
      <title>Framework</title>
      <p>
        Dataset. To the best of our knowledge, there is no benchmark that
can be used for evaluating the performance of a curation
recommendation systems. Instead we use resources from Social Book Search
(SBS) Suggestion Track [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], which consists of 2.7 million book titles
along with user reviews and ratings, each with combined book
metadata from Amazon.com and LibraryThing. We complement
this collection with (i) overlapping catalog records from the Library
of Congress and (ii) experts’ reviews from known book critiques’
websites, such as NPR and Editorial Reviews SBS. We called this
enhanced SBS dataset QData.
      </p>
      <p>We split QData in three parts: 80% of the users were used for
training, denoted QT rain, 10% for development, denoted QDevel ,
and the remaining 10% for evaluation, denoted QEval . To ensure
a representative distribution for development and evaluation
purposes, we first clustered users from QData based on number of
books read. Thereafter, we created QT rain, QDevel , QEval by
randomly selecting the same percentage of users from clusters to
“simulate" real representation of QData in each partition.</p>
      <p>
        Metrics. For recommendation validation, we used the
wellknoCwovnerNaDgeC=G|KanÑdRRÑMASE|,. KWeisaltshoecsoentsoidfebreodo:ks of the collection
|K Ñ R |
known to a given user, R is the set of relevant books to a user and A
is the set of recommended books. This metric captures how many
of the items from the dataset are being recommended to all users
who get recommendations [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>
        Novelty= |(R Ñ A)−K | , where K , R, and A are defined as in
Cover|R Ñ A |
age. This metric captures how diferent a recommendation is with
respect to what the user has already seen along with the relevance
of the recommended item [
        <xref ref-type="bibr" rid="ref41">41</xref>
        ].
      </p>
      <p>
        Serendipity, which measures how surprising the
recommendations are to a user; computed as in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
4.2
      </p>
    </sec>
    <sec id="sec-12">
      <title>Results &amp; Discussion</title>
      <p>Temporal Analysis. Since time-based genre prediction and its
influence in the recommendation process is a novel strategy, we
evaluate it in isolation to demonstrate its efectiveness. To do so,
we used a disjoint set of 1,214 randomly-selected users from the
dataset introduced earlier in the section. We used KL-Divergence,
which measures how well a distribution q generated by a
prediction strategy approximates a distribution p, the ground truth, i.e.,
distribution of genres read by a user over a period of time. We also
used accuracy, a binary strategy that reflects if the predicted genres
correspond to the ones read by a user over a given period of time. In
establishing the ground truth for evaluation purposes, we adopted
the well-known N -1 strategy: the genre of the books rated by a
user U in N -1 time frames are used for training U ’s genre
prediction model, whereas the genre of the books rated by U in the N th
time frame are treated as “relevant". As a baseline for this initial
assessment, we use a naive strategy that defines the importance of
each genre for U on the current, i.e., N , time frame based on the
genre distribution across the previous N -1 time frames.</p>
      <p>As shown in Table 3, for N =11 KL divergence scores indicate that
genre distribution predicted using time-series better approximates
to the ground truth thus leading to better performance. Furthermore,
the probability of occurrence of each considered genre is closer
to the real values when the time component is included in the
prediction process. We observed diferences among users who read
diferent number of distinct genres. For users who read only one to
two genres, the time-based prediction strategy does not perform
better than the baseline. However, if a user reads three or more
genres, our time-based genre prediction strategy outperforms the
baseline in both metrics. This is not surprising, given that it is not
hard to determine area(s) of interest for a user who constantly reads
only one or two book genres, which is why the baseline performs
as good as time-based prediction strategy. Given that users that
read 3 or more genres represent 91% of the users in the dataset used
in the remaining of the experiments presented in this section, the
proposed strategy provides significant improvements in predicting
preferred genre for the vast majority of readers.</p>
      <p>Overall Performance. We evaluate the individual strategies
that contribute to QBook’s recommendation process and analyze
how each of them influences the generation of book suggestions.
We create top-75 recommendations for each user in QDevel
using the individual strategies defined in Section 3 and evaluate the
efectiveness of these recommendations based on NDCG 6.</p>
      <p>As shown in Figure 3, matrix factorization and content based
approaches are similarly efective in generating suggestions. However,
when combined they slightly increase the value of NDCG. This
improvement is statistically significant (p &lt; 0.001; t-test), which means
that, in general, users get more relevant recommendations when
both strategies are considered in-tandem. This can be explained
with the fact that these two methodologies complement each other.
Furthermore, we can see that the similarity between literary
features of interest to a user and literary features most often used to
describe a book, has a positive influence on the recommendation
process as it increases NDCG by 2.5 % when explicitly considered
as part of the recommendation process. This is anticipated, since
user-generated reviews hold a lot of information that can allow us
to gain knowledge about each user and personalize suggestions.</p>
      <p>
        The most reliable data points, which not only achieve relatively
high NDCG but also are widely applicable and do not depend on
individual users, are the four strategies that analyze sentiment of
expert reviews. These strategies rely on information frequently
available and thus are applicable to the majority of books examined
by QBook. Based on Figure 3, we can see that data points calculated
using sentence level sentiment analysis provide slightly better
recommendations compared to the ones generated using word level
sentiment analysis. Even though the individual strategies perform
relatively well, we cannot assume that each data point can be
calculated for every single book. QBook’s improvements in terms of
NDCG can be justified with its ability to: (i) simultaneously
consider multiple data points, (ii) include genre-prediction strategy,
and (iii) more completely analyze diferent perspectives of
userbook relations to provide recommendations even when some of the
data points are unavailable. This is demonstrated based on the fact
that NDCG of QBook is statistically significant with respect to the
NDCG reported for the individual strategies (for p &lt; 0.001).
5K is set to 7, based on a study presented in [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ], where authors argue that a number
of objects an average human can hold in working memory is 7 ± 2.
6Q Devel and Q Eval yield comparable scores, indicating consistence in performance
regardless of the data use for experimentation and no overfitting.
      </p>
      <p>To further showcase the validity of Qbook’s design
methodology, we compare its performance with two baselines: SVD (matrix
factorization) and CB (content-based). For their respective
implementations we rely on LensKit. The significant ( p &lt; 0.01) NDCG
improvement of QBook, with respect to SVD (0.874) and CB (0.856),
demonstrates that, in general, recommendations provided by QBook
are preferred over the ones provided by the baselines, which either
consider ratings patterns or content, but not both.</p>
      <sec id="sec-12-1">
        <title>Recommendation Explanations. There is no gold-standard</title>
        <p>
          to evaluate explanations ofline. Thus, following the strategy in
[
          <xref ref-type="bibr" rid="ref16 ref39">16, 39</xref>
          ] we conducted an initial qualitative evaluation for
demonstrating the usefulness of the explanations generated by QBook.
We rely on the criteria introduced in [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ] and summarized in Table
2, which outlines the “characteristics" of good explanations for
recommenders. QBook achieves five out of the seven criteria expected
of explanations generated by recommenders.By suggesting curated
books which are described based on users’ preferred features of
interest, showcasing opinions of other users on those features and
describing curation steps, QBook addresses transparency. QBook
inspires trust on its users, since it does not consider the sentiment
connotation of the features to determine if they should be included
in an explanation. Instead, QBook provides unbiased
recommendations and explanations; which can increase users’ confidence as
they know QBook ofers a real depiction of each suggested book.
Users are also able to make good and fast decisions, in terms of
selecting books among the suggested ones, since based on provided
explanations they can infer which books match their current
preferences. With this, QBook increases its efectiveness . Given that users’
overall satisfaction with a recommender is related to the perceived
quality of its recommendations and explanations [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], QBook users
can appreciate not having to spend more time researching books
with characteristics important to them.
        </p>
        <p>
          As per the study in [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ] and assessments on several
explanationgeneration strategies [
          <xref ref-type="bibr" rid="ref19 ref31 ref42 ref46">19, 31, 42, 46</xref>
          ], we can report that, on average,
only two (out of seven) criteria are satisfied. The only strategy that is
comparable to QBook’s is the one discussed in [
          <xref ref-type="bibr" rid="ref46">46</xref>
          ], which addresses
ifve of the criteria. However, this strategy involves sentiment in the
generation of the explanations, as opposed to QBook which makes
unbiased decisions when identifying users’ features of preference
and selecting which sentences to use to describe these features.
        </p>
        <p>
          Common Recommendation Issues. We showcase QBook’s
ability to address popular recommendation issues based on RMSE,
in addition to adopting the evaluation framework presented in
[
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] to simulate online evaluation using ofline metrics: coverage,
serendipity and novelty. Based on the results of our analysis, we
observe that the performance of QBook is consistent, regardless of
the presence or absence of data points used in the recommendation
process. QBook’s RMSE (Table 4) indicates that its
recommendation strategy can successfully predict users’ degree of preference
for books. QBook’s coverage score (0.92), highlights that QBook
considers a vast number of diverse books as potential
recommendation, as opposed to popular ones. The novelty score (0.73) depicts
that a user is provided with suggestions that difer from what he
already saw. This characteristic of QBook, together with relatively
high serendipity (0.68), indicates that new and unexpected, yet
relevant, suggestions are generated.
        </p>
        <p>State-of-the-art. We compare QBook with other book
recommenders (optimal parameters were empirically defined).</p>
        <p>
          LDAMF [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] harnesses the information in review text by fitting
an LDA model on the review text.
        </p>
        <p>
          CTR [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ] uses a one-class collaborative filter strategy. Even
though it is not specifically created for books, we consider it as it
exploits metadata comparable for that of books.
        </p>
        <p>
          HFT combines reviews with ratings [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] and models the
ratings using a matrix factorization model to link the stochastic topic
distribution in review text and the latent vector in the ratings.
        </p>
        <p>
          SVD++ [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] refers to a matrix factorization model which makes
use of implicit feedback information.
        </p>
        <p>
          URRP [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], is a Bayesian model that combines collaborative and
content-based filtering to learn user rating and review preferences.
        </p>
        <p>
          ‘Free Lunch’ [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ] leverages clusters based on information that is
present in the user-item matrix, but not directly exploited during
matrix factorization.
        </p>
        <p>
          RMR [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], which combines baselines by using the information
of both ratings and reviews.
        </p>
        <p>In Table 4 we summarize the results of the evaluation conducted
using QEval in Table 4 in terms of RMSE. QBook outperforms
existing state-of-the-art book recommenders considered in this
study in terms of predicting the degree of which a user would like to
read each recommended book. The diference on RMSE computed
for QBook with respect to aforementioned state-of-the-art book
recommenders are statistically significant with p &lt; 0.001.</p>
        <p>The prediction power of QBook is evidenced by its ability to
achieve lowest RMSE among state-of-the-art approaches. When
analyzing the performance of diferent strategies in more detail, we
can see that Matrix Factorization strategies perform better, as in
the case of Free Lunch (with and without clustering) and SVD++.
However, QBook goes beyond matrix factorization by using a
content based approach as well as involving diferent perspectives,
including other users’ and experts’ reviews.
CTR
0.795
1.055
1.053</p>
        <p>Strategy
We presented QBook , a book recommender that acts as a curator by
showcasing tailored book selections that meet the reading needs of
individual users.As part of its recommendation process, QBooks
examines diferent areas of user interest, not only the most dominant
or recent ones, as well as varied data points. In doing so, QBook can
yield a diverse set of suggestions, each paired with an explanation,
to provide a user not only with reasons why a book was included
in the curated list of recommendations but also how each
recommendation was selected, with the objective of enhancing trust and
transparency towards the user.</p>
        <p>We conducted a number of ofline experiments to validate the
performance of QBook using a popular dataset. We also
demonstrated the importance of considering diverse data sources, beyond
ratings or content, to enhance the recommendation process.</p>
        <p>With this work, we set the algorithmic foundations that will
allow us to conduct in-depth online experiments in the future, in
order to quantify the usability of QBook , the value of its
explanations, and the degree of which its curation strategy can enrich
the recommendation process from a user’s perspective. Given the
domain-independent nature of our strategies, we plan to validate
QBook on datasets other than books to demonstrate its applicability
on domains other than books. Our goal is to go one step further
and enable our personal curator to generate suggestions in multiple
domains, based on a complete virtual footprint available for a user.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>[1] Content based recommendation system</article-title>
          . Available at: http://eugenelin89.github. io/recommender_content_based/.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>INEX</given-names>
            <surname>Amazon</surname>
          </string-name>
          <article-title>/LibraryThing book corpus</article-title>
          . http://social-book-search.humanities. uva.nl/data/ALT_Nondisclosure_Agreements.html. Accessed:
          <fpage>2016</fpage>
          -02-07.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <article-title>[3] LensKit open-source tools for recommender systems</article-title>
          . https://lenskit.org.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Benkoussas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ollagnier</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Bellot</surname>
          </string-name>
          .
          <article-title>Book recommendation using information retrieval methods and graph analysis</article-title>
          .
          <source>In CLEF. CEUR</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.</given-names>
            <surname>Blanco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ceccarelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lucchese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Perego</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          .
          <article-title>You should read this! let me explain you why: explaining news recommendations to users</article-title>
          .
          <source>In ACM CIKM</source>
          , pages
          <fpage>1995</fpage>
          -
          <lpage>1999</lpage>
          . ACM,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C.</given-names>
            <surname>Borrelli</surname>
          </string-name>
          .
          <article-title>Everybody's a curator. chicago tribune</article-title>
          . https://goo.gl/hpTF3Q. Accessed:
          <fpage>2015</fpage>
          -12-06.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.</given-names>
            <surname>Breiman</surname>
          </string-name>
          .
          <article-title>Random forests</article-title>
          .
          <source>Machine Learning</source>
          ,
          <volume>45</volume>
          (
          <issue>1</issue>
          ):
          <fpage>5</fpage>
          -
          <lpage>32</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Channamsetty and M. D. Ekstrand</surname>
          </string-name>
          .
          <article-title>Recommender response to diversity and popularity bias in user profiles</article-title>
          .
          <source>In AAAI FLAIRS</source>
          , pages
          <fpage>657</fpage>
          -
          <lpage>660</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Sentiment-enhanced explanation of product recommendations</article-title>
          .
          <source>In WWW</source>
          , pages
          <fpage>239</fpage>
          -
          <lpage>240</lpage>
          . ACM,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Dictionary</surname>
          </string-name>
          . Oxford: Oxford university press,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N.</given-names>
            <surname>Dragovic</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Pera</surname>
          </string-name>
          .
          <article-title>Genre prediction to inform the recommendation process</article-title>
          .
          <source>Proceedings of the Poster Track of the 10th ACM Conference on Recommender Systems</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>N.</given-names>
            <surname>Dragovic</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Pera</surname>
          </string-name>
          .
          <article-title>Exploiting reviews to generate personalized and justified recommendations to guide users' selection</article-title>
          .
          <source>In AAAI FLAIRS</source>
          , pages
          <fpage>661</fpage>
          -
          <lpage>664</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Esuli</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Sebastiani</surname>
          </string-name>
          .
          <article-title>Sentiwordnet: A publicly available lexical resource for opinion mining</article-title>
          .
          <source>In LREC</source>
          , volume
          <volume>6</volume>
          , pages
          <fpage>417</fpage>
          -
          <lpage>422</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Garrido</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Ilarri</surname>
          </string-name>
          .
          <article-title>Tmr: a semantic recommender system using topic maps on the items' descriptions</article-title>
          .
          <source>In ESWC</source>
          , pages
          <fpage>213</fpage>
          -
          <lpage>217</lpage>
          . Springer,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delgado-Battenfeld</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          .
          <article-title>Beyond accuracy: evaluating recommender systems by coverage and serendipity</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>257</fpage>
          -
          <lpage>260</lpage>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>F.</given-names>
            <surname>Gedikli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Ge</surname>
          </string-name>
          .
          <article-title>How should i explain? a comparison of diferent explanation types for recommender systems</article-title>
          .
          <source>International Journal of Human-Computer Studies</source>
          ,
          <volume>72</volume>
          (
          <issue>4</issue>
          ):
          <fpage>367</fpage>
          -
          <lpage>382</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>S.</given-names>
            <surname>Givon</surname>
          </string-name>
          and
          <string-name>
            <given-names>V.</given-names>
            <surname>Lavrenko</surname>
          </string-name>
          .
          <article-title>Predicting social-tags for cold start book recommendations</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>333</fpage>
          -
          <lpage>336</lpage>
          . ACM,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Herlocker</surname>
          </string-name>
          ,
          <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>Explaining collaborative filtering recommendations</article-title>
          .
          <source>In ACM CSCW</source>
          , pages
          <fpage>241</fpage>
          -
          <lpage>250</lpage>
          . ACM,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hernando</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bobadilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ortega</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>GutiéRrez</surname>
          </string-name>
          .
          <article-title>Trees for explaining recommendations made through collaborative filtering</article-title>
          .
          <source>Information Sciences</source>
          ,
          <volume>239</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>17</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>M.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Liao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhu</surname>
          </string-name>
          .
          <article-title>A bayesian recommender model for user rating and review profiling</article-title>
          .
          <source>Tsinghua Science &amp; Technology</source>
          ,
          <volume>20</volume>
          (
          <issue>6</issue>
          ):
          <fpage>634</fpage>
          -
          <lpage>643</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>G.</given-names>
            <surname>Kazai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Clarke</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Yusof</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Venanzi</surname>
          </string-name>
          .
          <article-title>A personalised reader for crowd curated content</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>325</fpage>
          -
          <lpage>326</lpage>
          . ACM,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kislyuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Tzeng</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jing</surname>
          </string-name>
          .
          <article-title>Human curation and convnets: Powering item-to-item recommendations on pinterest</article-title>
          .
          <source>arXiv preprint arXiv:1511.04003</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          .
          <article-title>Factorization meets the neighborhood: a multifaceted collaborative ifltering model</article-title>
          .
          <source>In ACM SIGKDD</source>
          , pages
          <fpage>426</fpage>
          -
          <lpage>434</lpage>
          . ACM,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Volinsky</surname>
          </string-name>
          , et al.
          <article-title>Matrix factorization techniques for recommender systems</article-title>
          .
          <source>Computer</source>
          ,
          <volume>42</volume>
          (
          <issue>8</issue>
          ):
          <fpage>30</fpage>
          -
          <lpage>37</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>G.</given-names>
            <surname>Ling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Lyu</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. King.</surname>
          </string-name>
          <article-title>Ratings meet reviews, a combined approach to recommend</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>105</fpage>
          -
          <lpage>112</lpage>
          . ACM,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>B.</given-names>
            <surname>Loni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Said</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanjalic</surname>
          </string-name>
          .
          <article-title>'free lunch'enhancement for collaborative filtering with factorization machines</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>281</fpage>
          -
          <lpage>284</lpage>
          . ACM,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A.</given-names>
            <surname>Maksai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Garcin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Faltings</surname>
          </string-name>
          .
          <article-title>Predicting online performance of news recommender systems through richer evaluation metrics</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>179</fpage>
          -
          <lpage>186</lpage>
          . ACM,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>C. D. Manning</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Surdeanu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Bauer</surname>
            ,
            <given-names>J. R.</given-names>
          </string-name>
          <string-name>
            <surname>Finkel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Bethard</surname>
            , and
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>McClosky</surname>
          </string-name>
          .
          <article-title>The stanford corenlp natural language processing toolkit</article-title>
          .
          <source>In ACL (System Demonstrations)</source>
          , pages
          <fpage>55</fpage>
          -
          <lpage>60</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>J.</given-names>
            <surname>McAuley</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          .
          <article-title>Hidden factors and hidden topics: understanding rating dimensions with review text</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>165</fpage>
          -
          <lpage>172</lpage>
          . ACM,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>G. A.</given-names>
            <surname>Miller</surname>
          </string-name>
          .
          <article-title>The magical number seven, plus or minus two: Some limits on our capacity for processing information</article-title>
          .
          <source>Psychological Review</source>
          ,
          <volume>63</volume>
          (
          <issue>2</issue>
          ):
          <fpage>81</fpage>
          ,
          <year>1956</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>J.</given-names>
            <surname>Misztal</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Indurkhya</surname>
          </string-name>
          .
          <article-title>Explaining contextual recommendations: Interaction design study and prototype implementation</article-title>
          .
          <source>In IntRS@RecSys</source>
          , pages
          <fpage>13</fpage>
          -
          <lpage>20</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>R.</given-names>
            <surname>Nau</surname>
          </string-name>
          .
          <article-title>Introduction to arima models</article-title>
          .duke university. http://people.duke.edu/ ~rnau/411arim.htm. Accessed:
          <fpage>2016</fpage>
          -05-06.
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ohana</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Tierney</surname>
          </string-name>
          .
          <article-title>Sentiment classification of reviews using sentiwordnet</article-title>
          .
          <source>9th IT &amp; T Conference</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Pera</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.-K.</given-names>
            <surname>Ng</surname>
          </string-name>
          .
          <article-title>Automating readers' advisory to make book recommendations for k-12 readers</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>9</fpage>
          -
          <lpage>16</lpage>
          . ACM,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Pera</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.-K.</given-names>
            <surname>Ng</surname>
          </string-name>
          .
          <article-title>Analyzing book-related features to recommend books for emergent readers</article-title>
          .
          <source>In ACM HT</source>
          , pages
          <fpage>221</fpage>
          -
          <lpage>230</lpage>
          . ACM,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          .
          <article-title>Introduction to recommender systems handbook</article-title>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Saaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Rafter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schaal</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Smyth</surname>
          </string-name>
          .
          <article-title>The curated web: a recommendation challenge</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>101</fpage>
          -
          <lpage>104</lpage>
          . ACM,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Teng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tian</surname>
          </string-name>
          , and
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>A novel fahp based book recommendation method by fusing apriori rule mining</article-title>
          .
          <source>In ISKE</source>
          , pages
          <fpage>237</fpage>
          -
          <lpage>243</lpage>
          . IEEE,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>N.</given-names>
            <surname>Tintarev</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Masthof</surname>
          </string-name>
          .
          <article-title>A survey of explanations in recommender systems</article-title>
          .
          <source>In IEEE ICDEW</source>
          , pages
          <fpage>801</fpage>
          -
          <lpage>810</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>N.</given-names>
            <surname>Tintarev</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Masthof</surname>
          </string-name>
          .
          <article-title>Evaluating recommender explanations: problems experienced and lessons learned for the evaluation of adaptive systems</article-title>
          .
          <source>In UCDEAS Workshop associated with UMAP. CEUR-WS</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>S.</given-names>
            <surname>Vargas</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          .
          <article-title>Rank and relevance in novelty and diversity metrics for recommender systems</article-title>
          .
          <source>In ACM RecSys</source>
          , pages
          <fpage>109</fpage>
          -
          <lpage>116</lpage>
          . ACM,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>J.</given-names>
            <surname>Vig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          .
          <article-title>Tagsplanations: explaining recommendations using tags</article-title>
          .
          <source>In IUI</source>
          , pages
          <fpage>47</fpage>
          -
          <lpage>56</lpage>
          . ACM,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Blei</surname>
          </string-name>
          .
          <article-title>Collaborative topic modeling for recommending scientific articles</article-title>
          .
          <source>In TACM SIGKDD</source>
          , pages
          <fpage>448</fpage>
          -
          <lpage>456</lpage>
          . ACM,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <surname>Y. Zhang.</surname>
          </string-name>
          <article-title>Opportunity model for e-commerce recommendation: right product; right time</article-title>
          .
          <source>In ACM SIGIR</source>
          , pages
          <fpage>303</fpage>
          -
          <lpage>312</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <surname>M. C. Willemsen</surname>
            ,
            <given-names>M. P.</given-names>
          </string-name>
          <string-name>
            <surname>Graus</surname>
            , and
            <given-names>B. P.</given-names>
          </string-name>
          <string-name>
            <surname>Knijnenburg</surname>
          </string-name>
          .
          <article-title>Understanding the role of latent feature diversification on choice dificulty and satisfaction</article-title>
          .
          <source>UMUAI</source>
          ,
          <volume>26</volume>
          (
          <issue>4</issue>
          ):
          <fpage>347</fpage>
          -
          <lpage>389</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [46]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , G. Lai,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Y. Liu, and
          <string-name>
            <given-names>S.</given-names>
            <surname>Ma</surname>
          </string-name>
          .
          <article-title>Explicit factor models for explainable recommendation based on phrase-level sentiment analysis</article-title>
          .
          <source>In ACM SIGIR</source>
          , pages
          <fpage>83</fpage>
          -
          <lpage>92</lpage>
          . ACM,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>