<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Approaching Explainable Recommendations for Personalized Social Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Francesco Epifania</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer science, University of Milano Bicocca</institution>
          ,
          <addr-line>Milano</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Social Things srl</institution>
          ,
          <addr-line>Milano</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1957</year>
      </pub-date>
      <volume>1</volume>
      <abstract>
        <p>Learning and training processes are starting to be a ected by the di usion of Arti cial Intelligence (AI) techniques and methods. AI can be variously exploited for supporting education, though especially deep learning (DL) models are normally su ering from some degree of opacity and lack of interpretability. Explainable AI (XAI) is aimed at creating a set of new AI techniques able to improve their output or decisions with more transparency and interpretability. Deep attentional mechanisms proved to be particularly e ective for identifying relevant communities and relationships in any given input network that can be exploited with the aim of improving useful information to interpret the suggested decision process. In this paper we provide the rst stages of our ongoing research project, aimed at signi cantly empowering the recommender system of the educational platform "WhoTeach" by means of explainability, to help teachers or experts to create and manage highquality courses for personalized learning. The presented model is actually our rst tentative to start to include explainability in the system. As shown, the model has strong potentialities to provide relevant recommendations. Moreover, it allows the possibility to implement e ective techniques to completely reach explainability 3.</p>
      </abstract>
      <kwd-group>
        <kwd>Social Networks Graph Attention Networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Nowadays, learning and training processes are starting to be a ected by the
