<!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>ECNU at 2016 eHealth Task 1: Handover Information Extraction</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yang Song</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yun He</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hongyu Liu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yueyao Wang</string-name>
          <email>yywangg@ica.stc.sh.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Qinmin Hu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liang He</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guihua Luo</string-name>
          <email>ghluo@metinform.cn</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science &amp; Technology, East China Normal University</institution>
          ,
          <addr-line>Shanghai, 200241</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Science and Technology Commission of Shanghai Municipality</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Shanghai Digital Trade Co. Ltd</institution>
          ,
          <addr-line>Shanghai, 200241</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Shanghai Key Laboratory of Multidimensional Information Processing</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>The CLEF eHealth 2016 Task 1 is set to automatically assign pre-de ned medical tag to each word in the patient case records. The di culty of the task is that many classes have little training data. This paper presents our work on the 2016 CLEF eHealth Task 1. In particular, we propose an optimized Conditional Random Field algorithm to better ful ll the task. We also utilize the information extracted through association rules and MetaMap to boost the performance of our results. The evaluation results show our runs outperform the four o cial baselines in this di culty task.</p>
      </abstract>
      <kwd-group>
        <kwd>Conditional Random Field</kwd>
        <kwd>Association Rule</kwd>
        <kwd>MetaMap</kwd>
        <kwd>Information Extraction</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        CLEF eHealth 2016 Task 1 addresses clinical information extraction, related to
