<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">iim</journal-id>
      <journal-title-group>
        <journal-title>Intelligent Information Management</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2160-5920</issn>
      <issn pub-type="ppub">2160-5912</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/iim.2026.182003</article-id>
      <article-id pub-id-type="publisher-id">iim-149823</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Recommendation Generation Justified for Information Access Assistance Service (IAAS): Study of Architectural Approaches and Post-Hoc Algorithm</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Kabore</surname>
            <given-names>Kisito Kiswendsida</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Kyelem</surname>
            <given-names>Yacouba</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Ouedraogo</surname>
            <given-names>Tounwendyam Frédéric</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Département d’Informatique, Université Joseph Ki-Zerbo, Ouagadougou, Burkina Faso </aff>
      <aff id="aff2"><label>2</label> Département d’Informatique, Université Norbert Zongo, Koudougou, Burkina Faso </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>04</day>
        <month>03</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>03</month>
        <year>2026</year>
      </pub-date>
      <volume>18</volume>
      <issue>02</issue>
      <fpage>32</fpage>
      <lpage>51</lpage>
      <history>
        <date date-type="received">
          <day>01</day>
          <month>01</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>25</day>
          <month>02</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>28</day>
          <month>02</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/iim.2026.182003">https://doi.org/10.4236/iim.2026.182003</self-uri>
      <abstract>
        <p>Recommendation systems only provide more specific recommendations to users. They do not consider giving a justification for the recommendation. However, the justification for the recommendation allows the user to make the decision whether or not to accept the recommendation. It also improves user satisfaction and the relevance of the recommended item. However, the IAAS recommendation system that uses advisories to make recommendations does not provide a justification for the recommendations. That is why in this article, our task consists for helping IAAS users to justify their recommendations. For this, we conducted a related work on architectures and approaches for justifying recommendations in order to identify an architecture and approach suitable for the context of IAAS. From the analysis in this article, we note that neither of these approaches uses the notices (IAAS mechanism) to justify their recommendations. Therefore, existing architectures cannot be used in the context of IAAS. That is why, we have developed a new IAAS architecture that deals separately with item filtration and justification extraction that accompanied the item during recommendation generation. And we have improved the reviews by adding users’ reviews on the items. The user’s notices include the Documentary Unit (DU), the user Group (G), the Justification (J) and the weight (a); noted A = (DU, G, J, a).</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>IAAS</kwd>
        <kwd>Justification of Recommendations</kwd>
        <kwd>Weight of Comments</kwd>
        <kwd>Relevance of Recommendations</kwd>
        <kwd>Justification of Recommendation Architecture for IAAS</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>In order to facilitate the access to the information contained in information systems, recommendation systems have been developed; these systems use the actions of users realized on the system to filter information. These recommendation systems have undergone a high evolution and have allowed the implementation of several approaches, such as: the content-based filtering approach, the collaborative filtering approach, the hybrid approach, the demographic approach and the social approach etc. [<xref ref-type="bibr" rid="B1">1</xref>]. All these approaches have been proposed in order to produce relevant recommendations to users. As for the collaborative filtering approach, the system uses the ratings of similar users to provide them recommendations [<xref ref-type="bibr" rid="B1">1</xref>]. With this approach, several algorithms allowing to provide more accurate recommendations to the user have been developed, for instance IAAS.</p>
      <p>IAAS, Information Access Assistance Service is an example of collaborative filtering recommendation system. This system aims to be applied in several domains, such as videos, audios, images and documents. It uses the notion of voting as a technique for evaluating items. This vote is carried out by the user after having taken note of the document. This user estimates that the document is important for one or more other users, and it materializes it through a notice [<xref ref-type="bibr" rid="B2">2</xref>]-[<xref ref-type="bibr" rid="B5">5</xref>]. In IAAS [<xref ref-type="bibr" rid="B3">3</xref>], a user’s notice is evidenced by the documentary unit, the user’s group and the weight of the recommendation.</p>
      <p>All recommendation approaches have produced algorithms to provide more accurate recommendations to the user. However, the accuracy of the recommendation and its acceptance improves when the user is able to understand the limitations and benefits that provide the recommendation. Otherwise, the user must receive the recommendation with the reasoning behind it [<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B7">7</xref>]. Thanks to these observations and to the evolution of recommendation systems which is to improve the interface through the justification of recommendations, the notion of justification has been introduced in recommendation systems. There are several styles of justifications: keyword justification, influence based justification, content based justification, users reviews justification and comparative justification etc. [<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B8">8</xref>][<xref ref-type="bibr" rid="B9">9</xref>]. The justified recommendation gives credibility to the recommendation system.</p>
      <p>We note that IAAS does not provide a justification for the recommendations generated. That is why, the justification of recommendations in IAAS must be considered in order to improve the accuracy and acceptability of recommendations. But how to generate a justified recommendation from the notices? What type of justification style and architecture should be used?</p>
      <p>So we’re going to see through this study how to justify the recommendations with the IAAS algorithm, Algorithm 1. To achieve this, we will conduct related work on the justification and architecture approaches used in recommendation systems. Then, we will make a comparative table of approaches and architectures. Finally, we will position ourselves and propose an architecture for IAAS. This article is organized as follows:</p>
      <p>Related work on IAAS, approaches and architecture for justification of recommendation;Comparative study of approaches and architectures for justifications of recommendations;Positioning for justification in IAAS;Recommendation justification architecture in IAAS.</p>
    </sec>
    <sec id="sec2">
      <title>2. Related Work</title>
      <sec id="sec2dot1">
        <title>2.1. Information Access Assistance Service (IAAS)</title>
        <p>In the IAAS recommendation system, the users appreciate the different documentary units during their consultation and this appreciation is carried out by giving a grade to the documentary unit. Thus, a user gives his notice (A) which is a grade “a” ranging from 1 to 10, on a documentary unit (UD) and a given group (G). Hence for [<xref ref-type="bibr" rid="B2">2</xref>][<xref ref-type="bibr" rid="B3">3</xref>], the notice is defined by the following triplet A = (UD, G, a).</p>
        <p>The system collects all these relevance notices and proceeds implicitly to the calculation and ranking of the relevant items for the user. As each documentary unit can receive several relevance notices, the notion of recommendation weight Pk(UDiGj) has been proposed by [<xref ref-type="bibr" rid="B2">2</xref>]-[<xref ref-type="bibr" rid="B4">4</xref>]. The calculation allows to give a weight to each item to be recommended. As a group of users can receive the recommendation of the same document through several users, the total weight is calculated from the following formula [<xref ref-type="bibr" rid="B2">2</xref>]-[<xref ref-type="bibr" rid="B4">4</xref>]:</p>
        <p> Pk(UDiGj) = sum(UDi, Gj, a) (1)</p>
        <p>In the case of a document that has no relevance notice by a user its recommendation weight pk is zero [<xref ref-type="bibr" rid="B2">2</xref>]-[<xref ref-type="bibr" rid="B4">4</xref>].</p>
        <p> Pk(UDiGj) = 0 (2)</p>
        <p>In IAAS, a user’s connection to the system is analyzed as a request to transmit recommendations. The recommendation transmitted to a user contains all the documents recommended to his group.</p>
        <p>For each user group, after calculating the recommendation weight for each item, IAAS orders the list of documents based on the relevance value. The relevance value is expressed by the following formula [<xref ref-type="bibr" rid="B2">2</xref>]:</p>
        <p>Relevance P<sub>i,j</sub> = ln(1+ Pk(UDiGj))(3)</p>
        <p>The documents are ordered according to the decreasing values of P<sub>i,j</sub> and then reordered several times according to the users’ profile to be personalized to each user of the group.</p>
        <p>The notion of profile is very fundamental in IAAS. Indeed, in order to personalize the recommendations to the users, [<xref ref-type="bibr" rid="B2">2</xref>]-[<xref ref-type="bibr" rid="B4">4</xref>] have implemented the user profile and the document profile. These profiles are schemas that can be consulted in the works of [<xref ref-type="bibr" rid="B2">2</xref>][<xref ref-type="bibr" rid="B3">3</xref>][<xref ref-type="bibr" rid="B5">5</xref>].</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId13.jpeg?20260228094342" />
        </fig>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. Justification Approaches</title>
        <p>We present in this part of our work, the summary of the work already done on the approaches of justification in the systems of recommendations.</p>
        <p>2.2.1. Approach Feature-Weighted Nearest Biclusters (FWNB)</p>
        <p>The FWNB approach is built around four elements that are user group creation, keyword weighting, neighborhood formation, and recommendation and justification generation [<xref ref-type="bibr" rid="B6">6</xref>].</p>
        <p>Creation of user groups: it is based on the formation of user and item biclusters. The formation of these biclusters is done thanks to the similarity between users and items they have already evaluated. This bicluster formation is done automatically using the xMotif algorithm [<xref ref-type="bibr" rid="B10">10</xref>].Weight of keywords: The objective of [<xref ref-type="bibr" rid="B6">6</xref>] in constructing keyword weights is to find the distinct keywords that best describe the users’ preferences. For this purpose, [<xref ref-type="bibr" rid="B6">6</xref>] used the similarity matrix between keywords and users. The weight of keyword f for a user u is calculated as follows:</p>
        <disp-formula id="FD4">
          <label>(4)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>W</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mtext>u</mml:mtext>
                  <mml:mo>,</mml:mo>
                  <mml:mtext>f</mml:mtext>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mtext>FF</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mtext>u</mml:mtext>
                  <mml:mo>,</mml:mo>
                  <mml:mtext>f</mml:mtext>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>∗</mml:mo>
              <mml:mtext>IUF</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mtext>f</mml:mtext>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD5">
          <label>(5)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>IUF</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mtext>f</mml:mtext>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>log</mml:mi>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mtext>U</mml:mtext>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:mtext>UF</mml:mtext>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mtext>f</mml:mtext>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>|U|: total number of users and UF(f): number of users in which the keyword f appears at least once.</p>
        <p>FF(u,f)=P(u,f) is the correlation between the user and the keyword f.</p>
        <p>Using the keyword user correlation matrix R_B (u,f), they generate the keyword weight matrix W_B from the formula W(u,f) [<xref ref-type="bibr" rid="B6">6</xref>].</p>
        <p>Neighborhood formation: This is the identification phase of the items and keywords to be recommended. All the items contained in the biclusters are candidates for recommendation as well as the keywords. Thus, we determine the item and the justification for each user through the calculation of similarity between the user and his bicluster:</p>
        <p>sim(u,b) = (1 − a) · simI(u,b)+ a · simF(u,b) (6)</p>
        <p>simI(u,b): similarity between the user and his item; a[0, 1]; simF(u,b): similarity between the user and keyword</p>
        <p>Recommendation and justification generation: the generation of the item to be recommended as well as the corresponding keyword is done by simultaneous identification of the items in the neighborhood of the bicluster of a user u who:are all preferred by other users according to the scores of the R_B matrixcontain the significant keywords of the matrix W_B.</p>
        <p>The generated recommendation is the form, “item X is recommended to you because it contains the keyword f that you have already evaluated in item Y”.</p>
        <p>2.2.2. Approach of Cataldo <italic>et al</italic><italic>.</italic></p>
        <p>[<xref ref-type="bibr" rid="B9">9</xref>] was interested in building an effective justification designed on the basis of the distinctive and relevant terms for the item starting from the users’ reviews. For him, the effective justification must include the relevant and distinctive terms of the items that are discussed in the reviews. The approach of [<xref ref-type="bibr" rid="B9">9</xref>] is structured as follows: terms extraction, terms ranking, sentences filtering and the text summarization.</p>
        <p>Feature extraction: The first step is to identify the features that deserve to be included in the final justification. Thus the strategy of [<xref ref-type="bibr" rid="B9">9</xref>] takes as input a set of reviews <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> R </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> r </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> r </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> r </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and produces a set of 4-tuples <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> r </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> a </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:mi> r </mml:mi><mml:mi> e </mml:mi><mml:mi> l </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> a </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> r </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> , </mml:mo><mml:mi> s </mml:mi><mml:mi> e </mml:mi><mml:mi> n </mml:mi><mml:mi> t </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> a </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> r </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . To extract the terms of the critics, [<xref ref-type="bibr" rid="B9">9</xref>] used the Kullback-Leibler divergence [<xref ref-type="bibr" rid="B11">11</xref>], which is a non-symmetric measure of the difference between two distributions to construct an algorithm.Ranking the extracted terms: [<xref ref-type="bibr" rid="B9">9</xref>] proceeded to calculate the score of the extracted terms by the following formula:</p>
        <disp-formula id="FD7">
          <label>(7)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>s</mml:mi>
              <mml:mi>c</mml:mi>
              <mml:mi>o</mml:mi>
              <mml:mi>r</mml:mi>
              <mml:mi>e</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>a</mml:mi>
                    <mml:mi>j</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:msubsup>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>i</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                      <mml:mi>N</mml:mi>
                    </mml:msubsup>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>n</mml:mi>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>a</mml:mi>
                            <mml:mi>j</mml:mi>
                          </mml:msub>
                          <mml:mo>,</mml:mo>
                          <mml:msub>
                            <mml:mi>r</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>∗</mml:mo>
                      <mml:mi>r</mml:mi>
                      <mml:mi>e</mml:mi>
                      <mml:mi>l</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>a</mml:mi>
                            <mml:mi>j</mml:mi>
                          </mml:msub>
                          <mml:mo>,</mml:mo>
                          <mml:msub>
                            <mml:mi>r</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>∗</mml:mo>
                      <mml:mi>s</mml:mi>
                      <mml:mi>e</mml:mi>
                      <mml:mi>n</mml:mi>
                      <mml:mi>t</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>a</mml:mi>
                            <mml:mi>j</mml:mi>
                          </mml:msub>
                          <mml:mo>,</mml:mo>
                          <mml:msub>
                            <mml:mi>r</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mstyle>
                </mml:mrow>
                <mml:mi>N</mml:mi>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>At the end, the terms are ranked in descending order and the K-first ones are labeled as main terms.</p>
        <p>Sentence filtering: After the identification of the terms, we proceed to a sentence filtering with the objective of filtering out the sentences that are considered not necessary in the final justification. To do this, we divide the criticisms <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> r </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:mi> R </mml:mi></mml:mrow></mml:math></inline-formula> into sentences si1, ...., sim. Then we check if the sentences respect in particular the criteria of content of the extracted terms. A top k of sentences are selected.Text summarization: the summary highlights the main contents of the item’s reviews and maximizes both the coverage and the diversity of the justification while avoiding redundancy. The approach in [<xref ref-type="bibr" rid="B9">9</xref>] combines centroid-based text summarization [<xref ref-type="bibr" rid="B12">12</xref>], which has the advantage of being unsupervised, with a pre-trained neural language model, such as Word2Vec [<xref ref-type="bibr" rid="B13">13</xref>].</p>
        <p>[<xref ref-type="bibr" rid="B8">8</xref>] is an extension on the generation of justification of recommendations combining the text summary and the analysis of sentiments cited by [<xref ref-type="bibr" rid="B9">9</xref>]. Indeed, in [<xref ref-type="bibr" rid="B9">9</xref>], the problem addressed is the implementation of a methodology for justifying recommendations in natural language by extracting aspects, classifying aspects, extracting sentences and summarizing texts. The justification for the recommendation submitted to the user is then the summary of reviews from other users and containing the item characteristics.</p>
        <p>In [<xref ref-type="bibr" rid="B8">8</xref>], the same author went to the implementation of this methodology. The review found that the justification for recommendations based on summaries of user feedback provided relevant justification. Moreover, for him the justification with long sentences is even better than short sentences.</p>
        <p>2.2.3. Approach of Jianmo<italic>et al</italic><italic>.</italic></p>
        <p>The generation of justifications for recommendations in [<xref ref-type="bibr" rid="B14">14</xref>] is done using a pipeline to identify candidate terms for justification and to form the users and item profiles from a corpus of reviews. The candidate terms are the reviews that the user had previously written. [<xref ref-type="bibr" rid="B14">14</xref>] constructs a dataset containing the custom’s reviews for each user. The construction of the pipeline starts with the annotation of the reviews, then the classification of the annotated terms using the calculation of the distance between the selected terms and ends with the extraction of the justifications and the construction of the user and item profiles. Thus, for each user u we build the pipeline using the reference justifications D = (fd1; ...; dlr) consisting only of the justifications that the user had written.</p>
        <p>Then we have the user profile composed of A = (a1; ... ; aK), we carry the most relevant ones and in the same way we build the items profile. For a user u and an item i as well as their reference justifications Du and Di, and the user profile Au and Ai of the item; we predict the justifications Ju;i = (w1;w2;...;wt) that explain why the item i is important for the user u. [<xref ref-type="bibr" rid="B14">14</xref>] identifies the terms or phrases using [<xref ref-type="bibr" rid="B15">15</xref>] and linguistic analysis. After identification, [<xref ref-type="bibr" rid="B14">14</xref>] uses the BERT [<xref ref-type="bibr" rid="B16">16</xref>] method for automatic classification of justifications and uses Fine-grained Aspect Extraction [<xref ref-type="bibr" rid="B17">17</xref>] for the extraction and the profile construction. The approach of [<xref ref-type="bibr" rid="B14">14</xref>] uses two models in its approach which are: Reference-based Seq2Seq Model and Aspect Conditional Masked Language Model. The experimentation has shown that the former produces high quality justifications and the latter produces diverse justifications.</p>
        <p>2.2.4. Approach of Arpit <italic>et al</italic><italic>.</italic></p>
        <p>The explanation-based recommendation is a new approach that unifies recommendation and explanation. The recommendation is modeled as a path finding problem in the item-item similarity graph [<xref ref-type="bibr" rid="B18">18</xref>].</p>
        <p>Once a chain has been constructed for each candidate item, the top-n chains are iteratively selected based on their total coverage of the candidate item terms and their dissimilarities with other top-n chains. The approach of [<xref ref-type="bibr" rid="B18">18</xref>] is built on the generation of explanation chains and the evaluation of this chain.</p>
        <p>Generation of explanation chains:</p>
        <disp-formula id="FD8">
          <label>(8)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>r</mml:mi>
              <mml:mi>w</mml:mi>
              <mml:mi>d</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>j</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>i</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>C</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>f</mml:mi>
                            <mml:mi>j</mml:mi>
                          </mml:msub>
                          <mml:mo>\</mml:mo>
                          <mml:mtext>covered</mml:mtext>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mrow>
                              <mml:mi>i</mml:mi>
                              <mml:mo>,</mml:mo>
                              <mml:mi>C</mml:mi>
                            </mml:mrow>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>∩</mml:mo>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>+</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>f</mml:mi>
                            <mml:mi>j</mml:mi>
                          </mml:msub>
                          <mml:mo>\</mml:mo>
                          <mml:mtext>covered</mml:mtext>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mrow>
                              <mml:mi>i</mml:mi>
                              <mml:mo>,</mml:mo>
                              <mml:mi>C</mml:mi>
                            </mml:mrow>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>∩</mml:mo>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:mi>j</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Evaluation of explanation chains:</p>
        <disp-formula id="FD9">
          <label>(9)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>s</mml:mi>
              <mml:mi>c</mml:mi>
              <mml:mi>o</mml:mi>
              <mml:mi>r</mml:mi>
              <mml:mi>e</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>{</mml:mo>
                    <mml:mrow>
                      <mml:mi>C</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>i</mml:mi>
                    </mml:mrow>
                    <mml:mo>}</mml:mo>
                  </mml:mrow>
                  <mml:mo>,</mml:mo>
                  <mml:msup>
                    <mml:mi>C</mml:mi>
                    <mml:mo>∗</mml:mo>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:msub>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>j</mml:mi>
                        <mml:mo>∈</mml:mo>
                        <mml:mi>C</mml:mi>
                      </mml:mrow>
                    </mml:msub>
                    <mml:mrow>
                      <mml:mi>r</mml:mi>
                      <mml:mi>w</mml:mi>
                      <mml:mi>d</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mi>j</mml:mi>
                          <mml:mo>,</mml:mo>
                          <mml:mi>i</mml:mi>
                          <mml:mo>,</mml:mo>
                          <mml:mi>C</mml:mi>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mstyle>
                </mml:mrow>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mi>C</mml:mi>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>+</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mrow>
                      <mml:mi>C</mml:mi>
                      <mml:mo>\</mml:mo>
                      <mml:msub>
                        <mml:mo>∪</mml:mo>
                        <mml:mrow>
                          <mml:msup>
                            <mml:mi>j</mml:mi>
                            <mml:mo>′</mml:mo>
                          </mml:msup>
                          <mml:mo>∈</mml:mo>
                          <mml:mi>C</mml:mi>
                          <mml:mo>∗</mml:mo>
                          <mml:msup>
                            <mml:mi>J</mml:mi>
                            <mml:mo>′</mml:mo>
                          </mml:msup>
                        </mml:mrow>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mi>C</mml:mi>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Then comes the selection of items to be presented to the user. The technique of [<xref ref-type="bibr" rid="B18">18</xref>] does not compute separately the selection of items and justifications.</p>
        <p>2.2.5. Approach of Or Biran <italic>et al</italic><italic>.</italic></p>
        <p>[<xref ref-type="bibr" rid="B19">19</xref>] proposes an automatic prediction method using machine learning to produce simple, short, quality natural language justifications; through the use of application domain critics [<xref ref-type="bibr" rid="B11">11</xref>]. This approach has a message prediction structure and architecture.</p>
        <p>[<xref ref-type="bibr" rid="B19">19</xref>] uses the Semantic Template Typed (STT) message structure which is a small semantic network of typed entity slots and relationships for prediction. A set of STTs have been created for each justification domain and use specific STTs to a domain, as well as template sets, from text corpora for words extraction.</p>
        <p>The template construction architecture of [<xref ref-type="bibr" rid="B19">19</xref>] consists of term selection and characterization, computation of certain quantities if any, and justification planning.</p>
        <p>2.2.6. Approach of Namyong<italic>et al</italic><italic>.</italic></p>
        <p>[<xref ref-type="bibr" rid="B20">20</xref>] raised the issue of using user data and items to generate the justification for the various and more concise recommendations. And to do that, he solves it in graph form. [<xref ref-type="bibr" rid="B20">20</xref>] to be developed J-RECS and J-RECS can be used with any kind of recommendation algorithm. J-RECS is a post-hoc framework that integrates justifications. J-RECS does not use labeled data but rather is guided by a set of principles to characterize the desired justifications. In post-hoc approaches the recommendations are first sent to the user and then the corresponding justification. The recommendation and justification are not sent to the user at the same time.</p>
        <p>In this approach you can recommend any item. The approach of [<xref ref-type="bibr" rid="B20">20</xref>] uses the user’s past actions (item details, item keywords, item notices) to recommend a new item from his environment or not. This is the similarity calculation between the attributes of the items already evaluated and the new item. For the generation of the recommendation, [<xref ref-type="bibr" rid="B21">21</xref>] put in place an item graph and justification.</p>
        <p>Item Graph: the data to construct the graph is the set of items evaluated or not. A link is established between items or keywords etc. if they share the same attributes (<xref ref-type="fig" rid="fig1">Figure 1</xref>) [<xref ref-type="bibr" rid="B20">20</xref>].</p>
        <p>Justification: when an item enters the environment based on its information, the system establishes links with the information of the items already evaluated by the user. And since the items already evaluated contain justifications corresponding easily, the system selects the appropriate justification for the item. For example, the rationale for the recommendation of director James Cameron’s film may be: “We recommend this movie directed by James Cameron, who made movies that are similar to other movies you watched.” And later, this can be improved with user comments after watching this movie: “Check out this user review, which closely reflects your preference, and explains why you should consider buying this item” (<xref ref-type="fig" rid="fig1">Figure 1</xref>) [<xref ref-type="bibr" rid="B20">20</xref>].</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId30.jpeg?20260228094350" />
        </fig>
        <p><bold>Figure 1.</bold> Recommended item and justified [<xref ref-type="bibr" rid="B20">20</xref>].</p>
        <p>2.2.7. Approach of Mauro <italic>et al</italic><italic>.</italic></p>
        <p>[<xref ref-type="bibr" rid="B21">21</xref>] worked on the issue of apartment reservation. For him the most important elements in the booking must take into account the properties of the apartments but also the perception of previous customers of the interaction with the staff who manages the houses. To automate the perception of past customers [<xref ref-type="bibr" rid="B21">21</xref>] proposed the generation of summaries of previous consumers’ opinions on suggested articles. Once the user logs on to the systems, they can choose the relevant items. Then he has the detailed information of each item [<xref ref-type="bibr" rid="B21">21</xref>].</p>
        <p>The Blueprint system models the different steps of a person in contact with the system, taking into account their explicit and implicit actions. In this case the physical interaction actions are when the user makes a reservation and his confirmation by his presence. Employee actions can be home availability check, customer records etc. [<xref ref-type="bibr" rid="B21">21</xref>].</p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. Related Work on the Architectures</title>
        <p>2.3.1. Architecture of MoviExplain</p>
        <p>Here we have an architecture consisting of four main parts (recommendation explorer, database, web explorer, web site), each part of which contains several components. The website consists of the guideline explanation system, the search engine and the evaluation system. The guideline explorer groups together the moviExplain algorithm, similar characteristics and similarity assessment. In <xref ref-type="fig" rid="fig2">Figure 2</xref>, the recommendation explanation system in MoviExplain is feature-based. To do this, MoviExplain builds the feature profile for each user. Finally, MoviEplain generates the recommendation plus the rationale which is the characteristic that has influenced the recommendation. This is the most important feature in the user profile (<xref ref-type="fig" rid="fig2">Figure 2</xref>) [<xref ref-type="bibr" rid="B22">22</xref>].</p>
        <p>2.3.2. Knowledge-Desire-Intention (KDI) Framework</p>
        <p>[<xref ref-type="bibr" rid="B23">23</xref>] implemented a framework architecture to generate personalized knowledge recommendations while justifying them in the Social Internet of Things (SIoT). This technique uses user preferences and feedback to build an indexed knowledge </p>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId31.jpeg?20260228094355" />
        </fig>
        <p><bold>Figure 2.</bold> Architecture of MoviExplain [<xref ref-type="bibr" rid="B22">22</xref>].</p>
        <p>base. To generate the KDI recommendation, three modules are used: the knowledge module, the desire module and the decision-making module.</p>
        <p>KDI makes a recommendation of knowledge while justifying it. This justification is obtained by calculating and classifying justifications, and the high value justification.</p>
        <p>KDI uses the desire module which is itself enriched by the knowledge module to generate the recommendations of the justified knowledge. In <xref ref-type="fig" rid="fig3">Figure 3</xref>, KDI’s recommendation system uses a hierarchical level of belief in the handling of justified recommendations.</p>
        <p>2.3.3. Architecture of Mauro <italic>et al</italic><italic>.</italic></p>
        <p>The architecture of [<xref ref-type="bibr" rid="B21">21</xref>] in <xref ref-type="fig" rid="fig4">Figure 4</xref>, offers two main levels such as user actions and dimensions evaluation. The dimensions assessment is mapped and divided into two parts as shown in the figure below (<xref ref-type="fig" rid="fig4">Figure 4</xref>). The first two lines are the parts of the dimension assessments, and the last line is the user actions. During the interaction with the hotel website the user leaves suggestions which are used to enrich the justification of the recommendations in the near future.</p>
        <p>2.3.4. Architecture of Arpit <italic>et al</italic><italic>.</italic></p>
        <p>From a set of items with explanations for them, [<xref ref-type="bibr" rid="B18">18</xref>] constructs the rationale for recommending the items. Thus, starting from the items preferred by the users, [<xref ref-type="bibr" rid="B18">18</xref>] proposes a chain of explanations of these items already evaluated to extract the candidate items that have the best explanations. This architecture shows the icons of the movies and the keywords that accompany them. In <xref ref-type="fig" rid="fig5">Figure 5</xref>, we have the items already evaluated by the user as well as the candidate item waiting to be recommended in case of correlation of the keywords with the needs of this user.</p>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId32.jpeg?20260228094358" />
        </fig>
        <p><bold>Figure 3.</bold> Architecture of KDI [<xref ref-type="bibr" rid="B23">23</xref>].</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId33.jpeg?20260228094358" />
        </fig>
        <p><bold>Figure 4.</bold> Recommendation justification architecture [<xref ref-type="bibr" rid="B21">21</xref>].</p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId34.jpeg?20260228094358" />
        </fig>
        <p><bold>Figure 5.</bold> Recommendation justification architecture [<xref ref-type="bibr" rid="B21">21</xref>].</p>
        <p>2.3.5. Architecture of Namyong <italic>et al</italic><italic>.</italic></p>
        <p>[<xref ref-type="bibr" rid="B20">20</xref>] proposes a graph model. Qu is the set of items evaluated by the system user and R is the set of items to recommend. All items, attributes, keywords and comments etc. are then modeled by a graph whose each node contains the item, attribute, keyword and comment etc. The red nodes in this modeling are the elements selected for the justified recommendation like in <xref ref-type="fig" rid="fig6">Figure 6</xref>. The establishment of a link between the nodes means a similarity between these elements.</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId35.jpeg?20260228094359" />
        </fig>
        <p><bold>Figure 6.</bold> Recommendation justification architecture [<xref ref-type="bibr" rid="B20">20</xref>].</p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Comparative Study of Approaches and Architectures for Justification of Recommendations</title>
      <p>The table below summarizes the work already done in the area of justifications in recommender systems. The automatic summarization method column was realized after consulting [<xref ref-type="bibr" rid="B24">24</xref>].</p>
      <sec id="sec3dot1">
        <title>3.1. Comparative Table of Approaches to Justification of Recommendations</title>
        <p>The automatic summary method column was completed after consultation with [<xref ref-type="bibr" rid="B24">24</xref>].</p>
        <p>In <bold>Table 1</bold>, our analysis is conducted based on the IAAS literature review, the definition of recommendation justification in IAAS and the summary table of justification approaches. As in IAAS users give their notices on the documents so they must provide their reviews at the same time. Also, the fundamental concept in IAAS is that the user gives a weight to each item that is used to manage and filter documents. So, it is better that we use these same weights to add to the user reviews that will be used as justification filtering strategy. As filtering mechanisms for existing evidence from the table, only [<xref ref-type="bibr" rid="B6">6</xref>] uses the weight of reviews and of the frequencies to filter the justification but does not use user reviews as justification. [<xref ref-type="bibr" rid="B6">6</xref>] cannot be used in our case. Among the approaches studied, [<xref ref-type="bibr" rid="B19">19</xref>] applies only in expert systems whereas IAAS is a non-expert system, and therefore this strategy is not of interest to us in this work. [<xref ref-type="bibr" rid="B18">18</xref>] cannot be used because the keywords written on the items are used to filter and order the list of recommendations to justify. The approaches of [<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B20">20</xref>][<xref ref-type="bibr" rid="B21">21</xref>] and [<xref ref-type="bibr" rid="B14">14</xref>] use the evidence already assessed by users to automatically generate new justified recommendations using the </p>
        <p><bold>Table 1</bold><bold>.</bold> Summarizes the work already done in the area of justifications in recommendation systems.</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>rchitectures</bold>
                </td>
                <td>
                  <bold>Architecture parts</bold>
                </td>
                <td>
                  <bold>Justificative sentences</bold>
                </td>
                <td>
                  <bold>Purpose of the Recommendation</bold>
                </td>
                <td>
                  <bold>Is the recommendation accompanied by justificative sentences?</bold>
                </td>
              </tr>
              <tr>
                <td>
                  MoviExplain [
                  <xref ref-type="bibr" rid="B22">22</xref>
                  ]
                </td>
                <td>Recommendation ExplorerDatabaseWeb ExplorerWebsite</td>
                <td>Item ProfileUser Feature ProfilesMovie profilesProfile of rated films</td>
                <td>Justification for recommended movies</td>
                <td>Yes</td>
              </tr>
              <tr>
                <td>
                  KDI [
                  <xref ref-type="bibr" rid="B23">23</xref>
                  ]
                </td>
                <td>Knowledge ModuleDesire moduleDecision making module</td>
                <td>Users Preference</td>
                <td>Justification for Recommended IOT Knowledge</td>
                <td>Yes</td>
              </tr>
              <tr>
                <td>
                  Mauro
                  <italic>et al</italic>
                  .[
                  <xref ref-type="bibr" rid="B21">21</xref>
                  ]
                </td>
                <td>Dimensions to evaluateUser actions</td>
                <td>Users suggestions</td>
                <td>Justification for recommended apartment reservations</td>
                <td>Yes</td>
              </tr>
              <tr>
                <td>
                  Arpit
                  <italic>et al</italic>
                  .[
                  <xref ref-type="bibr" rid="B18">18</xref>
                  ]
                </td>
                <td>IconsKeywords</td>
                <td>Users Preference</td>
                <td>Justification for Recommended Movies and Books</td>
                <td>No</td>
              </tr>
              <tr>
                <td>
                  Namyong
                  <italic>et al</italic>
                  . [
                  <xref ref-type="bibr" rid="B20">20</xref>
                  ]
                </td>
                <td>ItemsActorsReviewsKeywordsEtc</td>
                <td>Item already rated</td>
                <td>Justification for all recommended items</td>
                <td>Yes</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>numerical approach and learning based methods as a text summary tool. So these approaches are not appropriate. The approach of [<xref ref-type="bibr" rid="B9">9</xref>] seems to have a very similarity because for [<xref ref-type="bibr" rid="B9">9</xref>], the reviews are entered by the users and the system collects all the reviews and then proceeds to process it separately and personalizes the recommendations. Only that in [<xref ref-type="bibr" rid="B9">9</xref>] the reviews are not accompanied by weight and does not use notice. We also have the summary method which is focused on statistical calculations which will be used in the case of IAAS since our reviews will carry weights. The test domain of [<xref ref-type="bibr" rid="B9">9</xref>] is different from that of IAAS because, [<xref ref-type="bibr" rid="B9">9</xref>] is used in the domain of cinema while IAAS is used on the documents, videos, audios and images. We will then do a comparative study of the justifications of recommendations.</p>
        <p>Based on our previous analyses (see subsection 3.5.1), we chose external data sources, namely comments, to justify recommendations for the SAAI. The appropriate justification style is the generation of a summary based on the comments. Indeed, comments offer an advantage in the case of the SAAI because users can simultaneously provide the reason for their opinions. This is also very practical for items that lack keywords, such as audio and video files.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Analysis of Approaches</title>
        <p>We have summarized <xref ref-type="fig" rid="fig7">Figure 7</xref> based on the input data and the justification style shown in <xref ref-type="fig" rid="fig8">Figure 8</xref>. <xref ref-type="fig" rid="fig8">Figure 8</xref> demonstrates that we have both internal and external data for the item as the source for justification. Furthermore, we have generated text as justification containing internal data from the item, or a summary of user comments.</p>
        <fig id="fig8">
          <label>Figure 8</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId36.jpeg?20260228094403" />
        </fig>
        <p><bold>Figure 7.</bold> Comparison of some justification approaches in recommender systems.</p>
        <fig id="fig9">
          <label>Figure 9</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId37.jpeg?20260228094403" />
        </fig>
        <p><bold>Figure 8</bold><bold>.</bold> Sources and style of justification for recommendations.</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Table of Comparison of Recommendation Justification Architectures</title>
        <p><xref ref-type="fig" rid="fig9">Figure 9</xref> summarizes the architectures mentioned in our article. We have identified criteria for parts of the architecture, supporting sentences, the subject of recommendation to better identify our problem.</p>
        <fig id="fig10">
          <label>Figure 10</label>
          <graphic xlink:href="https://html.scirp.org/file/8701833-rId38.jpeg?20260228094405" />
        </fig>
        <p><bold>Figure 9.</bold> Comparison of some recommendations justification architectures.</p>
        <p>From the table we can say that the different parts of the architecture are not the same so changes depending on each recommendation algorithm. Therefore, the source of the recommendation justification words and the purpose of the recommendation are not the same. It is also noted that items recommended to users are accompanied by supporting phrases, except [<xref ref-type="bibr" rid="B18">18</xref>] which uses the keywords that are entered on the items as a justification. From what precede, we can conclude that it does not have a single architecture for all recommendation justification algorithms. But also, justification is not necessarily the justificatives sentences. Otherwise, recommendation justification architecture is built according to user needs, context of use, environment of use (apartment reservation in hotels, knowledge extraction in IOT etc.), items and approaches of recommendations etc.</p>
        <p>From the related work on IAAS we can say that: the IAAS recommendation system does not generate a recommendation with justification phrases [<xref ref-type="bibr" rid="B2">2</xref>]. To address this issue, we will first define a justification architecture for IAAS. Since there is no single architecture for all algorithms, we have defined in section 5 an architecture specific to IAAS. The design of this architecture must necessarily take into account the context of use and the IAAS algorithm [<xref ref-type="bibr" rid="B3">3</xref>].</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Positioning for Justification in IAAS</title>
      <p>The recommendation is justified, the algorithm uses the opinions, the algorithm uses justified opinions and the algorithm uses weights are important criteria for the realization of the IAAS algorithm. The comparison of these criteria with the justification approaches studied is important for the justification of recommendation in IAAS. The data in <bold>Table 2</bold> are obtained from the literature review.</p>
      <p><bold>Table 2.</bold>Approaches to justifying recommendations compared to notice used in IAAS.</p>
      <table-wrap id="tbl2">
        <label>Table 2</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>Algorithms</bold>
              </td>
              <td>
                <bold>Is the recommendation justified?</bold>
              </td>
              <td>
                <bold>Is the algorithm used a notice?</bold>
              </td>
              <td>
                <bold>Is the algorithm used a justified notice?</bold>
              </td>
              <td>
                <bold>Is the algorithm used a weight?</bold>
              </td>
            </tr>
            <tr>
              <td>
                FWNB [
                <xref ref-type="bibr" rid="B6">6</xref>
                ]
              </td>
              <td>Yes</td>
              <td>No</td>
              <td>No</td>
              <td>Yes</td>
            </tr>
            <tr>
              <td>
                Cataldo
                <italic>et al.</italic>
                [
                <xref ref-type="bibr" rid="B8">8</xref>
                ][
                <xref ref-type="bibr" rid="B9">9</xref>
                ]
              </td>
              <td>Yes</td>
              <td>No</td>
              <td>No</td>
              <td>No</td>
            </tr>
            <tr>
              <td>
                Arpit
                <italic>et al.</italic>
                [
                <xref ref-type="bibr" rid="B18">18</xref>
                ]
              </td>
              <td>Yes</td>
              <td>No</td>
              <td>No</td>
              <td>No</td>
            </tr>
            <tr>
              <td>
                Jianmo
                <italic>et al.</italic>
                [
                <xref ref-type="bibr" rid="B14">14</xref>
                ]
              </td>
              <td>Yes</td>
              <td>No</td>
              <td>No</td>
              <td>No</td>
            </tr>
            <tr>
              <td>
                Or biran
                <italic>et al.</italic>
                [
                <xref ref-type="bibr" rid="B19">19</xref>
                ]
              </td>
              <td>Yes</td>
              <td>No</td>
              <td>No</td>
              <td>No</td>
            </tr>
            <tr>
              <td>
                Namyong
                <italic>et al.</italic>
                [
                <xref ref-type="bibr" rid="B20">20</xref>
                ]
              </td>
              <td>Yes</td>
              <td>No</td>
              <td>No</td>
              <td>Yes</td>
            </tr>
            <tr>
              <td>
                Mauro
                <italic>et al.</italic>
                [
                <xref ref-type="bibr" rid="B21">21</xref>
                ]
              </td>
              <td>Yes</td>
              <td>No</td>
              <td>No</td>
              <td>No</td>
            </tr>
            <tr>
              <td>
                IAAS [
                <xref ref-type="bibr" rid="B2">2</xref>
                ]
              </td>
              <td>No</td>
              <td>Yes</td>
              <td>No</td>
              <td>Yes</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>We note that only the IAAS algorithm uses the notices and these notices are not justified. Only [<xref ref-type="bibr" rid="B5">5</xref>] and [<xref ref-type="bibr" rid="B20">20</xref>] use the weight in their algorithm. Apart from IAAS, all other algorithms justify their recommendation. From the above, we ask the following question: how can we justify the recommendations in the form of sentences from the notices? To achieve this, we will add reviews to each notice.</p>
      <p>Based on this comparison, we are going to set up a new approach of recommendation justification which will take into account the notices of users. Instead of a notice being a triplet as proposed by [<xref ref-type="bibr" rid="B2">2</xref>], it must be a quadruplet to take the justifications written by the users. Thus, for the justification in IAAS a notice is now a quadruplet noted A = (DU, G, J, a) where J represents the justification. This message is sent to IAAS for processing as shown in <xref ref-type="fig" rid="fig7">Figure 7</xref>. This study does not question what is done on IAAS but aims to improve it by adding the justification. We will work on keeping the item selection technique and similarly we will develop a module for the processing of justifications.</p>
    </sec>
    <sec id="sec5">
      <title>5. Architecture of Recommendation Justification in IAAS</title>
      <p><xref ref-type="fig" rid="fig10">Figure 10</xref> below expresses the idea of how the recommendation justification in IAAS that we want to implement works. The diagram shows three main entities which are the users, the workstation and the IAAS.</p>
      <fig id="fig11">
        <label>Figure 11</label>
        <graphic xlink:href="https://html.scirp.org/file/8701833-rId39.jpeg?20260228094406" />
      </fig>
      <p><bold>Figure 10.</bold>Description of the recommendation justification in IAAS.</p>
      <p>Users give their notices on the documents and at the same time note the justification of its notice which is sent to IAAS for processing. In IAAS, we have separated the processing of the filtering of the documentary units and the justifications because the justifications are only texts that we want to process whereas the mechanism of filtering of the documents already developed in [<xref ref-type="bibr" rid="B2">2</xref>] is a manipulation of the numbers. After the separate processing of document and credential selections we collect them and then customize them to each user as [<xref ref-type="bibr" rid="B2">2</xref>] provides. Once a user logs in, the system returns his recommendations and it is still possible for him to make a new recommendation. In case a user recommends the same document to the same user group, the system uses the ranking already obtained to make a new readapatation of recommendation. This means that the recommendation is dynamic and therefore evolves with time. As a result, the justification for the recommendation changes with new notices.</p>
      <p>The processing of the users reviews is as follows:</p>
      <p>1) Reviews collection: this is the step of collecting all reviews;</p>
      <p>2) Reviews extraction: this is the step of ranking and extracting relevant reviews collected in 1);</p>
      <p>3) Reviews summarization: this is the last step and it consists of summarizing the relevant reviews extracted in 2) {since one can have redundant sentences}.</p>
      <p>The method for selecting Documentary Units (DUs) is found in [<xref ref-type="bibr" rid="B3">3</xref>].</p>
    </sec>
    <sec id="sec6">
      <title>6. Post-Hoc Algorithm of IAAS for the Justification</title>
      <p>In the post-hoc architecture of the SAAI that we proposed in the previous section (section 3.8), it is important to demonstrate how we retrieve all the information after processing at each branch level. Once the user submits a review, the system selects the items and then processes them according to the SAAI recommendation algorithm. Next, it selects the comments and then performs the necessary filtering. The item filtering process was addressed by Kabore <italic>et al</italic>. [<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B10">10</xref>]; we simply use this filtering algorithm for filtering items at each recommendation level (see section 2.6).</p>
      <fig id="fig12">
        <label>Figure 12</label>
        <graphic xlink:href="https://html.scirp.org/file/8701833-rId40.jpeg?20260228094408" />
      </fig>
      <p>The comment processing is the task we will address in the next chapter, but in the meantime, let’s present the algorithm that reassembles the items and comments after processing, as shown in architecture in <xref ref-type="fig" rid="fig9">Figure 9</xref>.</p>
    </sec>
    <sec id="sec7">
      <title>7. Conclusion</title>
      <p>We have conducted a literature review on IAAS, approaches and recommendation justification architecture. This allowed us to conduct a comparative study in the form of a table of architectures and approaches for justifying recommendations. This comparison allowed for the implementation of the justification architecture for IAAS and the use of the text summary justification style as the justification style in IAAS. It also made it possible to understand that we must implement a justification algorithm for recommendation using the notices of users. In the light of the foregoing, we have taken the view that the notices in IAAS will henceforth be a quadruplet (A = (DU, G, J, a) where J represents the justification) instead of a triplet as [<xref ref-type="bibr" rid="B2">2</xref>] had proposed. This article contributed to the improvement of the relevance of the recommendation in IAAS. However, we can improve our work by adding other approaches. And this is noted as a deficiency. As perspectives, we will produce the corresponding algorithm and then implement it with documentary units, such as documents, videos, audios and images etc.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Lémdani, R. (2016) Système Hybride d’Adaptation dans les Systèmes de Recommandation. Thèse de Doctorat de l’Université Paris-Saclay préparée à Centrale Supelec, 23-33. https://www.theses.fr/2016SACLC050.pdf</mixed-citation>
          <element-citation publication-type="web">
            <year>2016</year>
            <article-title>Système Hybride d’Adaptation dans les Systèmes de Recommandation</article-title>
            <source>Thèse de Doctorat de l’Université Paris-Saclay préparée à Centrale Supelec</source>
            <volume>23</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Kaboré, K.K., Sèdes, F., Sié, O. and Peninou, A. (2015) Implementing the Information Access Assistant Service for an Evaluation. <italic>International</italic><italic>Journal</italic><italic>of</italic><italic>Internet</italic><italic>Technology</italic><italic>and</italic><italic>Secured</italic><italic>Transactions</italic>, 6, Article No. 25. https://doi.org/10.1504/ijitst.2015.073919 <pub-id pub-id-type="doi">10.1504/ijitst.2015.073919</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1504/ijitst.2015.073919">https://doi.org/10.1504/ijitst.2015.073919</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Peninou, A.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Implementing the Information Access Assistant Service for an Evaluation</article-title>
            <source>International Journal of Internet Technology and Secured Transactions</source>
            <volume>6</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1504/ijitst.2015.073919</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Kabore, K.K., Sie, O., Sedes, F. and Peninou, A. (2013) Information Access Assistant Service (IAAS). 8 <italic>th</italic><italic>International</italic><italic>Conference</italic><italic>for</italic><italic>Internet</italic><italic>Technology</italic><italic>and</italic><italic>Secured</italic><italic>Transactions</italic> ( <italic>ICITST</italic>-2013), London, 9-12 December 2013, 554-557. https://doi.org/10.1109/icitst.2013.6750263 <pub-id pub-id-type="doi">10.1109/icitst.2013.6750263</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/icitst.2013.6750263">https://doi.org/10.1109/icitst.2013.6750263</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Kabore, K.K.</string-name>
              <string-name>Sie, O.</string-name>
              <string-name>Sedes, F.</string-name>
              <string-name>Peninou, A.</string-name>
            </person-group>
            <year>2013</year>
            <article-title>Information Access Assistant Service (IAAS)</article-title>
            <source>8th International Conference for Internet Technology and Secured Transactions (ICITST-2013)</source>
            <volume>9</volume>
            <pub-id pub-id-type="doi">10.1109/icitst.2013.6750263</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Kaboré, K.K. (2018) Système d’aide pour l’accès non supervisé aux unités documentaire. Thèse de doctorat du l’Université de Ouaga 1 Pr Joseph KI-ZERBO, Janvier.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>KI-ZERBO, J</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Système d’aide pour l’accès non supervisé aux unités documentaire</article-title>
            <source>Thèse de doctorat du l’Université de Ouaga 1 Pr Joseph KI-ZERBO</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Kyelem, Y., Kabore, K.K. and Bassole, D. (2021) Hybrid Approach to Cross-Platform Mobile Interface Development for IAAS. In: Shakya, S., Bestak, R., Palanisamy, R. and Kamel, K.A., Eds., <italic>Mobile Computing and Sustainable Informatics</italic>, Springer, 225-238. https://doi.org/10.1007/978-981-16-1866-6_16 <pub-id pub-id-type="doi">10.1007/978-981-16-1866-6_16</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-981-16-1866-6_16">https://doi.org/10.1007/978-981-16-1866-6_16</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Kyelem, Y.</string-name>
              <string-name>Kabore, K.K.</string-name>
              <string-name>Bassole, D.</string-name>
              <string-name>Shakya, S.</string-name>
              <string-name>Bestak, R.</string-name>
              <string-name>Palanisamy, R.</string-name>
              <string-name>Kamel, K.A.</string-name>
              <string-name>Informatics, S</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Hybrid Approach to Cross-Platform Mobile Interface Development for IAAS</article-title>
            <source>In: Shakya</source>
            <volume>225</volume>
            <pub-id pub-id-type="doi">10.1007/978-981-16-1866-6_16</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Symeonidis, P., Nanopoulos, A. and Manolopoulos, Y. (2008) Providing Justifications in Recommender Systems. <italic>IEEE</italic><italic>Transactions</italic><italic>on</italic><italic>Systems</italic>, <italic>Man</italic>, <italic>and</italic><italic>Cybernetics</italic>— <italic>Part</italic><italic>A</italic>: <italic>Systems</italic><italic>and</italic><italic>Humans</italic>, 38, 1262-1272. https://doi.org/10.1109/tsmca.2008.2003969 <pub-id pub-id-type="doi">10.1109/tsmca.2008.2003969</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tsmca.2008.2003969">https://doi.org/10.1109/tsmca.2008.2003969</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Symeonidis, P.</string-name>
              <string-name>Nanopoulos, A.</string-name>
              <string-name>Manolopoulos, Y.</string-name>
              <string-name>Systems, M</string-name>
            </person-group>
            <year>2008</year>
            <article-title>Providing Justifications in Recommender Systems</article-title>
            <source>IEEE Transactions on Systems</source>
            <volume>38</volume>
            <pub-id pub-id-type="doi">10.1109/tsmca.2008.2003969</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Mustafa, B. and Raymond, J.M. (2005) Explaining Recommendations: Satisfaction vs. Promotion. <italic>Beyond</italic><italic>Personalization</italic><italic>Workshop</italic>, <italic>IUI</italic>, 5, 1, 7.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Mustafa, B.</string-name>
              <string-name>Raymond, J.M.</string-name>
              <string-name>Workshop, I</string-name>
            </person-group>
            <year>2005</year>
            <article-title>Explaining Recommendations: Satisfaction vs</article-title>
            <source>Promotion. Beyond Personalization Workshop</source>
            <volume>5</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Cataldo, M., Alain, D.S., Christoph, T., Amon, R. and Giovanni, S. (2021) Exploring the Effects of Natural Language Justifications in Food Recommender Systems. <italic>Proceedings</italic><italic>of</italic><italic>the</italic> 29 <italic>th</italic><italic>ACM</italic><italic>Conference</italic><italic>on</italic><italic>User</italic><italic>Modeling</italic>, <italic>Adaptation</italic><italic>and</italic><italic>Personalization</italic> ( <italic>UMAP</italic> ‘21), Utrecht, 21-25 June 2021, 147-157. https://doi.org/10.1145/3450613.3456827 <pub-id pub-id-type="doi">10.1145/3450613.3456827</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3450613.3456827">https://doi.org/10.1145/3450613.3456827</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Cataldo, M.</string-name>
              <string-name>Alain, D.S.</string-name>
              <string-name>Christoph, T.</string-name>
              <string-name>Amon, R.</string-name>
              <string-name>Giovanni, S.</string-name>
              <string-name>Modeling, A</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Exploring the Effects of Natural Language Justifications in Food Recommender Systems</article-title>
            <source>Proceedings of the 29th ACM Conference on User Modeling</source>
            <volume>21</volume>
            <pub-id pub-id-type="doi">10.1145/3450613.3456827</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Cataldo, M., Gaetano, R., Marco de, G., Pasquale, L. and Giovanni, S. (2019) Natural Language Justifications for Recommender Systems Exploiting Text Summarization and Sentiment Analysis. <italic>CEUR</italic><italic>Workshop</italic><italic>Proceedings</italic>, 2495, 63-73. http://ceur-ws.org/Vol-2495/paper8.pdf</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Cataldo, M.</string-name>
              <string-name>Gaetano, R.</string-name>
              <string-name>Pasquale, L.</string-name>
              <string-name>Giovanni, S.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Natural Language Justifications for Recommender Systems Exploiting Text Summarization and Sentiment Analysis</article-title>
            <source>CEUR Workshop Proceedings</source>
            <volume>2495</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Murali, T. and Kasif, S. (2003) Extracting Conserved Gene Expression Motifs from Gene Expression Data. <italic>Pacific Symposium on Biocomputing</italic><italic>Conf</italic><italic>erence</italic>, 8, 77-88.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Murali, T.</string-name>
              <string-name>Kasif, S.</string-name>
            </person-group>
            <year>2003</year>
            <article-title>Extracting Conserved Gene Expression Motifs from Gene Expression Data</article-title>
            <source>Pacific Symposium on Biocomputing Conference</source>
            <volume>8</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Or, B. and Courtenay, C. (2017) Explanation and Justification in Machine Learning: A Survey. <italic>IJCAI</italic>-17 <italic>Workshop</italic><italic>on</italic><italic>Explainable</italic><italic>AI</italic> ( <italic>XAI</italic>), 8, 1-13.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Or, B.</string-name>
              <string-name>Courtenay, C.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Explanation and Justification in Machine Learning: A Survey</article-title>
            <source>IJCAI-17 Workshop on Explainable AI (XAI)</source>
            <volume>8</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Radev, D.R., Jing, H., Styś, M. and Tam, D. (2004) Centroid-Based Summarization of Multiple Documents. <italic>Information</italic><italic>Processing</italic><italic>&amp;</italic><italic>Management</italic>, 40, 919-938. https://doi.org/10.1016/j.ipm.2003.10.006 <pub-id pub-id-type="doi">10.1016/j.ipm.2003.10.006</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ipm.2003.10.006">https://doi.org/10.1016/j.ipm.2003.10.006</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Radev, D.R.</string-name>
              <string-name>Jing, H.</string-name>
              <string-name>Tam, D.</string-name>
            </person-group>
            <year>2004</year>
            <article-title>Centroid-Based Summarization of Multiple Documents</article-title>
            <source>Information Processing &amp; Management</source>
            <volume>40</volume>
            <pub-id pub-id-type="doi">10.1016/j.ipm.2003.10.006</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S. and Dean, J. (2013) Distributed Representations of Words and Phrases and Their Compositionality. <italic>NIPS</italic> 2013, Lake Tahoe, 5-8 December 2013, 3111-3119.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mikolov, T.</string-name>
              <string-name>Sutskever, I.</string-name>
              <string-name>Chen, K.</string-name>
              <string-name>Corrado, G.S.</string-name>
              <string-name>Dean, J.</string-name>
            </person-group>
            <year>2013</year>
            <article-title>Distributed Representations of Words and Phrases and Their Compositionality</article-title>
            <source>NIPS 2013</source>
            <volume>5</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Ni, J., Li, J. and McAuley, J. (2019) Justifying Recommendations Using Distantly-Labeled Reviews and Fine-Grained Aspects. <italic>Proceedings</italic><italic>of</italic><italic>the</italic> 2019 <italic>Conference</italic><italic>on</italic><italic>Empirical</italic><italic>Methods</italic><italic>in</italic><italic>Natural</italic><italic>Language</italic><italic>Processing</italic><italic>and</italic><italic>the</italic> 9 <italic>th</italic><italic>International</italic><italic>Joint</italic><italic>Conference</italic><italic>on</italic><italic>Natural</italic><italic>Language</italic><italic>Processing</italic> ( <italic>EMNLP</italic>- <italic>IJCNLP</italic>), November 2019, 188-197. https://doi.org/10.18653/v1/d19-1018 <pub-id pub-id-type="doi">10.18653/v1/d19-1018</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.18653/v1/d19-1018">https://doi.org/10.18653/v1/d19-1018</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Ni, J.</string-name>
              <string-name>Li, J.</string-name>
              <string-name>McAuley, J.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Justifying Recommendations Using Distantly-Labeled Reviews and Fine-Grained Aspects</article-title>
            <source>Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
            <volume>188</volume>
            <pub-id pub-id-type="doi">10.18653/v1/d19-1018</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Mann, W.C. and Thompson, S.A. (1988) Rhetorical Structure Theory: Toward a Functional Theory of Text Organization. <italic>Text</italic>— <italic>Interdisciplinary Journal for the Study</italic><italic>of</italic><italic>Discourse</italic>, 8, 243-281. https://doi.org/10.1515/text.1.1988.8.3.243 <pub-id pub-id-type="doi">10.1515/text.1.1988.8.3.243</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1515/text.1.1988.8.3.243">https://doi.org/10.1515/text.1.1988.8.3.243</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Mann, W.C.</string-name>
              <string-name>Thompson, S.A.</string-name>
            </person-group>
            <year>1988</year>
            <article-title>Rhetorical Structure Theory: Toward a Functional Theory of Text Organization</article-title>
            <source>Text—Interdisciplinary Journal for the Study of Discourse</source>
            <volume>8</volume>
            <pub-id pub-id-type="doi">10.1515/text.1.1988.8.3.243</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Jacob, D., Ming-Wei, C., Kenton, L. and Kristina, T. (2019) Bert: Pre-Training of Deep Bidirectional Transformers for Language Understanding. <italic>Proceedings of the</italic><italic>Conference</italic><italic>of</italic><italic>the</italic><italic>North</italic><italic>American</italic><italic>Chapter</italic><italic>of</italic><italic>the</italic><italic>Association</italic><italic>for</italic><italic>Computational</italic><italic>Linguistics</italic> ( <italic>NAACL</italic>), Minnesota, June 2019, 2324-2335.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Jacob, D.</string-name>
              <string-name>Ming-Wei, C.</string-name>
              <string-name>Kenton, L.</string-name>
              <string-name>Kristina, T.</string-name>
              <string-name>Minnesota, J</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Bert: Pre-Training of Deep Bidirectional Transformers for Language Understanding</article-title>
            <source>Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics (NAACL)</source>
            <volume>2324</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Zhang, Y., Lai, G., Zhang, M., Zhang, Y., Liu, Y. and Ma, S. (2014) Explicit Factor Models for Explainable Recommendation Based on Phrase-Level Sentiment Analysis. <italic>Proceedings</italic><italic>of</italic><italic>the</italic> 37 <italic>th</italic><italic>International</italic><italic>ACM</italic><italic>SIGIR</italic><italic>Conference</italic><italic>on</italic><italic>Research</italic><italic>&amp;</italic><italic>Development</italic><italic>in</italic><italic>Information R</italic><italic>etrieval</italic>, Gold Coast, 6-11 July 2014, 83-92. https://doi.org/10.1145/2600428.2609579 <pub-id pub-id-type="doi">10.1145/2600428.2609579</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/2600428.2609579">https://doi.org/10.1145/2600428.2609579</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Zhang, Y.</string-name>
              <string-name>Lai, G.</string-name>
              <string-name>Zhang, M.</string-name>
              <string-name>Zhang, Y.</string-name>
              <string-name>Liu, Y.</string-name>
              <string-name>Ma, S.</string-name>
              <string-name>Retrieval, G</string-name>
            </person-group>
            <year>2014</year>
            <article-title>Explicit Factor Models for Explainable Recommendation Based on Phrase-Level Sentiment Analysis</article-title>
            <source>Proceedings of the 37th International ACM SIGIR Conference on Research &amp; Development in Information Retrieval</source>
            <volume>6</volume>
            <pub-id pub-id-type="doi">10.1145/2600428.2609579</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Arpit, R. and Derek, B. (2017) Explanation Chains: Recommendation by Explanation. <italic>RecSys</italic> ‘17 <italic>Poster</italic><italic>Proceedings</italic>, Como, 27-31 August 2017, 1-2.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Arpit, R.</string-name>
              <string-name>Derek, B.</string-name>
              <string-name>Proceedings, C</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Explanation Chains: Recommendation by Explanation</article-title>
            <source>RecSys ‘17 Poster Proceedings</source>
            <volume>27</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Or, B. and Kathleen, M. (2015) Generating Justifications of Machine Learning Predictions. 1 <italic>st International Workshop on Data</italic>- <italic>to</italic>- <italic>T</italic><italic>ext</italic>, United Kingdom, March 2015. http://www.cs.columbia.edu/~orb/papers/d2t_2015.pdf</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Or, B.</string-name>
              <string-name>Kathleen, M.</string-name>
              <string-name>Data-to-Text, U</string-name>
              <string-name>Kingdom, M</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Generating Justifications of Machine Learning Predictions</article-title>
            <source>1st International Workshop on Data-to-Text</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Park, N., Kan, A., Faloutsos, C. and Dong, X.L. (2020) J-Recs: Principled and Scalable Recommendation Justification. 2020 <italic>IEEE</italic><italic>International</italic><italic>Conference</italic><italic>on</italic><italic>Data</italic><italic>Mining</italic> ( <italic>ICDM</italic>), Sorrento, 17-20 November 2020, 1208-1213. https://doi.org/10.1109/icdm50108.2020.00151 <pub-id pub-id-type="doi">10.1109/icdm50108.2020.00151</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/icdm50108.2020.00151">https://doi.org/10.1109/icdm50108.2020.00151</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Park, N.</string-name>
              <string-name>Kan, A.</string-name>
              <string-name>Faloutsos, C.</string-name>
              <string-name>Dong, X.L.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>J-Recs: Principled and Scalable Recommendation Justification</article-title>
            <source>2020 IEEE International Conference on Data Mining (ICDM)</source>
            <volume>17</volume>
            <pub-id pub-id-type="doi">10.1109/icdm50108.2020.00151</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mauro, N., Hu, Z.F. and Ardissono, L. (2021) Service-Oriented Justification of Recommender System Suggestions. In: Ardito, C., <italic>et al</italic>., Eds., <italic>Human</italic>- <italic>Computer Interaction</italic>— <italic>INTERACT</italic> 2021, Springer International Publishing, 321-330. https://doi.org/10.1007/978-3-030-85613-7_23 <pub-id pub-id-type="doi">10.1007/978-3-030-85613-7_23</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-030-85613-7_23">https://doi.org/10.1007/978-3-030-85613-7_23</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mauro, N.</string-name>
              <string-name>Hu, Z.F.</string-name>
              <string-name>Ardissono, L.</string-name>
              <string-name>Ardito, C.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Service-Oriented Justification of Recommender System Suggestions</article-title>
            <source>In: Ardito</source>
            <volume>321</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-030-85613-7_23</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Symeonidis, P., Nanopoulos, A. and Manolopoulos, Y. (2009) MoviExplain: A Recommender System with Explanations. <italic>Proceedings</italic><italic>of</italic><italic>the</italic> 3 <italic>rd</italic><italic>ACM</italic><italic>Conference</italic><italic>on</italic><italic>Recommender</italic><italic>Systems</italic>, New York, 23-25 October 2009, 317-320. https://doi.org/10.1145/1639714.1639777 <pub-id pub-id-type="doi">10.1145/1639714.1639777</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/1639714.1639777">https://doi.org/10.1145/1639714.1639777</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Symeonidis, P.</string-name>
              <string-name>Nanopoulos, A.</string-name>
              <string-name>Manolopoulos, Y.</string-name>
              <string-name>Systems, N</string-name>
            </person-group>
            <year>2009</year>
            <article-title>MoviExplain: A Recommender System with Explanations</article-title>
            <source>Proceedings of the 3rd ACM Conference on Recommender Systems</source>
            <volume>23</volume>
            <pub-id pub-id-type="doi">10.1145/1639714.1639777</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Cheng, W.K., Ileladewa, A.A. and Tan, T.B. (2019) A Personalized Recommendation Framework for Social Internet of Things (SIoT). 2019 <italic>International</italic><italic>Conference</italic><italic>on</italic><italic>Green</italic><italic>and</italic><italic>Human</italic><italic>Information</italic><italic>Technology</italic> ( <italic>ICGHIT</italic>), Kuala Lumpur, 15-17 January 2019, 24-29. https://doi.org/10.1109/icghit.2019.00013 <pub-id pub-id-type="doi">10.1109/icghit.2019.00013</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/icghit.2019.00013">https://doi.org/10.1109/icghit.2019.00013</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Cheng, W.K.</string-name>
              <string-name>Ileladewa, A.A.</string-name>
              <string-name>Tan, T.B.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>A Personalized Recommendation Framework for Social Internet of Things (SIoT)</article-title>
            <source>2019 International Conference on Green and Human Information Technology (ICGHIT)</source>
            <volume>15</volume>
            <pub-id pub-id-type="doi">10.1109/icghit.2019.00013</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="thesis">Maâloul, M.H. (2012) Approche hybride pour le résumé automatique de textes. Application à la langue arabe. PhD Thesis, Université de Provence—Aix-Marseille I, 17-43. https://tel.archives-ouvertes.fr/tel-00756111/file/These.pdf</mixed-citation>
          <element-citation publication-type="thesis">
            <person-group person-group-type="author">
              <string-name>Thesis, U</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Approche hybride pour le résumé automatique de textes</article-title>
            <source>Application à la langue arabe. PhD Thesis</source>
            <volume>17</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>