<!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>Classi cation of Animal Experiments: A Reproducible Study. IMS Unipd at CLEF eHealth Task 1</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Giorgio Maria Di Nunzio</string-name>
          <email>giorgiomaria.dinunzio@unipd.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Information Engineering</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Mathematics University of Padua</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we describe the third participation of the Information Management Systems (IMS) group at CLEF eHealth 2019 Task 1. In this task, participants are required to label with ICD-10 codes health-related documents with the focus on the German language and on non-technical summaries (NTPs) of animal experiments. We tackled this task by focusing on reproducibility aspects, as we did the previous years. This time, we tried three di erent probabilistic Nave Bayes classi ers that use di erent hypothesis on the distribution of terms in the documents and the collection. The experimental evaluation showed a signi cantly di erent behavior of the classi ers during the training phase and the test phase. We are currently investigating possible sources of biases introduced in the training phase as well as out-of-vocabulary issues and change in the terminology from the training set to the test set.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In this paper, we report the experimental results of the participation of the IMS
group to the CLEF eHealth Lab [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], in particular to Task 1: \Multilingual
Information Extraction - Semantic Indexing of animal experiments summaries" [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
This task consists in automatically labelling with ICD-10 codes health-related
documents with the focus on the German language and on non-technical
summaries (NTPs) of animal experiments with the German Classi cation Diseases
(ICD10) codes.
      </p>
      <p>The main goal of our participation to the task this year was to test the
e ectiveness of three simple Nave Bayes (NB) classi ers and provide the source
code (as we did in the previous years) to promote failure analysis and comparison
of results.3</p>
      <p>
        The contribution of our experiments to this task can be summarized as
follows:
{ A study of a reproducibility framework to explain each step of the pipeline
from raw data to cleaned data;
{ An evaluation of three simple classi ers that use an optimization approach
based on the two-dimensional representation of probabilistic models [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ].
      </p>
      <p>We submitted 3 o cial runs, one for each classi er, and we will prepare
a number of additional non-o cial runs that we will evaluate and compare in
order to study the change in performance when adding more information in the
pipeline.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Method</title>
      <p>
        In this section, we summarize the pipeline we used in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] that has been reproduced
in this work for each run.
2.1
      </p>
      <sec id="sec-2-1">
        <title>Pipeline for Data Cleaning</title>
        <p>
          In order to produce a clean dataset, we followed the same pipeline for data
ingestion and preparation for all the experiments. We used the tidytext [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] and
SnowballC 4 packages in R to read and stem words. The following code
summarizes these steps:
u n n e s t t o k e n s ( term , t e x t ,
t o k e n = " words " ,
s t r i p n u m e r i c = TRUE) %&gt;%
mutate ( term = wordStem ( term , l a n g u a g e = " de " ) ) %&gt;%
f i l t e r ( ! ( term %i n% c ( stopwords german , " t i e r " ) ) )
The %&gt;% symbol represents the usual \pipe" symbol (the output of a function
step is the input of the next function). We used the \unnest tokens" function
to split each text into words; then we stemmed each word with the German
Snowball stemmer and lter out the list of stopwords provided by Jaques Savoy.5
We added the word \tier" (\animal" in German) to the list of stopwords since
it is the most frequent word in the collection. We did not perform any acronym
expansion/reduction, as we did in the previous years, and we did not perform
any word decompounding.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Classi cation</title>
        <p>
          We used three NB classi ers for the classi cation of documents. In particular,