diffusion of AI techniques and methods [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, in order to e ectively and
signi cantly improve education, researchers, teachers or experts need to exploit
their full potential. In the educational eld it could be particularly signi cant
to understand the reasons behind models outcomes, especially when it comes to
suggestions to create, manage or evaluate courses or didactic resources. In order
to address this issue, explainable AI (XAI) could be crucial and determining in
education, as in many other elds [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], being aimed at creating a set of new AI
techniques able to make their own decisions more transparent and interpretable.
      </p>
      <p>
        In this context, explainable AI in the eld of Recommender Systems (XRS) is
aimed at providing intuitive explanations for the suggestions and
recommendations given by the algorithms [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Basically the community tries to address the
problem of why certain recommendations are suggested by the applied models.
At the same time, di erent attempts in current deep learning literature try to
extend deep techniques to deal with social data, recommendations and
explanations. The "attentional mechanism" was introduced for the rst time in the
deep learning community in order to allow the model to detect the most relevant
information due to the attention weights [22] and has recently been successful
for the resolution of a series of objectives [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>Speci cally, in literature explainable attentional models have been used in
domains ranging from medical care [24] [25] to e-commerce and online purchase
[26]. It is worth to notice that attention weights can have a role in starting to
fostering explainability [27].</p>
      <p>In this article, we provide the rst stages of our ongoing research project,
aimed at signi cantly empowering the RS of our educational platform "WhoTeach"
[29] by the means of explainability. Speci cally, we report our current
positioning in the state of the art with the proposed model to extend the social engine
of \WhoTeach" with a graph attentional mechanism aiming to provide social
recommendations for the design of new didactic programs and courses. The
presented model allows us to start to include explainability in the system.</p>
      <p>
        We have started to de ne our positioning in the state-of-the-art according
to three dimensions studied in the XAI literature [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] [16]: the model itself, the
display style of the explanations we aim to provide and the social aspects of our
potential XRS. The rst and the second dimension considered come from the
literature, while the third one is the result of the importance of the social feature
and data in WT.
      </p>
      <p>
        In particular:
{ Display style: in order to optimize the user experience we are working to
de ne the way explanations will be provided, as the di erent possibilities in
literature show [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] [28].
{ XRS model: as described, the present attentional model shows the
potentialities to actually include explainability in the RS. Thus, in the next stages
of the project we are going to both improve the present model and
empirically evaluate other possible models, so as to integrate them and e ectively
include explainability in the RS.
{ Social dimension: by the means of the social data in the platform from
users (e.g. teachers, students, experts) we are going to perform further
experimentation to assess the present situation and understand the way to
empirically evaluate other models.
      </p>
      <p>From the study of the state of the art, we then strive to inscribe our current
work and its future steps in the XRS literature, so as to de ne our present
positioning and prepare for future work and stages towards explainability.
2</p>
    </sec>
    <sec id="sec-2">
      <title>WhoTeach</title>
      <p>WhoTeach (WT) is a complete digital learning platform for supporting
heterogenous learning ecosystems in their processes and activities, due to its numerous
synchronous and asynchronous features and functionalities. WT is aimed at
promoting the development of customized learning and training paths by
aggregating and disseminating knowledge created and updated by experts. The platform
is conceived as a Social Intelligent Learning Management System (SILMS) and
it is structured around three components:
1. The Recommender System (RS), to help experts and teachers to quickly
and e ectively assemble high-quality contents into courses: thanks to an
intelligent analysis of available material, it is aimed at suggesting teachers
the best resources to include, in any format, according to teachers' needs or
requirements.
2. The "Knowledge co-creation Social Platform", which is a technological
infrastructure based on an integrated and highly interactive social network,
endowed with many features to share information, thematic groups and
discussion forums.
3. The content's repository where to upload contents from any course or
training material, either proprietary or open. This serves as a basis for both the
recommender system to elaborate materials and also users who want to
create personalized courses.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Main Concepts and De nitions</title>
      <p>A graph (annotated with G = (V; E)) is a theoretical object widely applied to
model the complex set of relationships that typically characterize current
networks. This object consists of a set of \entities " (vertices or nodes), V , and
relationships between them, i.e. edges, E. In this paper, we use attributed graphs,
i.e., particular graphs where each vertex v 2 V is labeled with a set of attribute
values. Moreover, given a vertex v 2 V , we indicate with N (v) = fu : fv; ug 2 Eg
the neighborhood of the vertex v.</p>
      <p>Given a graph G, we use the corresponding adjacency matrix A to indicate
whether two vertices vi; vj of G are connected by an edge, i.e., (A)i;j = 1, if
fvi; vj g 2 E.</p>
      <p>
        In order to summarize the relationships between vertices and capture relevant
information in a graph, embedding (i.e., objects transformation to lower
dimensional spaces) is typically applied [23]. This approach allows to use a rich set of
analytical methods, o ering to deep neural networks the capability of
providing di erent levels of representation. Embedding can be performed at di erent
level: for example, at the node level, at the graph level, or even through
different mathematical strategies. Typically, the embedding is realized by tting
the (deep) network's parameters using standard gradient-based optimization. In
particular, the following de nitions can be useful [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>De nition 1. Given a graph G = (V; E) with V as the set of vertices and E the
set of edges, the objective of node embedding is to learn a function f : V ! Rk
such that each vertex i 2 V is mapped to a k-dimensional vector, h.
De nition 2. Given a set of graphs, G, the objective of graph embedding is
to learn a function f : G ! Rk that maps an input graph G 2 G to a low
dimensional embedding vector, h.
4</p>
    </sec>
    <sec id="sec-4">
      <title>GAT models</title>
      <p>
        In our application, we use the attentional-based node embedding proposed in
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. For a general de nition of the notion of \attention", here we conveniently
adapt the one reported in [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>De nition 3. Let A be an user/item relationship matrix, G[A] = (V; E) the
corresponding weighted graph, and V = fU; Rg the set of users U and items
R, respectively. Given a pair of vertices (u; r); u 2 U; r 2 R, an attentional
emue;rch=anaismh(ulf)o; rh(rGl) isacarofsusncthtieonpaair:s RofnverRticnes!,uR;r,wbhaiscehd coonmtphuetiers
fceoaeturecierenptsresentation h(ul); h(rl) at level l.</p>
      <p>Coe cients eu;r are considered as the importance of the vertex r's features to
(user) u.</p>
      <p>
        Following [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], we de ne a as a feed-forward neural network with a learnable
(weight) vector of parameters a and nonlinear LeakyReLU activation function.
In this way, we have
e(ul;)r = LeakyReLU a(l)T hW(l)h(ul)jjW(l)h(rl)i :
(1)
where W is a learnable parameter matrix and W(l)h(ul)jjW(l)h(rl) is the
concatenation of the embedded representation for the vertices u; r.
      </p>
      <p>The coe cients eu;r can be normalized using, e.g., the softmax function
u(l;)r =</p>
      <p>exp(e(ul;)r)</p>
      <p>Pk2N (u) exp(e(ul;)k) :
The mechanisms parameters, a, are then updated with the others network's
parameters accordingly to typical optimization algorithms. When only resources
(items) around u are considered, the normalized (attention) coe cients u;r can
be used to compute a combination of the resources h(rl) in N (u) as follows
h(ul+1) =</p>
      <p>X
r2N (u);r2R
u(l;)rW(l)h(l)
r
where is non linear vector-valued function (sigmoid). With this formulation,
Eq. 2 provides the next level embedding for user u scaled by the attention scores
which, in turn, can be interpreted as the relevance of the resources used by the
user u. Similarly to Eq. 2, the following quantity can be interpreted as the user
scores who applied, in particular, the resource r.
(2)
(3)
h(l+1) =
r</p>
      <p>X
u2N (r);u2U
u(l;)rW(l)h(ul)
In this way, the \GAT layer" returns for each pair (u; r) 2 U R the embedded
representation (h(ul+1); h(rl+1)). In our experiments we will consider only one level
of embedding, i.e., l = 1.</p>
      <p>Therefore, as previously described in the section 3, we introduce a novel kind
of information representation h(ul) for users and h(rl) resources, allowing us to
visualize either the user u or the resource r as the main element according to
its neighborhood. Nevertheless, this representation is still not able to explain
and justify the recommendations given to a speci c user. Indeed, it provides
the starting point to apply the attention mechanism, which introduces the
possibility to give a weight e(ul;)r to the most relevant information encoded in the
embedded representation for both the user hu (l+1). Then,
(l+1) and the resource hr
the attention weights e(ul;)r permit to improve the model performances, reducing
the error for the recommendations.</p>
      <p>Above all, they foster the possibility to explain why a given resource r is
recommended to a speci c user u. In particular, this approach for computing the
attention weights e(ul;)r is also applied in other works related to collaborative
ltering RS [32]. Other works explore di erent display styles, as visual
explanations [31]. In conclusion, the ability to highlight the most useful information to
realize the recommendations allowed us to start to introduce explainability in
the system.</p>
    </sec>
    <sec id="sec-5">
      <title>Numerical experiments</title>
      <p>Here we report a short review of the numerical experiments described in [29].
The experiments use an homogeneous set of data whose characteristics combine
well with the requirements of the WhoTeach platform. These data come from
the \Goodbooks" data-set (https://www.kaggle.com/zygmunt/goodbooks-10k),
a large collection reporting up to 10K books and 1000000 ratings (from \1" to
\5") assigned by 53400 readers.</p>
      <p>The experiments aim to evaluate the capability of the attentional-based models
to reduce error (loss function) between the reported and predicted preference
scores.</p>
      <p>The models was implemented using the Pytorch library (https://pytorch.org/),
and then executed using di erent hyperparameters.At the present stage, the
attention-based model was compared with alternative models: dot product model,
element-wise product model (Hadamard product model), concatenation model.
Performances were averaged on the number of folds (10 cross-validation).</p>
      <p>A general better tendency to reduce the MSE loss is observed when attention
layer with concatenation is applied as a base module for the considered stacked
layer.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions and future work</title>
      <p>In this work we have reported our work in progress for providing \WhoTeach"
with an explainable recommender system, aimed to signi cantly empower its
ability to help teachers or experts to create high-quality courses. It is totally
clear that further improvements of the present XRS could signi cantly help
users to better understand the reason why speci c items are recommended.
At the present stage, we started to propose a model based on the attentional
mechanisms, which allows to justify the chosen recommendations provided by
the model by the means of the attention weights. This model is speci cally
focused on exploiting social information for educational services, thus extending
the social engine of our educational platform \WhoTeach" to reinforce the AI
engine. Finally, we have reported our present and further positioning in the state
of the art of XAI, showing the potentialities of the present model and the next
steps in our work. One of the most important further step will be the
optimization of the computational complexity for the computation of the attention
weights. Moreover, we will strive to improve the display style of the explanations
provided to users, in order to consequently improve the user experience.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Holmes</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wayne</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Author</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fadel</surname>
            ,
            <given-names>A. C.</given-names>
          </string-name>
          :
          <article-title>Arti cial intelligence in education</article-title>
          .
          <source>journal</source>
          , Boston: Center for Curriculum Redesign,
          <string-name>
            <surname>Location</surname>
          </string-name>
          (
          <year>2019</year>
          ). https://doi.org/10.1109/MIS.
          <year>2016</year>
          .93
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Timms</surname>
            ,
            <given-names>M. J. :</given-names>
          </string-name>
          <article-title>Letting arti cial intelligence in education out of the box: educational cobots and smart classrooms</article-title>
          .
          <source>In: International Journal of Arti cial Intelligence in Education</source>
          (
          <year>2016</year>
          ).https://doi.org/10.1007/s40593-016-0095-y
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Dondi</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mauri</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Zoppis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Clique editing to support case versus control discrimination</article-title>
          .
          <source>In : Intelligent Decision Technologie</source>
          (
          <year>2016</year>
          ). https://doi.org/10.1016/j.tcs.
          <year>2019</year>
          .
          <volume>09</volume>
          .022
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Zoppis</surname>
            ,
            <given-names>I. Dondi</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Coppetti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Beltramo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Mauri</surname>
          </string-name>
          , G. :
          <article-title>Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis</article-title>
          .
          <source>In : 2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)</source>
          (
          <year>2018</year>
          ). https://doi.org/10.1109/PDP44162.2018
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Zoppis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manzoni</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mauri</surname>
          </string-name>
          , G. :
          <article-title>A Computational Model for Promoting Targeted Communication and Supplying Social Explainable Recommendations</article-title>
          .
          <source>In : 2019 IEEE 32nd International Symposium on Computer-Based Medical Systems (CBMS)</source>
          <year>2019</year>
          . https://doi.org/10.1109/CBMS.
          <year>2019</year>
          .00090
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Fox</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Long</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Magazzeni</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : Explainable Planning (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Bonhard</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sasse</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          :
          <article-title>Knowing me, knowing you'|Using pro les and social networking to improve recommender systems</article-title>
          .
          <source>In : BT Technology Journal</source>
          (
          <year>2006</year>
          ). https://doi.org/10.1007/s10550-006-0080-3
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goel</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharma</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>R. :</given-names>
          </string-name>
          <article-title>The who to follow service at twitter</article-title>
          .
          <source>In: Proceedings of the 22nd international conference on World Wide Web</source>
          (
          <year>2013</year>
          ). https://doi.org/10.1145/2488388.2488433
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Josang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cox</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>The state-of-the-art in personalized recommender systems for social networking</article-title>
          .
          <source>In : Arti cial Intelligence Review</source>
          (
          <year>2012</year>
          ). https://doi.org/10.1007/s10462-011-9222-1
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Yongfeng</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , :
          <article-title>Explainable Recommendation: A Survey and New Perspectives (</article-title>
          <year>2018</year>
          ). https://doi.org/10.1561/1500000066
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boaz</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ryan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ahmed</surname>
            , N.,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koh</surname>
          </string-name>
          , E. :
          <article-title>Attention models in graphs: A survey</article-title>
          . In : arXiv preprint arXiv:
          <year>1807</year>
          .
          <volume>07984</volume>
          (
          <year>2018</year>
          ). https://doi.org/10.1145/3363574
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Velickovic</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cucurull</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Casanova</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romero</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lio</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Graph attention networks</article-title>
          .
          <source>In : arXiv preprint arXiv:1710.10903</source>
          (
          <year>2017</year>
          ). https://doi.org/10.17863/CAM.48429
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Sharma</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cosley</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Do Social Explanations Work?: Studying and Modeling the E ects of Social Explanations in Recommender Systems</article-title>
          .
          <source>In : Proceedings of the 22Nd International Conference on World Wide Web</source>
          (
          <year>2013</year>
          ). https://doi.org/10.1145/2488388.2488487
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Pedreschi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giannotti</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guidotti</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Monreale</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruggieri</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turini</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Meaningful explanations of Black Box AI decision systems</article-title>
          .
          <source>In: Proceedings of the AAAI Conference on Arti cial Intelligence</source>
          (
          <year>2019</year>
          ). https://doi.org/10.1609/aaai.v33i01.
          <fpage>33018001</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Adadi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berrada</surname>
            ,
            <given-names>M. :</given-names>
          </string-name>
          <article-title>Peeking Inside the Black-Box: A Survey on Explainable Arti cial Intelligence (XAI)</article-title>
          .
          <source>In: IEEE Access</source>
          (
          <year>2018</year>
          ). https://doi.org/10.1109/ACCESS.
          <year>2018</year>
          .2870052
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>