<!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>Natural Language Justifications for Recommender Systems Exploiting Text Summarization and Sentiment Analysis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Cataldo Musto</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gaetano Rossiello</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco de Gemmis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pasquale Lops</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giovanni Semeraro</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science University of Bari Aldo Moro</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <fpage>63</fpage>
      <lpage>73</lpage>
      <abstract>
        <p>This paper reports and summarizes the methodology presented in [16] and accepted for publication at ACM RecSys 20191. In this work we present a methodology to justify recommendations that relies on the information extracted from users' reviews discussing the available items. The intuition behind the approach is to conceive the justification as a summary of the most relevant and distinguishing aspects of the item, automatically obtained by analyzing its reviews. To this end, we designed a pipeline of natural language processing techniques including aspect extraction, sentiment analysis and text summarization to gather the reviews, process the relevant excerpts, and generate a unique synthesis presenting the main characteristics of the item. Such a summary is finally presented to the target user as a justification of the received recommendation. In the experimental evaluation we carried out a user study in the movie domain (N=141) and the results showed that our approach is able to make the recommendation process more transparent, engaging and trustful for the users. Moreover, the proposed method also beat another review-based explanation technique, thus confirming the validity of our intuition.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Background and Motivations</title>
      <p>
        A research line which is recently emerging in the context of the so-called Data
Explosion [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] regards the analysis and the exploitation of the information extracted
from user-generated content and, in particular, from users’ reviews. These data
are interesting from both a quantitative and a qualitative point of view, suffice it
to say that more than 700 million reviews and opinions are available on
TripAdvisor2. The positive impact of the information extracted from users’ reviews and
from user-generated content has been already acknowledged in several scenarios
[
        <xref ref-type="bibr" rid="ref1 ref14 ref15 ref9">1,9,14,15</xref>
        ]: as an example, review-aware recommendation models tend to beat
classical recommendation algorithms [
        <xref ref-type="bibr" rid="ref3 ref6 ref7">3,6,7</xref>
        ].
      </p>
      <sec id="sec-1-1">
        <title>1 https://recsys.acm.org/recsys19/</title>
      </sec>
      <sec id="sec-1-2">
        <title>2 https://tripadvisor.mediaroom.com/us</title>
        <p>Copyright c 2019 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).</p>
        <p>
          However, differently from most of the current literature, in this work we