Australian nursing shift change[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ][
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. This extends the 2015 task 1a of converting
verbal nursing handover to written free-text records. In 2016, our participants
are challenged to maximize the correctness in structuring these written
freetext records by pre- lling a handover form by automatically identifying relevant
text-snippets for each slot of the form.
      </p>
      <p>
        The data set utilized in this task is called NICTA Synthetic Nursing Handover
Data [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ][
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. It has been developed for clinical speech recognition and information
extraction related to nursing shift-change handover at NICTA from 2012. This
data set contains 200 synthetic patient cases which can be used for training and
validation. The patient cases record the patient's pro le and health information.
      </p>
      <p>In this task, the organizers provide us with 36 tags which are related to
the categories of Patient Introduction, My Shift, Appointments, Medication and
Future Case in the handover form. We are asked to assign one of the 36 tags to
each word in the patient case records. The 36 tags are summarized in table 1.</p>
      <p>
        Our system architecture is proposed in Figure 1. We mainly utilize the
Conditional Random Field (CRF) model to achieve the results [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ][
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. To better satisfy
the assignment, we design strategy to automatically select features to train
different tags. Furthermore, we use association rules [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ][
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] to extract information of
patient name, age, gender, room number, bed number and doctor name to
enhance our outputs. At last, we apply MetaMap to recognize the Uni ed Medical
Language System (UMLS) concepts in the patient case records. The MetaMap
tags are utilized as the supplement to decide which word should have the tag of
Medication Medicine.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <sec id="sec-2-1">
        <title>CRF Model Training</title>
        <p>
          The organizers provide us with 17 features for each word in the health care
records, which are listed in table 2 [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. All of these features are relevant to the 36
health care information tags. We intent to utilize CRF model to implement the
labeling task. However, di erent feature set have di erent precision and recall
rate. We are motivated to solve this problem by select the proper feature set for
each tag to train the CRF model.
        </p>
        <p>Suppose A = ffig; i = 1; 2; :::; 17 is the feature set which contains the whole
17 features, and B is the feature set which contains features should be removed
from A. For a tag, such as PatientIntroduction CarePlan, we utilize the following
method to discover its suitable feature set for the CRF model training. Denote
C as the suitable feature set for the PatientIntroduction CarePlan tag.
{ Utilizing feature set A to train CRF model in data set 1, and using data set
2 to test the model. denote the precision of PatientIntroduction CarePlan
as p.
{ 8fi 2 A; i = 1; 2; :::; 17, remove fi from A. Train the CRF model by
utilizing the data set 1 based on the feature set A without fi. Test the learned
CRF model on data set 2. Denote the precision on the
PatientIntroduction CarePlan tag as pfi .
{ Calculate the mean value of pfi ; i = 1; 2; :::; 17 and denote it as pm. If pfi &gt; p
and pfi pm &gt; 10%, then put the feature fi into set B.</p>
        <sec id="sec-2-1-1">
          <title>ID Name</title>
        </sec>
        <sec id="sec-2-1-2">
          <title>1 Word</title>
        </sec>
        <sec id="sec-2-1-3">
          <title>2 Lemma</title>
          <p>NER</p>
        </sec>
        <sec id="sec-2-1-4">
          <title>3 (named entity recognition)</title>
          <p>4 (PpOarSt of speech)</p>
        </sec>
        <sec id="sec-2-1-5">
          <title>POS tag of the word</title>
        </sec>
        <sec id="sec-2-1-6">
          <title>5 Parse tree</title>
        </sec>
        <sec id="sec-2-1-7">
          <title>Parse tree of the sentence from the root to the current word</title>
          <p>6 Basic dependents Bwoarsdic dependents of the
9 Top 5 candidates vTeodp f5rocmanUdiMdaLtSes
retrie10 Top mapping</p>
        </sec>
        <sec id="sec-2-1-8">
          <title>Top UMLS mapping for the concept that is the best match with a given text snippet</title>
        </sec>
        <sec id="sec-2-1-9">
          <title>ID Name De nition</title>
        </sec>
        <sec id="sec-2-1-10">
          <title>1 if the word is a full term</title>
          <p>in ATCL (Anatomical
The11 Medication score rapeutic Chemical List);
else 0.5 if it can be found
in ATCL; 0 otherwise</p>
        </sec>
        <sec id="sec-2-1-11">
          <title>Example</title>
        </sec>
        <sec id="sec-2-1-12">
          <title>1 for \acetylsalicylic acid"</title>
        </sec>
        <sec id="sec-2-1-13">
          <title>Software</title>
        </sec>
        <sec id="sec-2-1-14">
          <title>NICTA</title>
          <p>12 Location
to its end</p>
        </sec>
        <sec id="sec-2-1-15">
          <title>Location of the word on a</title>
          <p>tenpoint scale from the \1" for the rst word
beginning of the document and \10" for the last NICTA
word</p>
        </sec>
        <sec id="sec-2-1-16">
          <title>Number of times a given</title>
          <p>term occurs in a document
13 Normalized term divided by the maximum
frequency of this term frequency over
all terms in the
document</p>
        </sec>
        <sec id="sec-2-1-17">
          <title>As 9 using SNOMED-CT</title>
        </sec>
        <sec id="sec-2-1-18">
          <title>AU (Systematized</title>
          <p>14 Top 5 candidates Nomenclature of
Medicine</p>
        </sec>
        <sec id="sec-2-1-19">
          <title>Clinical Terms-Australian</title>
        </sec>
        <sec id="sec-2-1-20">
          <title>Release)</title>
          <p>15 Top mapping</p>
        </sec>
        <sec id="sec-2-1-21">
          <title>As 1using SNOMED-CTAU</title>
          <p>16 Top 5 candidates As 9 using AMT5
17 Tom mapping</p>
        </sec>
        <sec id="sec-2-1-22">
          <title>As 10 using AMT</title>
        </sec>
        <sec id="sec-2-1-23">
          <title>NICTA</title>
        </sec>
        <sec id="sec-2-1-24">
          <title>Ontoserver</title>
        </sec>
        <sec id="sec-2-1-25">
          <title>Ontoserver</title>
        </sec>
        <sec id="sec-2-1-26">
          <title>Ontoserver</title>
        </sec>
        <sec id="sec-2-1-27">
          <title>Ontoserver</title>
          <p>{ The suitable set C = A B. This means that the features in the set B will
decrease the precision and ought to be removed from the features collection.</p>
          <p>Thus, we obtain a suitable feature set for each tag. The suitable feature sets
are noted as Ci; i = 1; 2; :::; 36, corresponding to the 36 medical tags. Next step,
we utilize Ci; i = 1; 2; :::; 36, to train CRF model respectively, and we obtain 36
results by using those learned CRF model to perform labelling task in a patient
case record. Then, we combine these results through the method of voting. Note
the 36 medical tags as ti; i = 1; 2; :::; 36. For a word w in the patient case record,
suppose the tag ti appears ni times. We select the tag which have the highest
voting count as the nal tag of the word w. Suppose tA is the label of w obtained
by the CRF model which is trained by utilizing the feature set A. If two or more
tags which share the same highest appear time we select tA as the nal tag of
w.
2.2</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Utilizing Association Rules to Extract Information</title>
        <p>We analyze the test and training set and discover that information about patient
name, room, bed, gender, age and doctor name have the same expressing format.
Thus, we utilize association rules to extract relevant information and assign them
with the relevant tags automatically. The association rules are listed in table 3
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>MetaMap Application</title>
        <p>We use MetaMap6 to obtain the Uni ed Medical Language System (UMLS)
concepts in the patient case records. Meanwhile, we identify the words with
MetaMap tag \phsu" and assign them with the tag \Medication Medicine".
2.4</p>
      </sec>
      <sec id="sec-2-4">
        <title>Combination</title>
        <p>We combine our results achieved from the CRF model, association rules and
MetaMap in order to get a better performance. Runs obtained by CRF models
are utilized as our basic runs. We use the results achieved by using rules and
MetaMap to modify the tags in CRF runs.</p>
        <p>Suppose SC ; SR; SM are the results achieved by CRF, association rules and
MetaMap respectively. For a word in a patient case record, if its tag in CRF
run is di erent from its tag in rule and MetaMap runs, we utilize the tag in
association rules and MetaMap runs to replace the tag in CRF run. Note that,
there is no con ict between the tags resulted from the association rules and the
MetaMap, since the two methods extract information for di erent tags.
6 https://mmtx.nlm.nih.gov/
word in fmale,him,his,he,gentleman,
gentlemen, man,men,boy,boys,himself g
or ffemale,her,she, hers,lady,ladies,
woman,women,girl,girls,herself g
without the word \under" + words
PatientIntroduction GivenNames/Initials capitalized the rst letter</p>
        <sec id="sec-2-4-1">
          <title>PatientIntroduction Lastname</title>
        </sec>
        <sec id="sec-2-4-2">
          <title>PatientIntroduction UnderDr</title>
        </sec>
        <sec id="sec-2-4-3">
          <title>GivenNames/Initials</title>
          <p>without the word \under" + words
capitalized
the rst letter
\under" + (\Dr") + name</p>
        </sec>
        <sec id="sec-2-4-4">
          <title>PatientIntroduction UnderDr Lastname \under" + (\Dr") + name</title>
        </sec>
        <sec id="sec-2-4-5">
          <title>PatientIntroduction Ageinyears</title>
        </sec>
        <sec id="sec-2-4-6">
          <title>NO. + \years old" / \yrs old" / \yr old"</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experiments and Evaluation</title>
      <p>We utilize the features in the le \CRF Matrix noLabel.data" provided by
organizers to train our CRF model. We implement the training and tagging process
of CRF by a open-source toolkit named \CRF++-0.58". Data set 1 and data
set 2 are all used for training a CRF model to tag each word in the data set 3.
Speci cally, we submit six runs based on two methods, where the description for
each method is as follows.</p>
      <p>{ Method A: We use rules mainly based on regular expressions to extract
information of bed number, room number age and doctor's name. Then, we
use all features provided to run CRF model and obtain label for each word.
Finally, we combine the result achieved by CRF model with result obtained
by the association rules.
{ Method B: We use the method, which is detailed in section 2.1, to select the
best suitable feature set for di erent label among the features provided by
the organizers. Then, we train the CRF model based on those feature sets.
At last, we use the method of voting to determine the label for each word.
We also use association rules to extract information of bed number, room
number, age and doctor's name. The nal submission is the combination of
results obtained by the association rules and the voting methods.</p>
      <p>The primary evaluation measure of this year is the macro-precision(MaAPrec),
macro- recall(MaARec), macro-F1(MaAF1), micro-precision(MiAPrec),
microrecall(MiARec), micro-F1(MiAF1), precision of NA tag(NA-Prec), recall of NA
tag(NA-Recall), F1 value of NA tag(NA-F1). Data set 1 is used for training.
Data set 2 is used for validation and data set 3 is designed for test. Evaluation
of our methods over the data set 1, 2 and 3 is summarized in Table 3, where A
and B imply our method A and method B respectively.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions and Future Work</title>
      <p>In 2016 CLEF eHealth task 1, we propose an optimized CRF model and utilize
the association rules and MetaMap tag to achieve the better performance for the
handover form automatically lling. All of our submissions outperform the four
baseline methods. In the future, we will continue on the research of handover
form automatically lling methods.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgement</title>
      <p>This research is funded by National Key Technology Support Program (No.
2015BAH12F01-04) and Science and Technology Commission of Shanghai
Municipality (No.14DZ1101700). We also thank anonymous reviewers for their
review comments on this paper.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Kelly</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suominen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nvol</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palotti</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zuccon</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Overview of the CLEF eHealth Evaluation Lab 2016</article-title>
          .
          <source>CLEF 2016 - 7th Conference and Labs of the Evaluation Forum, Lecture Notes in Computer Science (LNCS)</source>
          , Springer, September,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Suominen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kelly</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Task 1 of the CLEF eHealth evaluation lab 2016: Handover information extraction</article-title>
          .
          <article-title>CLEF 2016 Evaluation Labs</article-title>
          and Workshop: Online Working Notes, CEUR-WS,
          <year>September</year>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. http://www.nicta.com.
          <article-title>au/nicta-synthetic-nursing-handover-open-software/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>4. http://www.nicta.com.au/open-data/</mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Suominen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hanlen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferraro</surname>
          </string-name>
          , G.:
          <article-title>Benchmarking Clinical Speech Recognition and Information Extraction: New Data, Methods, and</article-title>
          <string-name>
            <surname>Evaluations.</surname>
          </string-name>
          "
          <source>JMIR Medical Informatics 3.2</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>La</surname>
            <given-names>erty</given-names>
          </string-name>
          , J.,
          <string-name>
            <surname>Andrew</surname>
            <given-names>M.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Fernando</surname>
            <given-names>C.P.</given-names>
          </string-name>
          : Conditional Random Fields:
          <article-title>Probabilistic Models for Segmenting and Labeling Sequence data</article-title>
          . (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Sha</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pereira</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Shallow Parsing with Conditional Random Fields</article-title>
          .
          <source>In: Proceedings of the 2003 Conference of the North American Chapter of Association for Computational Linguistics on Human Language Technology</source>
          , Vol.
          <volume>1</volume>
          (
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Bing</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wynne</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yiming</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Integrating classi cation and association rule mining</article-title>
          .
          <source>Proceedings of the fourth international conference on knowledge discovery and data mining</source>
          . (
          <year>1998</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Vaidya</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chris</surname>
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Privacy preserving association rule mining in vertically partitioned data. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining</article-title>
          .
          <source>ACM</source>
          , (
          <year>2002</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>