<!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>
      <journal-title-group>
        <journal-title>Lernen, Wissen, Daten, Analysen. October</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>A Document Tagging Support System for Nursing Care Experts⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Beat Tödtli</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sebastian Müller</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Melanie Rickenmann</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Janine Vetsch</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Simon Haug</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Eastern Switzerland University of Applied Sciences</institution>
          ,
          <addr-line>Rosenbergstrasse 59, 9000 St. Gallen</addr-line>
          ,
          <country country="CH">Switzerland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>0</volume>
      <fpage>9</fpage>
      <lpage>11</lpage>
      <abstract>
        <p>We present the findings of an interdisciplinary project that implemented a document tagging support system for nursing care experts. We evaluate its performance and provide lessons learned. This project was particularly marked by a low inter-rater reliability of the document labels and use case understanding issues, but also of a good performance of a simple, BERT-based binary relevance approach.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;document tagging support</kwd>
        <kwd>document classification</kwd>
        <kwd>inter-rater reliability</kwd>
        <kwd>nursing care professional education</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Text mining and document classification are long-standing research areas [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] where deep
neural networks have made very significant contributions over the past years. In particular,
bidirectional transformer models such as BERT seem to "learn" structural information about
language [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and provide unprecedented performance and ease of use [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Such models can be
used for a broad range of application classes, such as document classification [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], regression
tasks, document tagging, information retrieval, recommendation tasks, and many more [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
While this is ground-breaking, it opens up a wide range of applied machine learning research
opportunities. The challenge there lies in gathering, structuring, consolidating and spreading
experiences into domain-adapted methodologies and insights. Peculiar challenges are often
raised by concrete application cases, such as in the case study reported here.
      </p>
      <p>We present the findings of a small-scale applied interdisciplinary project in the domain of
tagging support for document labelling tasks. The project’s goal was building a document
tagging support system for health experts tasked with tagging nursing care publications. As
an applied machine learning project, it had a set of requirements and challenges that are quite
diferent from standard text classification or information filtering tasks, on which we report
here.</p>
    </sec>
    <sec id="sec-2">
      <title>2. The Application Case</title>
      <sec id="sec-2-1">
        <title>2.1. Business Understanding</title>
        <p>
          Researchers in nursing care are investigating how to promote continuous professional learning
in the daily practice of nursing [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. In performing patient documentation, a tool could integrate
scientific evidence at the point of care and therefore provide nurses with easy access to evidence
in daily work. They therefore are labelling a dataset of nursing care publications and are
associating one or several topic tags with each of them1. This report is concerned with building
a document tagging support system for these experts, to be used as a decision support aid.
        </p>
        <p>In the business understanding eforts it was realized rather late in the project that helping
experts to save on the time needed to inspect a document was not as relevant as motivating the
expert to rethink his or her tagging decisions.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Data Understanding</title>
        <p>The data consisted of 1515 nursing care or medical publications each associated with one or
several of 24 diferent tags. The number of publications per tag (see Fig. 1) arose historically and
reflects a data taking campaign that did not specify the relative frequency of the tag categories
in the data set. After dropping tags with less than 20 associated documents and the class others,
1293 documents in 18 relevant categories remained.</p>
        <p>The tag frequency distribution was a data understanding indicator that had major implications
on the project: Only few tags were associated per document, but a significant fraction of
documents had more than one tag associated with it. 76% of all documents had 1 tag, 23% had
two tags and 1% had three or more tags.</p>
        <p>
          Therefore, a multi-label classification approach [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] is adequate since in 24% of the cases more
than one tag is associated with a document.
        </p>
        <p>Furthermore, metrics such as precision@k need to be evaluated with respect to the multi-label
case. In a UX workshop with the experts it was found desirable to present  = 3 selected
document tags. This implies that precision@3 values cannot reach a value of 100%. Also, most
information retrieval or recommender systems have a much smaller percentage of relevant
items to retrieve or recommend, so that our precision values will likely be much higher.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Dealing with Imprecise Labels</title>
        <p>
          A complication arose with the early realisation that there was some disagreement between
experts on which labels to assign to a given document. This efect was expected based on
the results of Xia and Yetisgen-Yildiz, since medical training alone does not ensure high
interannotator agreement and no NLP researcher had been involved in the annotation process
until this project. [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] The inter-expert labelling reliability was assessed using a small labelling
campaign where two experts labelled the same 60 documents. The co-occurrence matrix of the
ratings as judged by two experts indicated disagreements even though for most documents (87%)
at least one tag was overlapping. It was also found that averaged over all assigned tags, the
1We use the word "tag" or "category" instead of "label" to indicate that each document can have more than one tag
(or category) associated with it.
intersection over union of the assigned tag sets was 72%. However, to assess inter-expert
reliability, Krippendorf’s alpha [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] is more appropriate here, as it takes into account
interlabeller (dis-)agreement by chance. It has further advantages in that it allows for missing values
and multiple tags. We find a value of  = 0.59, indicating a substantial inter-rater agreement
according to Landis and Koch [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], but not according to Krippendorf who is reported to consider
0.8 as an absolute minimum value for any serious purpose [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Based on these indications,
an important task in a next iteration is to write annotation guidelines and ensure consensus
between the various nursing care experts about how to apply these guidelines [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Functional Prototype Construction</title>
      <sec id="sec-3-1">
        <title>3.1. Data Preprocessing and Feature Engineering</title>
        <p>The proposed system consists of text extraction and feature engineering steps that return the
BERT sentence embedding using the Hugging Face model "paraphrase-MiniLM-L6-v2"2 of the
paper abstract and a tag filtering step based on this vector to be detailed further in Sec. 3.2.
2See https://huggingface.co/sentence-transformers/paraphrase-MiniLM-L6-v2</p>
        <p>A feature selection decision was made by using BERT feature vectors of the publication
abstracts only. They were extracted manually by the experts and have the advantage of fitting
well within the 512 subword tokens limit imposed by BERT.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Modelling: Multi-Label Classification for Document Tag Filtering</title>
        <p>
          For multi-label classification, we used a binary relevance problem transformation method [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
Let  = 18 be the number of diferent tags available before filtering. Binary probabilistic
classifiers  :  → [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ] for each  ∈ {1 . . . } were trained using support vector classifiers
with rbf-kernels. Their predicted class probabilities for a document , {(),  = 1, ...}, were
interpreted as tag relevance scores. The tags with the  = 3 highest scores were selected.
        </p>
        <p>As part of the user interface design choice and as a consequence of the distribution of the
number of tags per document,  = 3 tags were selected and presented in red with the associated
probabilities. Fig. 2 shows the user interface as it is currently implemented.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Evaluation: Statistical Results</title>
        <p>We discuss the evaluation of the data mining prototype on the statistical level. The user level
evaluation is discussed in 4.2. Our main results are given in Tab. 1</p>
        <p>The low precision@3 and MAP@3 values can be attributed to the fact that the number of
relevant tags per document are mostly 1 or 2. The average precision@1 is higher, at 82%. From
a practical point of view, the recall@3 value is presumably the most important one, as three
tags can easily and quickly be judged by an expert. By looking only at these top-3 selections,
however, the expert might miss relevant tags in 8% of the cases.</p>
        <p>This result was deemed suficient for a first iteration and therefore terminated classifier
optimization eforts, as early user experience feedback was deemed more important. However,
42%
82%
92%
61%
the single-tag binary classifiers were far from perfect, as the precision-recall curves in Fig. 3
show. In fact, these curves show that the less frequent tags (with a prevalence of 2-4%) perform
worse than the more frequent ones (appearing in 6-13% of the documents), suggesting that a
larger data set will likely help improve the performance further.</p>
        <p>Although useful as a rough performance estimate, recall@3 must be considered a flawed
metric since the number of relevant tags varies mostly between 1 and 2 tags per document
Given that ∼ 97% of all documents in the test data set had at most two associated labels, Tab. 2
considers the documents with one and two labels separately.</p>
        <p>On the subset of ∼ 63% of documents with only one relevant tag, Tab. 2 lists the percentages
of documents for which this relevant tag is not found, found at the first, second or third item in
the filtered list. For the ∼ 33% of documents with two relevant labels, similarly the percentages
of where the two relevant tags were found are given.</p>
        <p>Thus, for documents with one relevant tag, precision@3 values of over 90% were reached,</p>
        <p>Position</p>
        <p>Classifier Type
Support Vector Machine</p>
        <p>Naïve Bayes</p>
        <p>None
7%
8%
3
3%
3%</p>
        <p>None
1%
3%
2 relevant tags
1 tag 1+2 1+3
18% 64% 12%
20% 61% 7%
whereas for documents with two relevant tags, both tags were found in the top 3
recommendations in at least 92% of the cases. Using a naïve Bayes classifier instead of a support vector
machine generally resulted in a minor performance reduction.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Deployment</title>
      <sec id="sec-4-1">
        <title>4.1. Software Architecture</title>
        <p>All tagged publications are made accessible for nursing practitioners on a TYPO3-based website.
Data is stored on a Linux server and managed in a MariaDB database.</p>
        <p>Experts administrate publications in the backend of the website. The Python-based filter
system is started once a day with a cron job, retrieves newly uploaded publications via REST-API
and writes the filtered tags (also via REST-API) into a designated table of the MariaDB database,
from where they are displayed to the tagging experts (see Fig. 2).</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Evaluation: Assessment of User Experience</title>
        <p>The system has so far been in use for 6 months. Based on an interview conducted with the
nursing care expert chiefly tasked with tagging documents, several crucial insights could be
established. The most problematic one was that the expert viewed the filtered tags as almost
authoritative recommendations. The expert looked at the system’s three filtered tags and
checked their plausibility, instead of looking at the document and determining the relevant tags.
The option of tagging the document with a non-filtered item and the tag probability indications
were ignored. This was done mainly out of convenience and eficiency, believing that no tag
could be relevant that was not highlighted. The expert also declared that he no longer looked at
the abstract and/or the paper, instead he would rely solely on the filtering system and the title.</p>
        <p>These practices must be registered with alarm, since apparently even with usage instructions
and being involved in this project and knowledge of the statistical evaluation results, the expert
seemd happy to uncritically pass on the responsibility for the correctness of the tags to the tag
ifltering system.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion and Outlook</title>
      <p>We built a document tagging support system to aid nursing care experts in building a labelled
dataset for on-the-job professional education.</p>
      <p>Using a simple BERT-based feature engineering approach combined with a standard radial
basis function support vector machine, recall@3 values of around 90% were reached. While the
domain experts deemed this result good enough for deployment, issues regarding the specified
inter-rater reliability and scarce training data for several tags show potential for improvements.
Consequently, Fig. 1 showed that not all tags were reliably recognized by the system. It is
likely that inter-labeller agreement was the limiting factor in this regard, in contrast to many
CRISP-DM-projects where data collection, feature engineering and optimizing the modelling
step often pose the key challenges.</p>
      <p>Our results also demonstrate that building custom tagging support systems is already quite
inexpensive. This again suggests that domain-adaptation eforts are reasonably likely to be
successful when transformer-based sentence embeddings are used.</p>
      <p>We cautiously try generalise these insights. When trying to judge the probability of success
of a tagging support system, some important positive indications are if
• the domain-specific dataset is at least moderately sized. In the case of publications, 20-50
abstracts per category might sufice.
• the labels are easily distinguished based on the text only, possibly even by non-experts.
• experts judge the reasoning necessary to distinguish between categories to be simple.</p>
      <p>During our project, we designed the system with the the goal of challenging the experts to
reconsider their tag selections with the aid of the tagging support system. The system was
therefore designed around assisting expert labelling, rather than providing an expert opinion
by itself. Despite respective eforts and instructions though, the expert interviewed after using
the system for two months developed a significant inclination to uncritically adopt the system’s
(alleged) "recommendation" out of convenience. This UX-challenge remains unsolved and ofers
great potential for future research.</p>
      <sec id="sec-5-1">
        <title>5.1. Lessons to Consider</title>
        <p>
          In summary, we list some lessons learned:
• Carefully think about how the system biases the expert’s labelling decision. The experts
might need training to correctly use the system. Otherwise there is a possibility that they
uncritically accept the system’s biases in the tagging process by trying to become more
eficient. Additionally regularly check the way it is used after deployment.
• Do not start a tagging or labelling process without defining clear labelling instructions.
• Monitor the label correlations in the labelling process, and discuss label categories among
experts to verify that they are discernible by all [
          <xref ref-type="bibr" rid="ref12 ref7">12, 7</xref>
          ].
• If in doubt, measure the inter-rater reliability early on. A low inter-rater reliability may
invalidate the project goals, and the system performance will be limited by the label
consistency the training data has.
• For the task of scientific document tagging support, abstracts are useful. The bulk of a
document should be considered in a second iteration only because the limited transformer
input length poses additional potentially expensive challenges.
        </p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bilski</surname>
          </string-name>
          ,
          <article-title>A review of artificial intelligence algorithms in document classification</article-title>
          ,
          <source>International Journal of Electronics and Telecommunications</source>
          vol.
          <volume>57</volume>
          (
          <year>2011</year>
          ). URL: http: //journals.pan.pl/Content/86895/PDF/35.pdf.
          <source>doi:10.2478/v10177-011-0035-6.</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , L. u. Kaiser,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          , in: I. Guyon,
          <string-name>
            <given-names>U. V.</given-names>
            <surname>Luxburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fergus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vishwanathan</surname>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>30</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2017</year>
          . URL: https://proceedings.neurips.cc/ paper/2017/file/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delangue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cistac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Louf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Funtowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Davison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shleifer</surname>
          </string-name>
          , P. von Platen, C. Ma,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jernite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Plu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Le</given-names>
            <surname>Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gugger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Drame</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lhoest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rush</surname>
          </string-name>
          , Transformers:
          <article-title>State-of-the-art natural language processing</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>38</fpage>
          -
          <lpage>45</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .emnlp-demos.6. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .emnlp-demos.
          <volume>6</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Adhikari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ram</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>Docbert: Bert for document classification</article-title>
          , ArXiv abs/
          <year>1904</year>
          .08398 (
          <year>2019</year>
          ). URL: http://arxiv.org/abs/
          <year>1904</year>
          .08398.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.</given-names>
            <surname>Nogueira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <surname>Passage</surname>
          </string-name>
          re-ranking
          <source>with bert</source>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1901</year>
          . 04085. doi:
          <volume>10</volume>
          .48550/ARXIV.
          <year>1901</year>
          .
          <volume>04085</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Ranegger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Haug</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vetsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Baumberger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bürgin</surname>
          </string-name>
          ,
          <article-title>Providing evidence-based knowledge on nursing interventions at the point of care: findings from a mapping project</article-title>
          ,
          <source>BMC Medical Informatics and Decision Making</source>
          <volume>22</volume>
          (
          <year>2022</year>
          )
          <article-title>308</article-title>
          . URL: https://doi.org/10.1186/ s12911-022
          <article-title>-02053-8</article-title>
          . doi:
          <volume>10</volume>
          .1186/s12911-022-02053-8.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R. B.</given-names>
            <surname>Pereira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Plastino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zadrozny</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. H.</given-names>
            <surname>Merschmann</surname>
          </string-name>
          ,
          <article-title>Correlation analysis of performance measures for multi-label classification</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>54</volume>
          (
          <year>2018</year>
          )
          <fpage>359</fpage>
          -
          <lpage>369</lpage>
          . URL: https://www.sciencedirect.com/science/article/pii/ S0306457318300165. doi:https://doi.org/10.1016/j.ipm.
          <year>2018</year>
          .
          <volume>01</volume>
          .002.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>F.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yetisgen-Yildiz</surname>
          </string-name>
          ,
          <article-title>Clinical corpus annotation: challenges and strategies, in: Proceedings of the third workshop on building and evaluating resources for biomedical text mining (BioTxtM'2012) in conjunction with the international conference on language resources and evaluation (LREC)</article-title>
          , Istanbul, Turkey,
          <year>2012</year>
          , pp.
          <fpage>21</fpage>
          -
          <lpage>27</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>K.</given-names>
            <surname>Krippendorf</surname>
          </string-name>
          ,
          <article-title>Content Analysis: An Introduction to Its Methodology (second edition</article-title>
          ),
          <source>Sage Publications</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Landis</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. G. Koch,</surname>
          </string-name>
          <article-title>The measurement of observer agreement for categorical data</article-title>
          ,
          <source>Biometrics</source>
          <volume>33</volume>
          (
          <year>1977</year>
          )
          <fpage>159</fpage>
          -
          <lpage>174</lpage>
          . URL: http://www.jstor.org/stable/2529310.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Artstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Poesio</surname>
          </string-name>
          ,
          <article-title>Survey article: Inter-coder agreement for computational linguistics</article-title>
          ,
          <source>Computational Linguistics</source>
          <volume>34</volume>
          (
          <year>2008</year>
          )
          <fpage>555</fpage>
          -
          <lpage>596</lpage>
          . URL: https://aclanthology.org/J08-4004. doi:
          <volume>10</volume>
          .1162/coli.07-034-
          <fpage>R2</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Read</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bifet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Holmes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Pfahringer</surname>
          </string-name>
          ,
          <article-title>Scalable and eficient multi-label classification for evolving data streams</article-title>
          ,
          <source>Machine Learning</source>
          <volume>88</volume>
          (
          <year>2012</year>
          )
          <fpage>243</fpage>
          -
          <lpage>272</lpage>
          . URL: https://doi.org/10. 1007/s10994-012-5279-6. doi:
          <volume>10</volume>
          .1007/s10994-012-5279-6.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>