investigated the impact of the information conveyed by users’ reviews in a different
scenario, that is to say, the task of justifying a suggestion returned by a
recommendation algorithm. This topic is particularly relevant due to the recent
regulations in the area, as the General Data Protection Regulation3 (GDPR), which
emphasized the users’ right to explanation. Moreover, many studies showed that
a higher transparency leads to a higher trust [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] and to a higher acceptance of
the recommendations [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
        </p>
        <p>
          In a nutshell, our methodology relies on the idea that an effective justification
can be conceived as a summary of relevant and distinguishing aspects of the item,
automatically obtained by analyzing its reviews. To this end, we designed a
pipeline of natural language processing techniques to obtain and process reviews
excerpts and to generate a unique synthesis presenting the main characteristics
of the item, which is finally presented to the target user as justification of the
received recommendation. It is worth to note that we preferred to use the term
justification over explanation, even if they are often used as synonyms. This
choice follows the definition provided in [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], where it is stated that a justification
explains why a decision is a good one, without explaining exactly how it was
made, while an explanation is related to the concept of interpretability, that is to
say, if the internal mechanisms as well as the process carried out by an algorithm
can be understood by a human. Accordingly, the strategy we implemented is closer
to the idea of justification, since our methodology is more devoted to describe
why a user would be interested in the item, in order to make a more informed
decision about consuming the item or not.
        </p>
        <p>
          For a discussion of the literature in the area we suggest to refer to the original
paper [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. For the sake of shortness, we can state that the distinguishing aspects
of the current work lie in:
– The use of text summarization techniques to generate natural language
ex
        </p>
        <p>planations;
– The use of aspect extraction methods to automatically discover relevant and
distinguishing aspects of the item, discussed in user reviews.</p>
        <p>In the following, we describe the main building blocks of our methodology
and we will show the results emerging from the user study in the movie domain.</p>
        <p>Finally, we will discuss the main outcomes of this work, by also sketching some
ideas for future research.
2</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>Our methodology to build natural language justifications by exploiting users’
reviews relies on four steps: aspect extraction, aspect ranking, sentence filtering
and text summarization.</p>
      <sec id="sec-2-1">
        <title>3 http://ec.europa.eu/justice/data-protection/reform/files/regulation_oj_en.pdf</title>
        <sec id="sec-2-1-1">
          <title>Aspect Extraction</title>
          <p>First, we assume that an effective justification should include relevant and
distinguishing traits of the items, which are often discussed in the reviews (with a
positive sentiment, of course). Accordingly, the goal of the first phase is
identifying the aspects that are worth to be included in the justification. Formally, our
strategy takes as input a set of reviews R = fr1; r2 : : : rng and produces a set
of 4-tuples hri; aij ; rel(aij ; ri); sent(aij ; ri)i representing the review ri, the j-th
aspect aij extracted from the review ri, the relevance rel(aij ; ri) of the aspect
aij in the review ri, and the sentiment associated to that aspect.</p>
          <p>
            To extract aspects from reviews, we used the Kullback-Leibler divergence [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ]
(KL-divergence, referred to as ), a non-symmetric measure of the difference
between two distributions. Formally, given two corpora ca and cb and a term t,
pointwise KL-divergence is calculated as:
t(cajjcb) = p(t; ca)log
p(t; ca)
p(t; cb)
(1)
          </p>
          <p>Where p(t; ca) is the number of occurrences of the term t in corpus ca. In
a nutshell, this measure rely on the idea that the use of language differs when
talking about a specific domain with respect to a general topic, thus this method
identifies the aspects whose distribution in a specific domain (e.g., movie reviews )
diverges from that in a general corpus (e.g., the British National Corpus BNC4).
In other terms, the measure identifies those aspects which are mentioned in
the reviews more often than usual. Given such a formulation, our strategy for
identifying the main aspects mentioned in the reviews follows:
Require: review ri, general corpus BN C, domain corpus d
Ensure: set of main aspects A and relevance scores</p>
          <p>A = fg , T = nouns(ri)andentities(ri)
for all tk 2 T do
if tk (djjBN C) &gt; then
aij tk
A = A S faij g
rel(aij ; ri) tk
end if
end for</p>
          <p>In our case, given a review ri, we first extract all the nouns by running
a POS-tagging algorithm. Next, we calculate KL-divergence for each noun by
using as corpora our set of movie reviews and the BNC. The nouns having a
KL-divergence greater then a threshold are labeled as aspects and the
KLdivergence score is used as relevance score. Finally, we also run a sentiment
analysis algorithm to identify the opinion is associated to the aspect aij in ri
and we stored that value. More details on the algorithms used in this phase are
provided in the next Section.</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>4 http://www.natcorp.ox.ac.uk/</title>
        <p>Aspect extraction is run over all the reviews contained in R, and a set of aspects
is extracted from each review. However, the goal of our strategy is to identify
the most relevant aspects that overall describe the item, thus we also designed
an aspect ranking phase to merge the information we extracted from each single
review. Specifically, for each aspect aj we calculate its global score as follows:
score(aj ) =</p>
        <p>PN
i=1 naj;ri
rel(aj ; ri) sent(aj ; ri)</p>
        <p>N
(2)</p>
        <p>Our formula gives a higher score to the aspects that are often mentioned in
the reviews (naj;ri is the number of the occurrences of aj in ri) with a positive
sentiment. At the end of this step all the aspects are ranked and the top-K are
labeled as main aspects. Typically, the aspects returned by our strategy include
concepts such as actors, director, story, music and so on.</p>
        <p>The Top-5 Aspects returned by our algorithm for three different movies are
reported in Table 1. Such an output emphasizes how our strategy can make
relevant and interesting aspects of the items immediately emerge, since different
and distinguishing elements of the movies are highlighted.</p>
        <p>Chinatown The Ring Titanic
Once the main aspects are identified, we run a sentence filtering phase. The goal
of this phase is to filter out non-compliant sentences that are supposed to be not
useful in the final justification we want to build. In this case we first split each
review ri 2 R in sentences si1 : : : sim. Next, we verify the compliancy of each
sentence si and we maintain only the sentences matching the following criteria:
(i) si contains a main aspect a1 : : : ak; (ii) si is longer than 5 tokens; (iii) si
expresses a positive sentiment; (iv) si does not contain first-person personal or
possessive pronouns.</p>
        <p>The rationale behind these heuristics is straightforward: we want to include in
the justification only the sentences including a relevant aspect that also express
a positive sentiment about the item. Moreover, we decided to filter out very
short and non-informative sentences as well as those using the first person. In
this case, the intuition is to prefer excerpts having a more impersonal style (e.g.,
’The movie has a great cast’ ) than those expressing personal opinions (e.g., I
liked the cast of the movie, this is my favourite director ).
2.4</p>
        <sec id="sec-2-2-1">
          <title>Text Summarization</title>
          <p>At the end of the Sentence Filtering a set of potential candidate sentences is
obtained. Such a set is used to feed a text summarization algorithm whose goal is
to generate a unique summary to be used as justification of the recommendation.
Such a summary is supposed to highlight the main contents discussed in the
reviews of the item and to maximize both the coverage and diversity of the
justification. This is done by selecting sentences which cover enough amount of
topics discussed in the original reviews and by avoiding the redundancy as well.</p>
          <p>
            To run text summarization we adapted the method described in [
            <xref ref-type="bibr" rid="ref18">18</xref>
            ], which
proved to be effective in a multi-document summarization task. This makes
the approach very suitable for our scenario, since each review can be easily
considered as a document, thus the method can be very effective in summarizing
all the reviews excerpts in a single summary that highlights the most salient
features of the item.
          </p>
          <p>
            Our approach combines centroid-based text summarization [
            <xref ref-type="bibr" rid="ref17">17</xref>
            ], which has
the advantage of being unsupervised, with a pre-trained neural language model,
such as Word2Vec [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ], which is good in transferring information from web-scale
textual corpora, and is based on two steps: first, all the information coming
from the reviews of an item are condensed in a centroid vector which represents
a pseudo-review. Next, the main idea is to project both the centroid and each
sentence of the reviews in a vector space and to include in the summary only
the sentences closer to the centroid.
          </p>
          <p>Formally, given a set of reviews R and its vocabulary V with size N = jV j,
we first define a matrix M 2 RN;k, so-called lookup table, where the i-th row is
a word embedding of size k, k &lt;&lt; N , of the i-th word in V . The values of the
word embeddings matrix M are learned by using Word2Vec. When the lookup
table is learned, the summarization method consists of three phases:</p>
          <p>Centroid Vector Building. The centroid vector that represents the
meaning of the reviews is built in two steps. First, the most meaningful words
occurring in the reviews (that is to say, those having their tf idf weight greater than
a topic threshold) are selected. Next, the embedding of the centroid is computed
as the sum of the embeddings of the top ranked words in the reviews using the
lookup table M .</p>
          <p>C =</p>
          <p>X
w2R;tfidf(w)&gt;t</p>
          <p>M [idx(w)]
(3)
In the eq. (3) we denote with C the centroid embedding related to the set of
reviews R and with idx(w) a function that returns the index of the word w in
the vocabulary.</p>
          <p>Sentence Scoring. Given the centroid vector, we need to identify the
sentences to be included in the summary. For each sentence in the set of the reviews,
we create an embedding representation by summing the vectors for each word
in the sentence stored in the lookup table M .</p>
          <p>Sj =</p>
          <p>X M [idx(w)]
w2Sj
sim(C; Sj ) =</p>
          <p>CT</p>
          <p>Sj
jjCjj jjSj jj
In the eq. (4) we denote with Sj the j-th sentence in the set of reviews R. Then,
the sentence score is computed as the cosine similarity between the embedding
of the sentence Sj and that of the centroid C of the set R.</p>
          <p>Sentence Selection. The sentences are sorted in descending order of their
similarity scores. The top ranked sentences are iteratively selected and added to
the summary until the limit, in terms of the number of words in the summary,
is reached. In order to minimize the redundancy of the information included in
the summary, during the iteration we compute the cosine similarity between the
next sentence and each one already in the summary. We discard the incoming
sentence if the similarity value is greater than a threshold.</p>
          <p>At the end of this process a summary is produced. An example of the
summaries generated for three movies is reported in Table 2. These summaries were
used in our experiments as justifications.
3</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experimental Evaluation</title>
      <p>The goal of the experimental session was twofold: to evaluate the effectiveness of
different configurations of our justifications based on text summarization
(Experiment 1), and to compare our methodology to a baseline that exploits users’
reviews without text summarization (Experiment 2).</p>
      <p>
        To this end, we designed a user study in the movie domain involving 141
subjects. To run the experiment, we deployed a web application5. As regards
Experiment 1, we run the experiment in a between-subject fashion, that is to
say, each user was randomly assigned to a configuration of our pipeline, and
he evaluated the justifications. Clearly, the user was not aware of the specific
configuration he was interacting with. Conversely, for Experiment 2, we run a
within-subject experiment, that is to say, all the users were provided with two
different explanation styles (i.e., our justifications exploiting text summarization
and a review-based baseline presented in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]).
      </p>
      <p>To run the experiment we built a dataset by mapping MovieLens data with
Amazon reviews discussing the movies. The resulting dataset contained 307
movies and 153,566 reviews. The average length of each review was 138.38 words.
5 http://193.204.187.192:8080/WebLodrecsys_AES
(4)
(5)
Movie</p>
      <p>Justification</p>
      <p>In order to evaluate different configurations of our pipeline, we compared
six different different alternatives of the algorithm, obtained by varying number
of aspects and justification length. As for the length, we compared long and
short justifications, depending on the overall length of the justification (50 words
for short justifications, 100 words for long justifications). As for the number
of aspects, we compared the justifications built by including all the aspects
mentioned in the reviews, the top-10 aspects and the top-30 aspects.</p>
      <p>
        Implementation details. Recommendations were generated by using
Personalized PageRank (PR) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] as recommendation algorithm. As for the Aspect
Extraction and the Aspect Ranking, we exploited the algorithms available in
CoreNLP6. To identify the sentiment conveyed by the single sentences, we used
the Stanford Sentiment Analysis algorithm7. As regards the Text Summarizer,
pre-trained word embeddings learned through Word2Vec were used.
      </p>
      <p>In a nutshell, each user involved in the experiment carried out the following
