<!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>Explain Your Clusters with Words. The Role of Metadata in Interactive Clustering</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Maciej Mozolewski</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Samaneh Jamshidi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Szymon Bobek</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Grzegorz J. Nalepa</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Center for Applied Intelligent Systems Research (CAISR), Halmstad University</institution>
          ,
          <addr-line>Halmstad</addr-line>
          ,
          <country country="SE">Sweden</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Edrone Ltd.</institution>
          ,
          <addr-line>1 Lekarska St., 31-203 Kraków</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Jagiellonian Human-Centered Artificial Intelligence Laboratory (JAHCAI) and Institute of Applied Computer Science, Jagiellonian University</institution>
          ,
          <addr-line>31-007 Kraków</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <fpage>53</fpage>
      <lpage>59</lpage>
      <abstract>
        <p>In this preliminary work, we present an approach for the augmentation of clustering with natural language explanations. In clustering there are 2 main challenges: a) choice of a proper, reasonable number of clusters, and b) cluster analysis and profiling. There is a plethora of technics for a) but not so much for b), which is in general a laborious task of explaining obtained clusters. We propose a method that aids experts in cluster analysis by providing an iterative, human-in-the-loop methodology of generating cluster explanations. In an illustrative example, we show how the process of clustering on a set of objective variables could be facilitated with textual metadata. In our case, images of products from online fashion store are used for clustering. Then, product descriptions are used for profiling clusters.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        or entities difer from each other and that they