the three classi ers di er in the model (the mathematical description) of the
distribution of documents and terms. We followed our previous work on the
visualization of classi ers for hyper-parameters optimization [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. The three models
are: Multivariate Bernoulli model, Multinomial model, and Poisson model.
4 https://cran.r-project.org/web/packages/SnowballC/index.html
5 http://members.unine.ch/jacques.savoy/clef/
        </p>
        <p>In the multivariate Bernoulli model, an object is a binary vector over the
space of features:
fk</p>
        <sec id="sec-2-2-1">
          <title>Bern( fkjc) :</title>
          <p>where fkjc is the parameter of the Bernoulli variable of the k-th feature in the
c class.</p>
          <p>In the multinomial model we have one multinomial random variable which
can take values over the set of features:
oj
(N1;j ; :::; Nm;j )</p>
          <p>M ultinomial( fjc) :
where Nk;j indicates the number of times feature fk appears in the object oj .</p>
          <p>In the Poisson model, an object oj is generated by a multivariate Poisson
random variable:</p>
          <p>Ni;j</p>
        </sec>
        <sec id="sec-2-2-2">
          <title>Pois( fijc) :</title>
          <p>(1)
(2)
(3)
3</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experiments and Results</title>
      <p>We submitted three o cial runs, one for each model. The goal of these
experiments is to compare the e ectiveness of the three classi ers and study the
di erence among them in a failure analysis (post experiments).
3.1</p>
      <sec id="sec-3-1">
        <title>Dataset</title>
        <p>The dataset contains 8,793 documents: 7,544 documents for training, 842 for
development, and 407 for testing. After we processed the training and development
set, the number of features (words) after stemming and stopwords removal is
74,002. There are a total of 233 categories in the German Classi cation Diseases
(ICD10) codes database. The training set contains 230 categories (categories
H65-H75, R10-R19, and R20-R23 are missing), the development set contains
156 categories, while the test set 119 categories. Therefore, there are 112
categories that are in the training set but not in the test set and, surprisingly, one
category, R10-R19, which is in the test set but not in the training set. Given this
distribution of categories, we merged the training and the development set into
one dataset that we used to train the classi ers with a k-fold cross validation.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Evaluation Measures</title>
        <p>In order to optimize the three models, we used the F1 measure for each binary
classi er (one for each category). In this paper, we report the three measures used
by the organizers, Recall, Precision and F1, both the macro-averaged measures
(values averaged across all the categories) and the micro-averaged measures (as
the sum of all the confusion matrices produced by each classi er). In the tables
of the results, we use capital letters to indicate macro-averages (for example
Recall) and small letters for micro-averages (for example recall). We report two
macro-averaged F1 measures: one computed on the values of the macro-averaged
Precision and Recall, the other (indicated with a `*' at superscript) computed as
the average of the F1 measures. For those categories without positive documents
(in the development or test set), by default we assign a recall of 1 and a precision
of either 0 (when there is at least one false positive) or 1 (when no false positive
is found for that category).
3.3</p>
        <p>O</p>
        <p>cial Runs
We used a k-fold cross validation approach to train the models and optimize
the hyper-parameters of the two-dimensional approach (more details in the nal
version). We used all the training and development documents for the cross
validation with k = 10, and we trained a binary classi er for each class in the
corpus. Nine out of the ten folds have 838 documents while the latter has 844
documents; consequently, we have on average about 7,540 training documents
and 840 validation documents.</p>
        <p>The average results across the 233 classes on the ten validation folds are the
ones shown in Table 1.</p>
        <p>In Table 2, we show the results of the classi ers that use the training set to
estimate the probabilities and the development set for the evaluation (with or
without the optimization of the decision line). We can see that these results are
in line with the one reported during the k-fold cross validation approach with
a slightly di erence in the micro-averaged performance when the non-optimized
version is used compared to the optimized one. This may indicate that there is
some over tting for those categories with too few training documents; in fact,
even with just one positive training documents the algorithm tries to nd the
best tting line.</p>
        <p>In Table 3, we report the results on the test set. Surprisingly, the behavior
of the classi er is completely di erent from the one we observed during the
training/development phase. Macro-averaged measures are still satisfactory, but
we have to remind that we introduced a correction in the computation of the
recall for those categories without positive documents that may have a ected
(positively) the averages.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Aftermath</title>
      <p>
        We are currently analyzing possible sources of error in the test phase. One thing
that seems evident from the analysis is that the distribution of probabilities of
terms has changed from the development to the test set. We can observe this
from a comparison of Figures 1 and 2. These gures show the two-dimensional
distribution ([
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) of positive and negative documents of the Poisson model for
development set of category \II". The blue line indicates the decision taken by
the classi er: below the line a document is assigned to category II, above the
line the document is rejected. The red dots represent the positive documents.
We can see that, in this case, the classi er performs well on the development set
(a recall of 0.96 and a precision of 0.86) since almost all the positive documents
are below the line. On the other hand, the same classi er performs very poorly
on the test set (recall and precision both are zero). This is somewhat surprising
since in both cases the development and test set contain unseen documents.
      </p>
      <p>We are also studying whether this signi cant change in the position of the
cloud of documents (corresponding to the probability of documents) is related to
a di erent distribution of words in the test set or to a change in the vocabulary
of terms in the test set.</p>
      <p>There is also a chance in some bug in the source code that we were not able
to nd until now.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>In this work, we presented our participation to the CLEF eHealth Task 1 on the
classi cation of medical documents. We presented the evaluation of three
probabilistic classi ers based on di erent assumptions on the distribution of words,
namely binary, multinomial and Poisson. We described a method to process the
0
0
5
−
0
0
0
1
−
0
0
5
1
−
−1500
−1000
x
−500
0
documents and optimize the classi ers according to the two-dimensional
representation of probabilistic models. The results on the test set were very low
despite a correct training/development phase that showed promising results. This
opened new ideas about how to better control the training/development phase
of the classi er and how to study possible sources of errors in the assumptions
made during the training.
0
0
0
5
−
0
0
5
1
−
−2000
Fig. 2. Poisson model test set. Distribution of positive (red) and negative (black)
documents for the category II.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Butzke</surname>
          </string-name>
          , Antje Dotendahl, Nora Leich, Barbara Grune, Mariana Neves, and
          <article-title>Gilber Schonfelder. Clef ehealth 2019 multilingual information extraction - semantic indexing of animal experiments</article-title>
          .
          <source>In CLEF 2019 Evaluation Labs and Workshop: Online Working Notes. CEUR-WS.org</source>
          ,
          <year>September 2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Giorgio</given-names>
            <surname>Maria Di Nunzio</surname>
          </string-name>
          and
          <string-name>
            <given-names>Alessandro</given-names>
            <surname>Sordoni</surname>
          </string-name>
          .
          <article-title>Picturing bayesian classi ers: A visual data mining approach to parameters optimization</article-title>
          .
          <source>In Yanchang Zhao Yonghua Cen, editor, Data Mining Applications with R, chapter 2. Elsevier</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Liadh</given-names>
            <surname>Kelly</surname>
          </string-name>
          , Hanna Suominen, Lorraine Goeuriot, Mariana Neves, Evangelos Kanoulas,
          <string-name>
            <given-names>Dan</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Leif</given-names>
            <surname>Azzopardi</surname>
          </string-name>
          , Rene Spijker, Guido Zuccon, Jimmy, and Joao Palotti, editors.
          <source>Overview of the CLEF eHealth Evaluation Lab</source>
          <year>2019</year>
          .
          <source>CLEF 2019 - 10th Conference and Labs of the Evaluation Forum. Lecture Notes in Computer Science (LNCS)</source>
          , Springer,
          <year>September 2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Giorgio</given-names>
            <surname>Maria Di Nunzio</surname>
          </string-name>
          .
          <article-title>A new decision to take for cost-sensitive nave bayes classi ers</article-title>
          .
          <source>Inf</source>
          . Process. Manage.,
          <volume>50</volume>
          (
          <issue>5</issue>
          ):
          <volume>653</volume>
          {
          <fpage>674</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Giorgio</given-names>
            <surname>Maria Di Nunzio</surname>
          </string-name>
          .
          <article-title>Interactive text categorisation: The geometry of likelihood spaces</article-title>
          .
          <source>Studies in Computational Intelligence</source>
          ,
          <volume>668</volume>
          :
          <fpage>13</fpage>
          {
          <fpage>34</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Giorgio</given-names>
            <surname>Maria Di Nunzio</surname>
          </string-name>
          .
          <article-title>Classi cation of ICD10 codes with no resources but reproducible code. IMS unipd at CLEF ehealth task 1</article-title>
          . In Working Notes of CLEF 2018 -
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , Avignon, France,
          <source>September 10-14</source>
          ,
          <year>2018</year>
          .,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Julia</given-names>
            <surname>Silge</surname>
          </string-name>
          and David Robinson.
          <article-title>tidytext: Text mining and analysis using tidy data principles in r</article-title>
          .
          <source>The Journal of Open Source Software</source>
          ,
          <volume>1</volume>
          (
          <issue>3</issue>
          ),
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>