steps:</p>
      <p>(1) Preference Elicitation and Generation of the Justifications. We
asked users to explicitly rate at least three items, chosen among a randomly
generated subset of 20 movies. Next, recommendations were generated.</p>
      <p>(2) Between-subject Evaluation through Questionnaires. We asked
the users to fill in a questionnaire to evaluate the quality of the justification.</p>
      <sec id="sec-3-1">
        <title>6 https://stanfordnlp.github.io/CoreNLP/</title>
      </sec>
      <sec id="sec-3-2">
        <title>7 https://nlp.stanford.edu/sentiment/</title>
        <p>Each user was asked to evaluate the previously presented metrics through a
five-point scale (1=strongly disagree, 5=strongly agree).</p>
        <p>(3) Within-subject Evaluation through Questionnaires. We asked
each user to evaluate the explanation style they preferred between our
methodology and the baseline. As shown in Figure 1, we provided the user with both
the explanations in the same screen, and we asked them to select the best one.</p>
        <p>
          Finally, as for the evaluation metrics we used transparency, persuasiveness,
engagement and trust of the recommendation as the average score collected
through the user questionnaires, as in [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ].
3.1
        </p>
        <sec id="sec-3-2-1">
          <title>Discussion of the Results</title>
          <p>The results we obtained for Experiment 1 are reported in Table 3. The values