could be divided into distinct classes. Clarification
Data analysts and data scientists are often faced of the diferences between groups gets better and
with the task of describing phenomena in a way better along with the knowledge gained about the
that is understandable to the audience. On the one instances that form diferent groups. Finally, one
hand, they have some data that they can describe is giving names to those categories of entities. In
statistically, categorize, or predict events based on essence, clustering in machine learning is no diferent
it, etc. On the other hand, they want to deliver process.
their observations in some kind of narrative that Clustering is an intrinsically subjective task and
they can "sell" to decision-makers. There is even a requires human assessment [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. It is a purely
staphenomenon called data storytelling. As the authors tistical method which finds homogeneous groups of
of "Data storytelling is not storytelling with data: A entities. It belongs to the family of unsupervised
framework for storytelling in science communication learning algorithms in contrast to classification or
and data journalism" [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] state, this is a type of regression, which are supervised. At every step
narrative in which science provides explanations of this process, the user makes decisions based on
about cause-and-efect relationships. Science lends her/his domain knowledge. First, the user needs
itself well to storytelling because new discoveries to select features (variables) used by the algorithm.
can be surprising, and therefore interesting, to the Secondly, the user selects the type of algorithm,
simpublic. In our work we want to show that this ilarity measures, number of clusters or size of the
intuitive approach is reflected in the work of data smallest one. Finally, she or he checks clusters by
scientists, which manifests itself in the way they use describing objects belonging to subsequent groups.
diferent types of data. It also follows that the process is iterative.
      </p>
      <p>
        Assigning labels to groups of similar objects is From our expertise in e-commerce and Industry
one of the ways how humans describe the world [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. 4.0, we often see distinctions between two types
It begins with the notion that some phenomena of data. There are objective data and the
subjective data or metadata. For instance, in e-commerce
IJCAI 2022: Workshop on semantic techniques for popular approach for recommendations is based on
narrative-based understanding, July 24, 2022, Vienna, Aus- finding users similar to each other in terms of
intria teractions with products. Thus, objective data is
s$amma.nmeohz.joalmewshski di@i@dhohct.soera(lS. u.jJ.eadmus.hpild(iM); . Mozolewski); composed of the behaviors of shoppers. The
cateszymon.bobek@uj.edu.pl (S. Bobek); gories, titles and descriptions of the products form
grzegorz.j.nalepa@uj.edu.pl (G. J. Nalepa) metadata, which is usually the result of the joint
© 2022 Copyright for this paper by its authors. Use permitted under work of many employees of the e-store. For rolling
Creative Commons License Attribution 4.0 International (CC BY
CPWrEooUrckReshdoinpgs IhStpN:/c1e6u1r3-w-0s.o7r3g 4C.0E).UR Workshop Proceedings (CEUR-WS.org) steel factories, predictive maintenance models are
derived mainly from objective sensory data, such as feedback to the result of clustering. The parameters
temperature, force, etc. Factory accounting data adjusted most frequently are the number of clusters
are metadata. Objective data can be viewed as story and the similarity threshold [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. For topic
modelor the totality of facts that occurred. They can be ing, users are given the option to select keywords
dificult for humans to understand but lend them- and set their relative importance [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. On the other
selves well to clustering. Metadata, in contrast, is hand, direct feedback might be realized by
highlightmore a type of narrative, or how the algorithm’s ing incorrect instances of splitting or merging the
outcome is presented by data scientists to their resulting clusters [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. For textual data, users can
audience. Metadata is more subjective, making it provide the tool with blacklists of incorrect topic
more suitable for justification and formulation of labels or set similar restrictions [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Based on this
conclusions and explanations. signal, the clustering tool learns user preferences
      </p>
      <p>The more objective the data is, the more it is and tries to incorporate the knowledge in the next
suited for modeling the phenomena, be it physi- iteration.
cal, business, sociological or psychological in nature. Explainable AI approaches have become
particuMetadata is more suitable for explaining the model larly important, and although most work is generally
to the user, convincing her or him, and prompt- focused on supervised learning, some works have
ing to make decisions and actions based on this been done to explain clusters. One of the most
comknowledge. It is more prone to error because of its mon methods for understanding clustering
methconventionality and subjectivity, but they speak to ods is visualization. By using low-dimensionality
humans. embedding and displaying them in two- or
three</p>
      <p>
        In this work we propose a method that allows for dimensional dimensions, one can get an overview of
clustering dataset with objective data, and explain the clusters and their data. However, these
visualdiferences between clusters with metadata. We use izations are not always understandable and
explainXAI methods to explain diferences between clusters able.
using metadata which is perfectly understandable The decision tree is one of the inherently
interby humans, but may not be of suficient quality pretable algorithms. So one common way to explain
to perform valid clustering. The selection of the models is to use decision trees. Nevertheless, the
most interpretable metadata is iterative and human- critical point for explaining the decision tree is its
guided. In our example, we show how image-based depth because decision trees with high depth no
clustering can be enhanced with textual description longer are interpreted, so we must pay attention
of clusters. We argue that such an approach can to the depth of the tree produced. Using a small
lead to better utilisation of metadata for cluster decision tree to divide a dataset into k clusters
proanalysis purposes, which results in better under- vides explainable clusters, but this approach has a
standing of clusters which is the final goal of every trade-of between being explainable and accuracy.
clustering task. Furthermore, it allows for check- IMM algorithm [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] approximates k-means and
king the consistency between two or more possible median clustering by a threshold tree with k leaves.
instance representations (image and text) which ExKMC [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] uses a threshold tree to provide an
might be crucial in domains that rely on both (e.g. explainable k-mean clustering in which the number
e-commerce). of tree leaves is greater than the number of clusters.
      </p>
      <p>
        The rest of the paper is organized as follows. In Besides, visualization or providing some
condiSection 2 we present current research in the area tions on features, using text data is reasonable to
of interactive clustering and human-guided cluster generate explanations to users. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] authors use
analysis. The description of our method along with captions of the images along with the images to
creuse-case studies is given in Section 3. Finally, we ate a more discriminative classification. In addition,
conclude our work and show perspectives of its they use this metadata to provide language
explanafurther development is presented in Section 4. tion and generate a text description for each class.
However, by blending textual and image
modalities into one datset, authors limit the possibility
2. Related works of checking consistency between these two types
of data and implicitly assume the correctness of
possibly wrong image descriptions.
      </p>
      <p>
        Similarly, in many other methods that aim at
explaining diferences between discovered clusters,
the clustering task is transformed to classification
In the survey on interactive clustering [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] authors
have distinguished 2 groups of approaches in terms
of how interaction occurs. In general, users can
interact indirectly with the tool, by changing the
parameters of the algorithm, or directly by giving
one, and the classifier is then explained with avail- tering pipeline. The fully-connected layer at the
able XAI methods such as LIME [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], Anchor [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], top of the network was disregarded because we
LUX [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], etc. One of the most recent implementa- were not interested in the classification done by the
tions of such approach can be found in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. model. The output of the final layer of the model
      </p>
      <p>
        Another approach is given in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], where authors was of length 20480. We used Singular Value
Depresent a toolkit for conformance checking between composition (SVD) with normalization to reduce
expert knowledge and automatic clustering. The the dimensionality of embeddings, leaving at least
diferences between expert-based clustering and au- 90 percent of the variance.
tomated clustering are justified with XAI methods In this section, we will present tools dedicated to
and the process is iterative. However, the explana- data scientists who would like to perform clustering.
tions are not human-guided, and the expert has no We propose a 2-step clustering loop, which consists
impact on the way they are generated. In particular, of k-means clustering and textual explanations of
it is not possible to provide additional metadata for clusters. Data preparation also could be performed
explanations, nor modify the set of concepts that more than once, if needed. For the sake of simplicity,
are used for explanations. we call it "step 0" in this work.
      </p>
      <p>In all the cases the process is not iterative, nor
human-guided. Finally, to the best of authors’ 3.1. Data preparation
knowledge, neither of the approaches known in the
literature divides data into objective part with a
good quality for cluster algorithms, but poor
explanation capabilities and metadata with possibly
worse potential as clustering features, but better
explanation capabilities and possible inconsistencies
with objective data that should be fixed. Addressing
these issues was the primary motivation of our work
that will be described in more detail in the following
sections.</p>
      <p>The method requires 2 types of data: objective and
metadata as defined in the previous section. In "step
0" method provides users with helper functions to
prepare both types of data. For objective data there
is a function that performs a reduction of
dimensionality via SVD followed by normalization. It works
on any numerical data, which could be as well as
one-hot variables and continuous real values (floats).</p>
      <p>User sets the percentage of explained variance left
after SVD reduction. The optimal count of new
dimensions could be determined automatically by
3. Cluster analysis with metadata our algorithm. This is done by probing diferent
dimension counts with scipy.optimize package, so
In this section, we will show how our method could the user does not need to do this manually.
Regardbe applied to real-case scenarios. We choose an ing metadata which is textual, there are wrappers
example from the e-commerce field because the built on top of the SpaCy3 and NLTK4 libraries.
authors have experience working in this industry. Users can contact text columns, lemmatize, remove
Specifically, we work with online stores to provide stopwords and perform TF-IDF vectorization. For
them, among others, with recommendations of prod- numerical metadata, we found a way to incorporate
ucts to their end-users (clients). them into textual explanations. For instance, the</p>
      <p>In real-life scenarios, data about products is year could be re-coded as the label "year2022", which
stored in product catalogs in shop databases, and will be easily interpreted along the pipeline. Other
most often exchanged with so-called product feeds numerical variables could be re-coded to
low/medi(XML documents). We used a public dataset from um/high bins, based on quartiles. Finally, the user
Kaggle1. This dataset in terms of content resem- constructs the "Pipeline" object and initializes it
bles a product feed for an online store of a medium with 2 datasets: objective and metadata.
size product catalog. It consists of 44000 products
with category labels, titles, and images. For the
code accompanying this example see the GitHub 3.2. Assistance in clustering
repository2. The first step corresponds to running the
unsuper</p>
      <p>
        As has been said before, we treat images as ob- vised clustering algorithm. Typically, the person
jective data. We used embeddings of images ob- performing the analysis starts with the dilemma of
tained via MobileNetV2 [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] as an input to clus- choosing the number of clusters. It can be resolved
1See: https://www.kaggle.com/datasets/paramaggarwal/
fashion-product-images-small
2See: https://github.com/mozo64/xai-survey/blob/main/ 3See: https://spacy.io/
src/example1-clustering-products-fashion.ipynb 4See: https://www.nltk.org/
with her/his background knowledge, intuition, prac- on a random subset, and results are cached for
furticality prerequisites, or just a trial and error ap- ther reference. For now, the user interprets the plot
proach. To give our users a hint in this regard, we on her/his own. Finally, clustering with k-means is
use the T-SNE [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] 2-dimensional projection of the performed on all observations. Visualization with
data. At the moment, this is a solely visual clue. T-SNE is presented, this time with clusters colored
It is depicted in Figure 1. If data have an underly- in diferent colors, which is depicted in Figure 3.
ing structure, points representing observations will
cluster, which would be observed on the chart. As
T-SNE on massive data could be resource intensive, 3.3. Interactive explanations
the default is to run this process on random
subsample and cache results. Additionally, users can
apply textual labels to the T-SNE chart, plotted on
a subsample of data, to avoid cluttering the chart.
      </p>
      <p>Labels could represent the most important pieces
of metadata, such as the label, the observation id, Figure 4: Example images of products that were assigned
and summary of description. The next clue is de- to the same cluster 13 based on the objective data.
rived from the silhouette score on a plot in Figure 2.</p>
      <p>The range of the number of clusters to be tested is
provided in accordance with the previous clue. To
speed-up computations, this plot could be obtained</p>
      <sec id="sec-1-1">
        <title>The second step is to explain the clusters so that the person performing the data analysis can assess</title>
        <p>
          metadata, here pruned to level 4.
the result. We would like to give users the freedom decides on its convergence.
to refine explanations. Thus, we provide her or
him with the possibility to influence explanations
by extending stopwords with his own terms. On 4. Summary
the other hand, we initialize the whitelist with
keywords like "year2022", defined in "step 0". Then In this work, we presented the method that allows
we use the TF-IDF vectorizer, taking into account for explaining clusters with concepts that could be
the aforementioned lists. Vectors are used to train more human-readable than the data which was used
decision tree classifiers. The size of the list of ad- as an input to clustering algorithm. We based our
ditional terms is under the control of a user. She method on the observation that diferent types of
or he can change it and interactively observe the data are suitable in diferent degrees to clustering
result in a Figure 6, which gives an insight into what and explaining tasks. We demonstrated the
feasiterms were relevant for classifier. Furthermore, for bility of our approach on the e-commerce example,
every cluster, example observations, word clouds where images were treated as input for clustering
and LIME explanation for description of random and textual descriptions of images as basis for
clusobservation are presented. For instance for the clus- ter descriptions.
ter 13 in Figure 4 one can see example products, In its current version, adaptability to the needs
word clouds that describe clusters in Figure 5 and of a human expert is provided by the possibility of
LIME [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] explanation for one instance of metadata cutomization of Metadata. Metadata-based
explain Figure 7. In this case one can see that the cluster nations can be refined in two ways. The user can
13 corresponds to product category "handbags". influence the number of tokens used in the
expla
        </p>
        <p>The last stage is a plot of the word cloud of each nation or can directly influence the list of tokens
cluster, using the same TF-IDF vectorizer. Plots by adding words to the whitelist or blacklist. After
are accompanied by examples of observations. In each such a change, the expert can see how it afects
addition, a user is presented an explanation gener- the classifier used as an explainer, both globally and
ated with LIME for a random instance from a given at the level of random observations for a cluster.
class. The whole process is iterative, and the expert One can modify the scope of the metadata and the
way individual observations are presented. If the
results, despite the changes, are not satisfactory,
it may imply the need to go back to choosing the
number of clusters.</p>
        <p>We treat metadata as something fixed and given.</p>
        <p>From our experience in e-commerce, we know that
product descriptions are the result of the work of
many e-store employees, but we do not want to
interfere with them. For example, a product
recommendation system in which the objective data
would be product images and the online shopping
behavior would be swithced on for a particular
ecommerce after the explanation is accepted by a
decision maker in the e-store. The explanations
could be refined by technical support of the
platform before being shown to the e-store employee.</p>
        <p>The tool is intended for use by a sole data
scientist. However, in other situations, collaborative
knowledge engineering approaches are also possible.</p>
        <p>
          Metadata could be created and enhanced in systems
such as LOKI5 [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ].
        </p>
        <p>In future work we would like to improve our
method with several extensions. We will focus on
automatically proposing number of clusters based
on both embedding features with methods similar to
T-SNE and metrics like silhouette score. We want
to test clustering techniques other than k-means.</p>
        <p>For instance, hierarchical clustering could be more
suitable in e-commerce, where taxonomies of
products are multilayer. Word clouds could be replaced
with topic analysis with Latent Dirichlet Allocation
or techniques derived from Natural Language
Generation. Another interesting direction is to construct
explanations with other modalities, like visual, by
something more sophisticated than presenting
example images. It could be done for instance with
image captioning.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Acknowledgments</title>
      <sec id="sec-2-1">
        <title>This paper is funded from the XPM (Explainable</title>
        <p>Predictive Maintenance) project funded by the
National Science Center, Poland under CHIST-ERA
programme Grant Agreement No. 857925 (NCN
UMO-2020/02/Y/ST6/00070).</p>
        <p>The work of Szymon Bobek has been additionally
supported by a HuLCKA grant from the Priority
Research Area (Digiworld) under the Strategic
Programme Excellence Initiative at the Jagiellonian
University (U1U/P06/NO/02.16).</p>
        <p>The work of Samaneh Jamshidi was supported
by CHIST-ERA grant CHIST-ERA-19-XAI-012
funded by Swedish Research Council.</p>
      </sec>
      <sec id="sec-2-2">
        <title>The work of Maciej Mozolewski has been addi</title>
        <p>tionally supported by Edrone Sp. z o.o.6, which
provided computer resources for machine learning.</p>
        <sec id="sec-2-2-1">
          <title>5See: https://loki.re/wiki/docs:start#loki</title>
        </sec>
        <sec id="sec-2-2-2">
          <title>6See: https://edrone.me/en/</title>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Matei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hunter</surname>
          </string-name>
          ,
          <article-title>Data storytelling is not storytelling with data: A framework for storytelling in science communication and data journalism</article-title>
          ,
          <source>The Information Society</source>
          <volume>37</volume>
          (
          <year>2021</year>
          )
          <fpage>312</fpage>
          -
          <lpage>322</lpage>
          . URL: https: //doi.org/10.1080/01972243.
          <year>2021</year>
          .
          <volume>1951415</volume>
          . doi:
          <volume>10</volume>
          .1080/01972243.
          <year>2021</year>
          .
          <volume>1951415</volume>
          . arXiv:https://doi.org/10.1080/01972243.
          <year>2021</year>
          .
          <volume>1951415</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.</given-names>
            <surname>Rosch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lloyd</surname>
          </string-name>
          , Cognition and Categorization, Lawrence Elbaum Associates,
          <year>1978</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bae</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Helldin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Riveiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Nowaczyk</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.-R. Bouguelia</surname>
          </string-name>
          , G. Falkman,
          <article-title>Interactive clustering: A comprehensive review</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>53</volume>
          (
          <year>2020</year>
          ). URL: https://doi.org/10. 1145/3340960. doi:
          <volume>10</volume>
          .1145/3340960.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Andrienko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Andrienko</surname>
          </string-name>
          ,
          <article-title>Visualization support to interactive cluster analysis</article-title>
          , in: A.
          <string-name>
            <surname>Bifet</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>May</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Zadrozny</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Gavalda</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Pedreschi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Bonchi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Cardoso</surname>
          </string-name>
          , M. Spiliopoulou (Eds.),
          <source>Machine Learning and Knowledge Discovery in Databases</source>
          , Springer International Publishing, Cham,
          <year>2015</year>
          , pp.
          <fpage>337</fpage>
          -
          <lpage>340</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>I.</given-names>
            <surname>Arin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Erpam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Saygin</surname>
          </string-name>
          ,
          <article-title>I-twec: Interactive clustering tool for twitter</article-title>
          ,
          <source>Expert Systems with Applications</source>
          <volume>96</volume>
          (
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.eswa.
          <year>2017</year>
          .
          <volume>11</volume>
          .055.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>El-Assady</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sevastjanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sperrle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Keim</surname>
          </string-name>
          , C. M. Collins,
          <article-title>Progressive learning of topic modeling parameters: A visual analytics framework</article-title>
          ,
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          <volume>24</volume>
          (
          <year>2018</year>
          )
          <fpage>382</fpage>
          -
          <lpage>391</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Bin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Interactive k -means clustering method based on user behavior for diferent analysis target in medicine</article-title>
          ,
          <source>Computational and Mathematical Methods in Medicine</source>
          <year>2017</year>
          (
          <year>2017</year>
          )
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . doi:
          <volume>10</volume>
          .1155/
          <year>2017</year>
          /4915828.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , E. Chi,
          <article-title>Appgrouper: Knowledge-based interactive clustering tool for app search results</article-title>
          ,
          <source>Proceedings of the 21st International Conference on Intelligent User Interfaces</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Dasgupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Frost</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Moshkovitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rashtchian</surname>
          </string-name>
          , Explainable  -means and  -medians clustering, arXiv preprint arXiv:
          <year>2002</year>
          .
          <volume>12538</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Frost</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Moshkovitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rashtchian</surname>
          </string-name>
          , Exkmc: Expanding explainable
          <article-title>-means clustering</article-title>
          , arXiv preprint arXiv:
          <year>2006</year>
          .
          <volume>02399</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Hendricks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Akata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rohrbach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Donahue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Schiele</surname>
          </string-name>
          , T. Darrell,
          <article-title>Generating visual explanations</article-title>
          ,
          <source>in: European conference on computer vision</source>
          , Springer,
          <year>2016</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Ribeiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Guestrin</surname>
          </string-name>
          , “
          <article-title>Why should i trust you?”: Explaining the predictions of any classifier</article-title>
          ,
          <source>in: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          , KDD '16,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2016</year>
          , p.
          <fpage>1135</fpage>
          -
          <lpage>1144</lpage>
          . URL: https://doi.org/10. 1145/2939672.2939778. doi:
          <volume>10</volume>
          .1145/2939672. 2939778.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Ribeiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Guestrin</surname>
          </string-name>
          ,
          <article-title>Anchors: High-precision model-agnostic explanations</article-title>
          ,
          <source>in: AAAI</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bobek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Nalepa</surname>
          </string-name>
          ,
          <article-title>Introducing uncertainty into explainable ai methods</article-title>
          , in: M.
          <string-name>
            <surname>Paszynski</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Kranzlmüller</surname>
            ,
            <given-names>V. V.</given-names>
          </string-name>
          <string-name>
            <surname>Krzhizhanovskaya</surname>
            ,
            <given-names>J. J.</given-names>
          </string-name>
          <string-name>
            <surname>Dongarra</surname>
          </string-name>
          ,
          <string-name>
            <surname>P. M.</surname>
          </string-name>
          <article-title>A</article-title>
          .
          <string-name>
            <surname>Sloot</surname>
          </string-name>
          (Eds.),
          <source>Computational Science - ICCS 2021</source>
          , Springer International Publishing, Cham,
          <year>2021</year>
          , pp.
          <fpage>444</fpage>
          -
          <lpage>457</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lötsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Malkusch</surname>
          </string-name>
          ,
          <article-title>Interpretation of cluster structures in pain-related phenotype data using explainable artificial intelligence (xai</article-title>
          ),
          <source>European Journal of Pain</source>
          <volume>25</volume>
          (
          <year>2021</year>
          )
          <fpage>442</fpage>
          -
          <lpage>465</lpage>
          . URL: https://onlinelibrary.wiley.com/doi/ abs/10.1002/ejp.1683. doi:https://doi.org/ 10.1002/ejp.1683.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bobek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Brzegowski</surname>
          </string-name>
          , E. Brzychczy,
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Nalepa</surname>
          </string-name>
          ,
          <article-title>Knac: an approach for enhancing cluster analysis with background knowledge and explanations</article-title>
          ,
          <source>CoRR abs/2112</source>
          .08759 (
          <year>2021</year>
          ). URL: https://arxiv. org/abs/2112.08759. arXiv:
          <volume>2112</volume>
          .
          <fpage>08759</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sandler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Howard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zhmoginov</surname>
          </string-name>
          , L.-C.
          <article-title>Chen, Mobilenetv2: Inverted residuals</article-title>
          and linear bottlenecks,
          <year>2019</year>
          . arXiv:
          <year>1801</year>
          .04381.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>G.</given-names>
            <surname>Hinton</surname>
          </string-name>
          , S. Roweis, Stochastic neighbor embedding,
          <source>Advances in neural information processing systems</source>
          <volume>15</volume>
          (
          <year>2003</year>
          )
          <fpage>833</fpage>
          -
          <lpage>840</lpage>
          . URL: http: //citeseerx.ist.psu.edu/viewdoc/download? doi
          <source>=10.1.1.13.7959&amp;rep=rep1&amp;type=pdf.</source>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>Kutt</surname>
          </string-name>
          ,
          <article-title>Semantic wikis versioning with bifröst, in: Doctoral Consortium of the 15th Edition of AI*IA</article-title>
          , volume
          <volume>1769</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>34</fpage>
          -
          <lpage>39</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>