<!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>Collaborative-AI Knowledge Graph Generation: Taxonomization of IATE, the EU Terminology</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Michael Wetzel</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stelios Mathioulakis</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jochen Hummel</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alena V</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Coreon GmbH</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Berlin</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ESTeam AB</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gothenburg</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Formalized knowledge is a powerful resource for AI projects, but it is usually created at great expense. Taxonomization is linking a at set of concepts into a hierarchical knowledge graph, and in this work, we present our approach to semi-automatic generation of such concept maps, elevating a sub-domain of IATE terminology into a multilingual knowledge graph. We taxonomized a at list of concepts within the COVID sub-domain, benchmarking two approaches to tackle this task: automatic concept map creation using an enhanced ML-powered language model and manual creation of the graph by a linguist expert. We dwell on advantages of the collaborative method, made easy by a user-friendly UI, and show how the achieved productivity rate can make taxonomization of large terminology databases viable.</p>
      </abstract>
      <kwd-group>
        <kwd>Collaborative taxonomization</kwd>
        <kwd>Knowledge Graph UI</kwd>
        <kwd>KG Construction Methods</kwd>
        <kwd>Machine Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In the realm of data-driven businesses, structured data is a valuable resource.
IATE (Interactive Terminology for Europe)1, with almost one million concepts
storing multilingual terms and metadata, holds a large part of the textual
knowledge of the EU (European Union). However, while IATE database has domain
crosslinks with the EuroVoc thesaurus2, its concepts are not linked within: they
stand alone and can only be accessed lexically.</p>
      <p>If IATE were taxonomized, i.e. related concepts linked up into knowledge
graphs yielding a full- edged taxonomy, its data would not only be consumed
? All authors contributed equally.</p>
      <p>Copyright © 2021 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