represent the average scores given by the users for that specific metric. The higher
the better, with the exception of the effectiveness where the best configuration
is the one closer to zero.</p>
          <p>Configuration</p>
          <p>Metrics
Aspects Length TRA PER ENG TRU EFF</p>
          <p>All Short
Top-10 Short
Top-30 Short
2.89
2.83
3.16
2.74
3.06
3.06
3.26
3.06
2.69
2.93
2.83
3.19
0.48
0.89
0.94</p>
          <p>The first result emerging from the experiment is that longer justifications
tend to beat their shorter counterpart. This means that very short justifications
cannot convey the information which is needed by the final users to better
understand the quality of the suggestions they received. Such a low quality is also
confirmed by analyzing the scores we obtained for short justifications : they are
often below 3.00 (equivalent to ’partially agree’ as answer), which is considered
as the minimum score that makes a justification as acceptable. Conversely, when
longer justifications are produced by our technique, the results we obtained are
generally higher. This means that the addition of more sentences can make the
justifications and the recommendation process more satisfying, engaging,
transparent and trustful for the target users.</p>
          <p>As regards the number of aspects to be included, the experiment showed that
the best results are obtained by exploiting the top-10 aspects identified by our
aspect ranking module. This is confirmed for all the metrics except of the
effectiveness. This means that by selecting a subset of relevant aspects we can provide
the user with a summary containing the most relevant and useful information
to evaluate the quality of the suggestion. Conversely, when a higher number of
aspects is exploited (or even when all the aspects are took into account), some
noise is probably introduced in the summarization process, thus non-relevant or
non-interesting sentences are put in the final justification, and this leads to a
decrease in the overall results.</p>
          <p>
            Next, in Experiment 2 we compared our justification based on automatic
text summarization to the justifications generated by exploiting a review-based
baseline in a within-subject experiment. Due to space reasons, we only report the
results of the comparison between the best-performing configurations emerging
from Experiment 1 and the baseline. Specifically, we used long justifications based
on top-10 aspects. In a nutshell, our baseline identifies the most relevant aspects
by using our Aspect Extraction and Aspect Ranking strategies and randomly
selects a sentence expressing a positive sentiment that contains that aspects. For
more details on the baseline we suggest to refer to our previous work [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ].
          </p>
          <p>Movies</p>
          <p>Aspects+Summar. Aspects Indifferent</p>
          <p>As shown in Table 4, most of the users indicated that they preferred our
methodology based on automatic text summarization. It is worth to note that
we obtained the higher results for persuasion and engagement. This is a very
encouraging outcome that confirmed the intuition behind this work, since the
exploitation of text summarization can help to make interesting information
about the recommended item emerge, and this can persuade the user in enjoying
the item or can let the user discover new information about the item itself.
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>Overall, we can state the results emerging from these experiments confirmed the
effectiveness of the approach, and showed that automatic text summarization
can be useful to identify the most relevant aspects of the items and support the
suggestions generated by a recommendation algorithm.</p>
      <p>
        As future work we will introduce some strategy to automatically tune the