1 Available at https://iate.europa.eu/
2 http://europa.eu/eurovoc/
by linguists but also become machine-readable. This would convert IATE into a
powerful resource for AI projects, particularly within the segment of small and
medium-sized enterprises (SMEs) that rarely have the means to create
multilingual formalized knowledge { building and maintenance of big taxonomies require
not only vast nancial support but also supervision of domain-speci c experts.</p>
      <p>
        State-of-the-art techniques for automatic taxonomy generation utilize
information extraction and pattern-based methods [
        <xref ref-type="bibr" rid="ref5 ref8">5, 8</xref>
        ], combinations of tags and
Wikipedia Category Hierarchy [
        <xref ref-type="bibr" rid="ref2 ref7">2, 7</xref>
        ], already existing knowledge graph's triple
representations [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], and strict domain-speci c properties: having a list of terms
for taxonomization, they rely on a corpus containing these terms, assuming that
the corpus represents the domain adequately [
        <xref ref-type="bibr" rid="ref12 ref6">6, 12</xref>
        ]. To our knowledge, none of
the published studies solved the 'out-of-context' terms problem, which is exactly
our case since we were dealing with a list of concepts without any established
relations or domain corpora at hand.
      </p>
      <p>The objective of this study was therefore to investigate if, given a at list
of Coronavirus (COVID) sub-domain concepts without relations between them,
we could facilitate a speedy creation of a deeply-structured taxonomy, turning
the input concepts into a mono-hierarchical knowledge graph.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Methodology and Data</title>
      <p>
        To test our hypothesis, we chose two scenarios: manual and semi-automatic
taxonomization. In the rst scenario, the setup was the following: a linguist took a
at list of concepts and turned them into a structured taxonomy, establishing
broader-narrower relations between the concepts using Coreon UI3. In the
second scenario, an ML-powered algorithm drafted the taxonomy, which was later
curated by another linguist with the help of the same tool. In both cases, the
taxonomies feature not only initial input concepts but also the established relations
between them and higher-level parent nodes that bring a meaningful structure
into the taxonomy. When given the same set of concepts and asked to create a
taxonomy, people are likely to produce di erent results due to our natural
diversity of views on how concepts shall be categorized. We therefore did not aim for
an in-depth review of semantic coherence within the created concept clusters,
focusing rather on comparison of measurable parameters, such as working hours,
amount of "transactions" in the software, number of relations created. To make
the results comparable to some degree, we established that the resulting
taxonomies should share 5 identical top-level nodes (i.e. "entities", "instruments",
"medicine", "social aspects", and "miscellaneous") and that parent nodes may
not have more than 20-25 children. It should also be noted that both curators
are not domain-knowledge experts, yet they were well familiar with the used
software. Figure 1 illustrates the steps executed for both scenarios. Exported
424 IATE COVID concepts, used in both cases as initial input, were identical.
3 https://www.coreon.com/
Inspired by the work done on hierarchical clustering, collaborative tagging
systems, unsupervised taxonomy construction, and graph-based exploration of
semantic spaces [
        <xref ref-type="bibr" rid="ref13 ref15 ref4">4, 13, 15</xref>
        ], we have developed a novel ML approach for automatic
taxonomy induction, using context-free tokens, i.e. terms and synonyms
comprising each IATE COVID concept, as input data. First, input is vectorized,
so text tokens representing each concept are converted into dense vectors of
numbers. Since our dataset contains many rare disease-speci c tokens, we used
a pre-trained and publicly available FastText word embedding (WE) model to
convert terms into vectors [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Next, we calculate a pairwise cosine similarity
for all WE combinations, forming a symmetric matrix of similarities. To
create a graph, each node is represented by an input concept, and to form the
vertices/edges of the graph, a threshold is used, i.e. a median cosine similarity
of all the given similarities [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. If two concepts have a similarity higher than
the determined threshold, an edge is formed between the nodes that correspond
to these two concepts. The formed edge will then have the similarity score as
a weight attribute. Ultimately, all combinations of concept nodes are checked
to see whether a connection between them will be formed, hence resulting in
an undirected weighted graph. Subsequently, Louvain algorithm is used on the
aforementioned graph to reveal nodes that are more closely related than others
[
        <xref ref-type="bibr" rid="ref1 ref3">1, 3</xref>
        ]. The process is executed recursively in order to further break down clusters
into subclusters; with every such division, an intermediate node is created until
there is nothing to break down. The produced taxonomy starts with a root node
and expands until the leaf nodes reach the input concepts. The automatically
generated intermediate branch nodes are labelled with temporary IDs that are
to be named manually. The algorithm is essentially forming concept clusters,
as concept nodes form clusters with a common parent node. Also, neighbouring
cluster concepts are semantically closer than clusters farther apart in the
taxonomy. Figure 2 summarizes the described taxonomization process; input concepts
are represented by sets of terms in curly brackets.
      </p>
      <p>The resulting taxonomy was revised by a curator; input concepts became leaf
nodes, grouped into the generated 55 higher level nodes with unassigned
temporary labels. Curator's approach was to traverse clustered leaf nodes and assign
meaningful names to each of 55 parent concepts, replacing temporary labels.
Table 1 quanti es the human e ort spent on the curation of the automatically
created taxonomy. Even though we did not quantify the semantic soundness of
the generated clusters, it is worth noting that most of them looked accurate
to the curators, whereas grouping errors were likely triggered by corpora, used
to pre-train ML models we utilized for taxonomization (e.g., `interstitial space',
space between cells, and `hospital pharmacy' were wrongly clustered together,
as for WE both concepts are spaces, appearing in the similar semantic
neighborhoods).
2.2</p>
      <p>Manual Taxonomization
When approaching manual taxonomization, curator's strategy was to move from
concept to concept, starting from the top level nodes and establishing
broadernarrower relations, later dividing the nodes further down in sub-trees. This
topdown method requires several passes through the data. Initially, concepts were
sorted alphabetically which meant the taxonomist had to constantly jump from
one context to another (e.g., from `border worker' to `bronchoalveolar lavage' to
`budding'{ concepts that are semantically far o ). Table 1 provides the e ort
metrics of manual taxonomization (excluding all preparatory steps and domain
learning curve). While being a tedious challenge, the created taxonomy is a pure
result of the intellectual human capacity, not in uenced by additional obscure
models or primed by pre-trained algorithms.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>Coreon UI was used for both building and curation of the presented taxonomies.
Since it records any modi cations in the data repository, change logs were
retrieved and analyzed to determine precisely what actions the taxonomists
performed and how much time was spent. Table 1 demonstrates such information
for both scenarios. When comparing the numbers yielded by both approaches,
we see that starting with a pre-drafted knowledge graph, the curator was ve
times faster, not only counting pure working hours but also when comparing the
amount of transactions, i.e. events, mouse-clicks in the software.</p>
      <p>Metrics
Curator's time spent
Number of relations
changed
Number of new
concepts created
40h
1417
115
8h
432
28
When starting with an automatically pre-drafted taxonomy, curators are not
faced with a long list of to-be-processed concepts; they rather work cluster by
cluster. Even when clusters are o , the topic and focus are stable, and there
is no jumping between contexts (see Figure 3). Also, the algorithm encourages
a strictly hierarchical tree-like concept system (mono-hierarchical in this case),
whereas in the manual method, the curator often hooked concepts under more
than one parent. Our collaborative-AI approach can also facilitate parallel
working, allowing distributed curation of separate sub-trees. Ultimately, the curator
bene ts from the UI that allows to comfortably restructure the resulting
knowledge graph (see Figure 4).
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>Our study proves that it is possible to build a taxonomy while having nothing
but a at list of context-free tokens to taxonomize. We demonstrated that the
suggested collaborative taxonomization approach { combining ML and human
curation { can signi cantly bring down the e ort while yielding a taxonomy of
a consistent quality. Given availability of supporting textual data, the achieved
performance and resource-saving advantages of our custom method makes
taxonomization of even larger terminology databases viable. Every taxonomization
project revolves around a speci c domain, dictated by the vocabulary of the
terms at hand (virology, general medical terms, etc.).</p>
      <p>
        In future work, to create more accurate vector representations of domain
tokens, the speci c context in which they apply can be exploited: e.g., it can
be used to re-train WE model instead of using a more generic pre-trained one,
primed by generic Wikipedia texts. Literature suggests that such re-training
usually yields better results [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Consistent presence of metadata in the terminology
database can also aid auto-taxonomization, signi cantly reducing curators' toil
(e.g. metadata about a semantic parent of a term or free-text concept de
nitions can help with parent concept identi cation and/or naming, extrapolating
a potential parent instead of assigning concept clusters an abstract temporary
ID-name).
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Blondel</surname>
            ,
            <given-names>V. D.</given-names>
          </string-name>
          , Guillaume, JL.,
          <string-name>
            <surname>Lambiotte</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lefebvre</surname>
          </string-name>
          , E.:
          <article-title>Fast unfolding of communities in large networks</article-title>
          .
          <source>Journal of Statistical Mechanics: Theory and Experiment</source>
          (
          <volume>10</volume>
          ),
          <source>P10008</source>
          (
          <year>2008</year>
          ). https://doi.org/10.1088/
          <fpage>1742</fpage>
          -
          <lpage>5468</lpage>
          /
          <year>2008</year>
          /10/p10008
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Carrion</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Onorati</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>D az</surname>
          </string-name>
          , P.,
          <string-name>
            <surname>Triga</surname>
          </string-name>
          , V.:
          <article-title>A taxonomy generation tool for semantic visual analysis of large corpus of documents</article-title>
          .
          <source>Multimedia Tools and Applications</source>
          ,
          <volume>78</volume>
          (
          <issue>23</issue>
          ),
          <volume>32919</volume>
          {
          <fpage>32937</fpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Csardi</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nepusz</surname>
          </string-name>
          . T.:
          <article-title>The igraph software package for complex network research</article-title>
          .
          <source>InterJournal (Complex Systems)</source>
          ,
          <volume>1695</volume>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Heymann</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia-Molina</surname>
          </string-name>
          , H.:
          <article-title>Collaborative creation of communal hierarchical taxonomies in social tagging systems</article-title>
          .
          <source>Stanford</source>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Iloga</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romain</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tchuente</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A sequential pattern mining approach to design taxonomies for hierarchical music genre recognition</article-title>
          .
          <source>Pattern Analysis and Applications</source>
          <volume>21</volume>
          , 363{
          <fpage>380</fpage>
          (
          <year>2018</year>
          ). https://doi.org/10.1007/s10044-016-0582-7
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Iloga</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romain</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tchuente</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>An e cient generic approach for automatic taxonomy generation using HMMs</article-title>
          .
          <source>Pattern Analysis and Applications</source>
          ,
          <volume>24</volume>
          (
          <issue>1</issue>
          ),
          <volume>243</volume>
          {
          <fpage>262</fpage>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kotlerman</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Avital</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dagan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lotan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weintraub</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>A support tool for deriving domain taxonomies from wikipedia</article-title>
          .
          <source>In: Proceedings of the International Conference Recent Advances in Natural Language Processing</source>
          , pp.
          <volume>503</volume>
          {
          <fpage>508</fpage>
          . (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          :
          <article-title>Automatic taxonomy construction from keywords</article-title>
          .
          <source>In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          , pp.
          <volume>1433</volume>
          {
          <fpage>1441</fpage>
          . (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grave</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bojanowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Puhrsch</surname>
          </string-name>
          , Ch.,
          <string-name>
            <surname>Joulin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Advances in PreTraining Distributed Word Representations</article-title>
          .
          <source>In: Proceedings of the International Conference on Language Resources and Evaluation (LREC</source>
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Pietrasik</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reformat</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A simple method for inducing class taxonomies in knowledge graphs</article-title>
          .
          <source>In: European Semantic Web Conference</source>
          , vol.
          <volume>12123</volume>
          , pp.
          <volume>53</volume>
          {
          <fpage>68</fpage>
          . Springer, Cham (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Ryu</surname>
            ,
            <given-names>P.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Choi</surname>
            ,
            <given-names>K.S.:</given-names>
          </string-name>
          <article-title>Taxonomy learning using term speci city and similarity</article-title>
          .
          <source>In: Proceedings of the 2nd Workshop on Ontology Learning and Population: Bridging the Gap between Text and Knowledge</source>
          , pp.
          <volume>41</volume>
          {
          <fpage>48</fpage>
          . (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Treeratpituk</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khabsa</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Giles</surname>
            ,
            <given-names>C.L.</given-names>
          </string-name>
          :
          <article-title>Graph-based approach to automatic taxonomy generation (grabtax)</article-title>
          .
          <source>arXiv preprint arXiv:1307</source>
          .
          <fpage>1718</fpage>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Veremyev</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semenov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pasiliao</surname>
            ,
            <given-names>E.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boginski</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Graph-based exploration and clustering analysis of semantic spaces</article-title>
          .
          <source>Applied Network Science</source>
          ,
          <volume>4</volume>
          (
          <issue>1</issue>
          ),
          <volume>1</volume>
          {
          <fpage>26</fpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schuetze</surname>
          </string-name>
          , H.:
          <article-title>Learning Word Meta-embeddings</article-title>
          .
          <source>In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics</source>
          , pp.
          <volume>1351</volume>
          {
          <fpage>1360</fpage>
          . (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sadler</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanni</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>Han</surname>
            ,
            <given-names>J</given-names>
          </string-name>
          .: Taxogen:
          <article-title>Unsupervised topic taxonomy construction by adaptive term embedding and clustering</article-title>
          .
          <source>In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          , pp.
          <volume>2701</volume>
          {
          <fpage>2709</fpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>