parameters of the model, in order to dynamically select the optimal number
of aspects and sentences to be included. Moreover, we will also evaluate more
sophisticated techniques for natural language processing, in order to include
also entities and bigrams in our justifications, and we will investigate how the
effectiveness of the justifications changes on varying of the different algorithms
used to generate the recommendation, as those based on Linked Open Data [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ],
distributional semantics [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and deep learning techniques [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ].
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Balazs</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Velásquez</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          :
          <article-title>Opinion mining and information fusion: a survey</article-title>
          .
          <source>Information Fusion</source>
          <volume>27</volume>
          ,
          <fpage>95</fpage>
          -
          <lpage>110</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Biran</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cotton</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Explanation and justification in machine learning: A survey</article-title>
          .
          <source>In: IJCAI-17 Workshop on Explainable AI (XAI)</source>
          . p.
          <volume>8</volume>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Augmenting service recommender systems by incorporating contextual opinions from user reviews</article-title>
          .
          <source>User Modeling and User-Adapted Interaction</source>
          <volume>25</volume>
          (
          <issue>3</issue>
          ),
          <fpage>295</fpage>
          -
          <lpage>329</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Cramer</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Evers</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ramlal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van Someren</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rutledge</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stash</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aroyo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wielinga</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>The effects of transparency on trust in and acceptance of a content-based art recommender</article-title>
          .
          <source>User Modeling and User-Adapted Interaction</source>
          <volume>18</volume>
          (
          <issue>5</issue>
          ),
          <fpage>455</fpage>
          -
          <lpage>496</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Haveliwala</surname>
          </string-name>
          , T.H.:
          <article-title>Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search</article-title>
          .
          <source>IEEE Trans. Knowl. Data Eng</source>
          .
          <volume>15</volume>
          (
          <issue>4</issue>
          ),
          <fpage>784</fpage>
          -
          <lpage>796</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kan</surname>
            ,
            <given-names>M.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Trirank: Review-aware explainable recommendation by modeling aspects</article-title>
          .
          <source>In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management</source>
          . pp.
          <fpage>1661</fpage>
          -
          <lpage>1670</lpage>
          . ACM (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>HU</surname>
            ,
            <given-names>Z.k.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>ZHENG</surname>
            ,
            <given-names>X.l.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>WU</surname>
            ,
            <given-names>Y.f.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>CHEN</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          r.:
          <article-title>Product recommendation algorithm based on users reviews mining</article-title>
          .
          <source>Journal of Zhejiang</source>
          University (Engineering Science)
          <volume>8</volume>
          ,
          <issue>023</issue>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kullback</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leibler</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          :
          <article-title>On information and sufficiency</article-title>
          .
          <source>The annals of mathematical statistics 22(1)</source>
          ,
          <fpage>79</fpage>
          -
          <lpage>86</lpage>
          (
          <year>1951</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , L.:
          <article-title>A survey of opinion mining and sentiment analysis</article-title>
          .
          <source>In: Mining text data</source>
          , pp.
          <fpage>415</fpage>
          -
          <lpage>463</lpage>
          . Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Distributed representations of words and phrases and their compositionality</article-title>
          .
          <source>In: NIPS</source>
          . pp.
          <fpage>3111</fpage>
          -
          <lpage>3119</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Musto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
          </string-name>
          , P., de Gemmis, M.:
          <article-title>Random indexing and negative user preferences for enhancing content-based recommender systems</article-title>
          .
          <source>In: EC-Web 2011. Lecture Notes in Business Inf. Processing</source>
          , vol.
          <volume>85</volume>
          , pp.
          <fpage>270</fpage>
          -
          <lpage>281</lpage>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Musto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basile</surname>
            , P., de Gemmis,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>Semantics-aware graph-based recommender systems exploiting linked open data</article-title>
          .
          <source>In: Proceedings of the 2016 Conference on User Modeling Adaptation and Personalization</source>
          . pp.
          <fpage>229</fpage>
          -
          <lpage>237</lpage>
          . ACM (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Musto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
            , P., de Gemmis,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>Justifying recommendations through aspect-based sentiment analysis of users reviews</article-title>
          . In: Papadopoulos,
          <string-name>
            <given-names>G.A.</given-names>
            ,
            <surname>Samaras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Weibelzahl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Jannach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Santos</surname>
          </string-name>
          ,
          <string-name>
            <surname>O.C</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 27th ACM Conference on User Modeling, Adaptation and Personalization</source>
          ,
          <string-name>
            <surname>UMAP</surname>
          </string-name>
          <year>2019</year>
          , Larnaca, Cyprus, June 9-12,
          <year>2019</year>
          . pp.
          <fpage>4</fpage>
          -
          <lpage>12</lpage>
          . ACM (
          <year>2019</year>
          ). https://doi.org/10.1145/3320435.3320457, https://doi.org/10. 1145/3320435.3320457
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Musto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narducci</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Gemmis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>A tag recommender system exploiting user and community behavior</article-title>
          .
          <source>Recommender Systems &amp; the Social Web</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Musto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narducci</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
            , P., de Gemmis,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Combining collaborative and content-based techniques for tag recommendation</article-title>
          .
          <source>In: International Conference on Electronic Commerce and Web Technologies</source>
          . pp.
          <fpage>13</fpage>
          -
          <lpage>23</lpage>
          . Springer (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Musto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rossiello</surname>
            , G., de Gemmis,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>Combining text summarization and aspect-based sentiment analysis of users' reviews to justify recommendations</article-title>
          . In: Bogers,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Said</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Brusilovsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Tikk</surname>
          </string-name>
          ,
          <string-name>
            <surname>D</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 13th ACM Conference on Recommender Systems, RecSys</source>
          <year>2017</year>
          , Copenhagen, Denmark,
          <source>September 16-20</source>
          ,
          <year>2019</year>
          . pp.
          <fpage>383</fpage>
          -
          <lpage>387</lpage>
          . ACM (
          <year>2019</year>
          ). https://doi.org/10.1145/3298689.3347024, https://doi.org/ 10.1145/3298689.3347024
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Radev</surname>
            ,
            <given-names>D.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jing</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sty</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tam</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Centroid-based summarization of multiple documents</article-title>
          .
          <source>Inf. Process. Manage</source>
          .
          <volume>40</volume>
          (
          <issue>6</issue>
          ),
          <fpage>919</fpage>
          -
          <lpage>938</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Rossiello</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basile</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>Centroid-based text summarization through compositionality of word embeddings</article-title>
          . In: Giannakopoulos,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Lloret</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Conroy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.M.</given-names>
            ,
            <surname>Steinberger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Litvak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Rankel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.A.</given-names>
            ,
            <surname>Favre</surname>
          </string-name>
          ,
          <string-name>
            <surname>B</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the Workshop on Summarization and Summary Evaluation Across Source Types and Genres</source>
          ,
          <source>MultiLing@EACL</source>
          <year>2017</year>
          , Valencia, Spain, April 3,
          <year>2017</year>
          . pp.
          <fpage>12</fpage>
          -
          <lpage>21</lpage>
          . Association for Computational Linguistics (
          <year>2017</year>
          ), https://aclanthology.info/ papers/W17-1003/w17-
          <fpage>1003</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Schrage</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>How the big data explosion has changed decision making</article-title>
          .
          <source>Harvard Business Review</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Sinha</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Swearingen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>The role of transparency in recommender systems</article-title>
          . In: CHI'
          <article-title>02 extended abstracts on Human factors in computing systems</article-title>
          . pp.
          <fpage>830</fpage>
          -
          <lpage>831</lpage>
          . ACM (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Suglia</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greco</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Musto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>de Gemmis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>A deep architecture for content-based recommendations exploiting recurrent neural networks</article-title>
          .
          <source>In: Proceedings of the 25th conference on user modeling, adaptation and personalization</source>
          . pp.
          <fpage>202</fpage>
          -
          <lpage>211</lpage>
          . ACM (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Tintarev</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Masthoff</surname>
          </string-name>
          , J.:
          <article-title>Evaluating the effectiveness of explanations for recommender systems</article-title>
          .
          <source>UMUAI</source>
          <volume>22</volume>
          (
          <issue>4-5</issue>
          ),
          <fpage>399</fpage>
          -
          <lpage>439</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>