Recurrent neural networks with specialized word embeddings for health-domain named-entity recognition

06/29/2017
by   Inigo Jauregi Unanue, et al.
0

Background. Previous state-of-the-art systems on Drug Name Recognition (DNR) and Clinical Concept Extraction (CCE) have focused on a combination of text "feature engineering" and conventional machine learning algorithms such as conditional random fields and support vector machines. However, developing good features is inherently heavily time-consuming. Conversely, more modern machine learning approaches such as recurrent neural networks (RNNs) have proved capable of automatically learning effective features from either random assignments or automated word "embeddings". Objectives. (i) To create a highly accurate DNR and CCE system that avoids conventional, time-consuming feature engineering. (ii) To create richer, more specialized word embeddings by using health domain datasets such as MIMIC-III. (iii) To evaluate our systems over three contemporary datasets. Methods. Two deep learning methods, namely the Bidirectional LSTM and the Bidirectional LSTM-CRF, are evaluated. A CRF model is set as the baseline to compare the deep learning systems to a traditional machine learning approach. The same features are used for all the models. Results. We have obtained the best results with the Bidirectional LSTM-CRF model, which has outperformed all previously proposed systems. The specialized embeddings have helped to cover unusual words in DDI-DrugBank and DDI-MedLine, but not in the 2010 i2b2/VA IRB Revision dataset. Conclusion. We present a state-of-the-art system for DNR and CCE. Automated word embeddings has allowed us to avoid costly feature engineering and achieve higher accuracy. Nevertheless, the embeddings need to be retrained over datasets that are adequate for the domain, in order to adequately cover the domain-specific vocabulary.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/23/2019

GNTeam at 2018 n2c2: Feature-augmented BiLSTM-CRF for drug-related entity recognition in hospital discharge summaries

Monitoring the administration of drugs and adverse drug reactions are ke...
11/25/2016

Bidirectional LSTM-CRF for Clinical Concept Extraction

Automated extraction of concepts from patient clinical records is an ess...
05/20/2021

TF-IDF vs Word Embeddings for Morbidity Identification in Clinical Notes: An Initial Study

Today, we are seeing an ever-increasing number of clinical notes that co...
06/25/2016

Bidirectional Recurrent Neural Networks for Medical Event Detection in Electronic Health Records

Sequence labeling for extraction of medical events and their attributes ...
09/18/2019

Corporate IT-support Help-Desk Process Hybrid-Automation Solution with Machine Learning Approach

Comprehensive IT support teams in large scale organizations require more...
11/26/2015

Named Entity Recognition with Bidirectional LSTM-CNNs

Named entity recognition is a challenging task that has traditionally re...
10/08/2019

When Specialization Helps: Using Pooled Contextualized Embeddings to Detect Chemical and Biomedical Entities in Spanish

The recognition of pharmacological substances, compounds and proteins is...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

In recent years, the amount of digital information generated from all sectors of society has increased rapidly, and as a result, agriculture, industry, small businesses and, of course, healthcare, are becoming more efficient and productive thanks to the insights obtained from the “Big Data”. However, in order to deal effectively with such large data, there is an ongoing need for novel, scalable and more accurate analytic tools.

Figure 1: (a) DNR and (b) CCE tasks examples, where ‘B’ (beginning) specifies the start of a named entity, ‘I’ (inside) specifies that the word is part of the same named entity, and ‘O’ (outside) specifies that the word is not part of any predefined class

In the healthcare system, patients’ medical records represent a big data source. Even though the records contain very useful information about the patients, in most cases the information consists of unstructured text such as, among others, doctors’ notes, medical observations made by various physicians, and descriptions of the recommended treatments. This type of data cannot be analyzed using common statistical tools; rather, they need to be approached by Natural Language Processing (NLP) techniques. In this paper, we focus on a well-known task in NLP, namely Named-Entity Recognition (NER). The goal of NER is to automatically find “named entities” in text and classify them into predefined categories such as people, locations, companies, time expressions etc. In the case of specialized domains, NER systems focus on text with specific dictionaries and topics, together with dedicated sets of named-entities. In the health domain, the two most important NER tasks are Clinical Concept Extraction (CCE) and Drug Name Recognition (DNR). The former aims to identify mentions of clinical concepts in patients’ records to help improve the organization and management of healthcare services. Named entities in CCE can include test names, treatments, problems related to individual patients, and so forth. The latter seeks to find drug mentions in unstructured biomedical texts to match drug names with their effects and discover drug-drug interactions (DDIs). DNR is a key step of pharmacovigilance (PV) which is concerned with the detection and understanding of adverse effects of drugs and other drug-related problems. Figure

1 shows examples of both tasks.

NER is a challenging learning problem because in most domains the training datasets are scarce, preventing a “brute-force” approach by exhaustive dictionaries. Consequently, many systems rely on hand-crafted rules and language-specific knowledge to solve this task. To give a simple example of such rules, if the word begins with a capital letter in the middle of the sentence, it can be assumed to be a named entity in most cases. Nevertheless, these approaches are time-costly to develop, depend considerably on the language and the domain, are ineffective in the presence of informal sentences and abbreviations and, although they usually achieve high precision, suffer from low recall (i.e., they miss many entities). Conversely, machine learning (ML) approaches overcome all these limitations as they are intrinsically robust to variations. Current state-of-the-art ML methods follow a two-step process: 1) feature engineering and 2) automated classification segura2015exploring; abacha2015text; rocktaschel2013wbi; de2011machine. The first step represents the text by numeric vectors using domain-specific knowledge. The second step refers to the task of classifying each word into a different named-entity class, with popular choices for the classifier being the linear-chain Conditional Random Fields (CRF), Structural Support Vector Machines (S-SVM) and maximum-entropy classifiers. The drawback of this approach is that feature engineering can be often as time-consuming as the manual design of rules.

In recent years, the advent of deep learning has contributed to significantly overcome this problem lample2016neural; hinton2012deep; krizhevsky2012imagenet

. The Long Short-Term Memory (LSTM) and its variants (e.g., the Bidirectional LSTM), which are a specific type of Recurrent Neural Networks (RNNs), have reported very promising results

lample2016neural. In these models, words only need to be assigned to random vectors, and during training the neural network is able to automatically learn improved representations for them, completely bypassing feature engineering. In order to further increase the performance of these systems, the input vectors can alternatively be assigned with general-purpose word embeddings learned with GloVe or Word2vec pennington2014glove; mikolov2013distributed. The aim of general-purpose word embeddings is to map every word in a dictionary to a numerical vector (the embedding) so that the distance between the vectors somehow reflects the semantic difference between the words. For example, ‘cat’ and ‘dog’ should be closer in the vector space than ‘cat’ and ‘car’. The common principle behind embedding approaches is that the meaning of a word is conveyed by the words it is used with (its surrounding words, or context). Therefore, the training of the word embeddings only requires large, general-purpose text corpora such as Wikipedia (400K unique words) or Common Crawl (2.2M unique words), without the need for any manual annotation. However, drug and clinical concept recognition are very domain-specific tasks, and many words might not appear in general-domain datasets. In order to assign word embeddings to these specialized words, the embedding algorithms need to be retrained using medical domain resources such as the MIMIC-III corpora johnson2016mimic. As well as semantic word embeddings, character-level embeddings of words can also be automatically learned. Such embeddings can capture typical prefixes and suffixes, providing the classifiers with richer representations of the words lample2016neural.

Preliminary results for the work presented in this paper have obtained very promising accuracy in DNR and CCE tasks using neural networks. Chalapathy et al. chalapathy2016investigation presented a DNR system that uses a Bidirectional LSTM-CRF architecture with random assignments of the input word vectors at the EMNLP 2016 Health Text Mining and Information Analysis workshop. The reported results were very close to the system that ranked first in the SemEval-2013 Task 9.1. In Chalapathy et al. chalapathy2016bidirectional, the authors leveraged the same architecture for CCE at the Clinical NLP 2016 workshop, this time using pre-trained word embeddings from GloVe, and the results outperformed previous systems over the 2010 i2b2/VA IRB Review dataset. In this paper, we extend the previous research by training the deep networks with more complex and specialized word embeddings. Moreover, we explore the impact of augmenting the word embeddings with conventional feature engineering. As methods, we compare contemporary recurrent neural networks such as the Bidirectional LSTM and the Bidirectional LSTM-CRF against a conventional ML baseline (a CRF). We report state-of-the-art results in both DNR and CCE.

2 Related work

Most of the research carried out in domain-specific NER has combined supervised and semi-supervised ML models with text feature engineering. For example, the WBI-NER system that ranked first in the SemEval-2013 Task 9.1 (Recognition and classification of pharmacological substances, DNR) rocktaschel2013wbi, is based on a linear-chain CRF with specialized features. Other similar systems for DNR abacha2015text; liu2015feature use various general- and domain-specific features. In CCE, the same approach (feature engineering + conventional ML classifier) has achieved the best results de2011machine; boag2015cliner.

In the recent years, there has been an increase in the use of deep neural networks for a variety of NLP tasks, including NER lample2016neural; hinton2012deep; krizhevsky2012imagenet. Pre-trained word embeddings pennington2014glove; mikolov2013distributed; lebret2013word have been used in traditional ML methods nikfarjam2015pharmacovigilance; wu2015study and in neural networks, where Deconourt et al. dernoncourt2017identification has achieved better performance than previously published systems in de-identification of patient notes. Cocos et al. cocos2017deep have used the Bidirectional LSTM model for labelling Adverse Drug Reactions in pharmacovigilance. Xie et al. xie2017mining have used a similar model for studying the adverse effects of e-cigarettes. Wei et al. wei2016disease have combined the output of a Bidirectional LSTM and a CRF as input to an SVM classifier for disease name recognition. A possible drawback of this approach is that the overall prediction is not structured and may miss on useful correlation between the output variables.

In a work that is more related to ours, Jaganatha and Yu jagannatha2016structured

have employed a Bidirectional LSTM-CRF to label named entities from electronic health records of cancer patients. Their model differs in the CRF output module where the pairwise potentials are modelled using a Convolutional Neural Network (CNN) rather than the usual transition matrix. Gridach

gridach2017character has also used the Bidirectional LSTM-CRF for named-entity recognition in the biomedical domain.

The main difference and contribution of the proposed approach is that it leverages specialized health-domain embeddings created from a structured database. In the experiments, these embeddings have been used jointly with general-domain embeddings and they have proved able to improve the accuracy in several cases. In addition, our work evaluates the use of hand-crafted features in the system lee2016feature. This aims to provide a comprehensive feature comparison for health-domain named-entity recognition based on LSTM models.

3 Methods

In this section we provide a description of the main methods employed. First, we describe the conditional random field (CRF), a traditional machine learning approach for the classification of sequences, which is used as a baseline in the experiments. This baseline is compared with two variants of a contemporary recurrent neural network, which are known as Bidirectional LSTM and Bidirectional LSTM-CRF, respectively.

Figure 2: The Bidirectional LSTM-CRF with word-level and character-level word embeddings. In the example, word ‘sulfate’ is assumed to be the 5th word in a sentence and its only entity; ‘x_5’ represents its word-level embedding (a single embedding for the whole word); ‘x_5^*’ represents its character-level embedding, formed from the concatenation of the last hidden state of the forward and backward passes of a character-level Bidirectional LSTM; ’h_1–5’ are the hidden states of the main Bidirectional LSTM which become the inputs into a final CRF; eventually, the CRF provides the labeling.

3.1 Crf

A CRF model is a well-known ML approach that has been widely used in NER lafferty2001conditional. It predicts sequences of labels (y) from sequences of measurements (x) taking into account the sequentiality of the data. In a CRF model, is given in Eq. 1 below, where w notes the model’s parameters, is the chosen feature vector and is the cumulative sum of over all the possible y:

(1)

The parameters of this model are typically learned from a training set, , , with conditional maximum likelihood as in:

(2)

Once the model has been trained, the prediction of a CRF is the sequence of labels maximizing the model for the given input sequence and the learned parameters:

(3)

The labels are typically predicted using a Viterbi-style algorithm which provides the optimal prediction for the measurement sequence as a whole. The model is trained by maximizing the conditional likelihood, or cross-entropy, over a given training set. For its implementation, we have used the HCRF library HCRF. The features used as input are described in Section 4. In the experiments, we use the CRF as a useful baseline for performance comparison with the proposed neural networks. Note that a CRF model is also used as the output layer in the Bidirectional LSTM-CRF as explained in the next section.

3.2 Bidirectional LSTM and bidirectional LSTM-CRF

RNNs are a type of neural network architecture in which connections between units form a directed cycle, creating an internal state and achieving dynamic temporal behavior. Thanks to their internal memory, RNNs can process a sequence of vectors as input and produce another sequence as output that contains some extent of sequential information about every vector in the input. However, these architectures in practice fail to learn long-term dependencies in the sequences as they tend to be biased by the most recent vectors bengio1994learning. The Long Short-Term Memory (LSTM) was therefore designed to overcome this issue by incorporating a gated memory-cell that has been shown to capture long-term dependencies hochreiter1997long. Eq. 4 shows the implementations of the different gates in the LSTM lample2016neural, where is the “input” gate, is the “cell” gate, is the “output” gate, W are the weights of the network, b are the biases,

is the element-wise sigmoid function, and

is the element-wise product. The bidirectional LSTM (B-LSTM) is just a variation, in which both the left-to-right and the right-to-left representations of the input sentence are generated, and then concatenated in order to obtain the final representation.

(4)

When applying the LSTM in NER, the words in the input sentence are first mapped to numerical vectors. These vectors can be random valued, a pre-trained word embedding, domain-specific word features or any combination of them. For each vector, the output of the network are the posterior probabilities of each named-entity class. An improvement of these networks has been presented by Lample et al.

lample2016neural using a CRF as a final output layer. This final layer provides the system with the ability to perform joint decoding of the input sequence in a Viterbi-style manner. The resulting network is known as the Bidirectional LSTM-CRF (B-LSTM-CRF). We test the LSTM models with the same features used for the CRF in order to establish the fairest-possible comparison. The features are described in detail in Section 4. Fig.2 shows a descriptive diagram of the B-LSTM-CRF.

4 Word features

As mentioned above, neural networks can learn meaningful representations from random inizializations of word embeddings. However, it has been proved that pre-trained word embeddings can improve the performance of the network lample2016neural; chalapathy2016bidirectional; dernoncourt2017identification; lee2016feature. In this section, we present the pre-trained embeddings employed in lieu of the random assignments.

4.1 Specialized word embeddings

A word embedding maps a word to a numerical vector in a vector space, where semantically-similar words are expected to be assigned similar vectors. To perform this mapping, we have used a well-known algorithm called GloVe pennington2014glove. This algorithm learns word embeddings by looking at the co-occurrences of the word in the training data, assuming that a word’s meaning is mostly defined by its context and, therefore, words having similar contexts should have similar embeddings. GloVe can be trained from large, general-purpose datasets such as Wikipedia, Gigaword5 or Common Crawl without the need for any manual supervision. In this work, we have experimented with different general-purpose, pre-trained word embeddings from the official GloVe website GloVe

and noticed that the embeddings trained with Common Crawl (cc) (2.2M unique words) were giving the best results. We have employed these embeddings on their own, and also concatenated with the MIMICIII embeddings (cc/mimic) (described in the next paragraph). By default, the code always initializes the word embedding of each unique word in the dictionary with a unique random vector. In alternative, we replace the random initialization with a pre-trained embedding. However, although such datasets generate good embeddings in many cases, for domain-specific tasks such as DNR and CCE they can suffer from some lack of vocabulary. As a matter of fact, in health corpora it is common to find very technical and unusual words which are specific to the health domain. If GloVe is trained only with general-purpose datasets, it is likely that such words will be missing and will still have to be assigned with random vectors. In all cases, the embeddings are updated during training by the backpropagation step.

In order to solve this problem, we have generated a new word embedding by re-training GloVe with a large health domain dataset called MIMIC-III johnson2016mimic. This dataset contains records of 53,423 distinct hospital admissions of adults to an intensive care unit between 2001 and 2012. The data, structured in 26 tables, include information such as vital signs, observations of care providers, diagnostic codes etc. We expect such a dataset to contain many of the technical words from the health domain that may not appear in general-domain datasets, and as the size of MIMIC-III is sufficiently large, we should be able to extract meaningful vector representations for these words. As a first step, we have selected a subset of the tables and columns, and generated a new dataset where each selected cell together with the title of the corresponding column form a pseudo-sentence. As the next step, we have used this dataset to re-train GloVe, and concatenated these specialized word embeddings with the others to create vectors that contain information from both approaches. Obviously, there are words that appear in the general dataset, but not in MIMIC-III, and the vice versa. In such cases, the corresponding embedding is still assigned randomly. If a word does not appear in either dataset, we assign its whole embedding randomly.

4.2 Character-level embeddings

Following Lample et al. lample2016neural we also add character-level embeddings of the words. Such embeddings reflect the actual sequence of characters of a word and have proven to be useful for specific-domain tasks and morphologically-rich languages. Typically, they contribute to catching prefixes and suffixes which are frequent in the domain, and correctly classifying the corresponding words. As an example, a word ending in “cycline” is very likely a drug name, and a character-level embedding could help classify it correctly even if the word was not present in the training vocabulary. All the characters are initialized with a random embedding, and then the embeddings are passed character-by-character to a dedicated LSTM in both forward and backward order. The final outputs in the respective directions promise to be useful encodings of the ending and the beginning of the word. These character-level embeddings are integral part of the LSTM architecture and are not available in the CRF or other models. The character embeddings, too, are updated during training with backpropagation.

4.3 Feature augmentation

Figure 3: Description of the hand-crafted features.
Figure 4: a) An example of an incorrect tagging in the “strict” evaluation method. b) An example of a correct tagging in the “strict” evaluation method

Conventional machine learning approaches for NER usually have a feature engineering step. Lee et al. lee2016feature have shown that adding hand-crafted features to a neural network can contribute to increase the recall. In our work, we try this approach with features similar to those used by Lee et al. lee2016feature. Fig.3 shows the list of features used. The distinct values of each feature are encoded onto short random vectors, for a total dimension of 146-D. During training, these encodings are updated as part of the backpropagation step.

5 Results

5.1 Datasets

Hereafter, we evaluate the models on three datasets in the health domain. The first is the 2010 i2b2/VA IRB Revision (we refer to it as i2b2/VA for short in the following) and is used for evaluating CCE. This dataset is a reduced set of the original 2010 i2b2/VA dataset that is no longer distributed due to restrictions introduced by the Institutional Review Board (IRB) in 2011 uzuner20112010. The other two datasets are DDI-DrugBank and DDI-MedLine, both part of the SemEval-2013 Task 9.1 for DNR herrero2013ddi. Tables 0(a) and 0(b) describe the basic statistics of the datasets. For the experiments, we have used the official training and test splits released with the distributions.

Training Test
Documents 170 256
Sentences 16315 27626
problem 7073 12592
test 4608 9225
treatment 4844 9344
(a) i2b2/VA
DrugBank MedLine
Training Test Training Test
Documents 730 54 175 58
Sentences 6577 145 1627 520
drug_n 124 6 520 115
group 3832 65 234 90
brand 1770 53 36 6
drug 9715 180 1574 171
(b) DrugBank and MedLine
Table 1: Statistics of the training and test datasets used in the experiments

5.2 Evaluation metrics

We report the performance of the model in terms of the F1-score. The F1-score is a very relevant measure as it considers both the precision and the recall, computing a weighted average of them. If we note as TP the number of true positives, FP the false positives and FN the false negatives, we have:

(5)

However, it must be remarked that there are different ways of computing the precision and the recall, depending on what we consider as a correct or incorrect prediction nadeau2007survey. In this work, we employ the “strict” evaluation method, where both the entity class and its exact boundaries are expected to be correct. We have used the B-I-O tagging standard to annotate the text at word level. In detail, ‘B’ means the beginning (first word) of a named entity; ‘I’ stands for ‘inside’, meaning that the word is part of the same entity (for multi-word entities; e.g., “albuterol sulfate”); and ‘O’ stands for ‘outside’, meaning that the word is not part of any named entities. Therefore, a valid annotation of a named entity always begins with a ‘B’. An example is shown in Fig.4. All the models used in this paper have been trained to predict explicit ‘B’ and ‘I’ labels for each entity class. The evaluation includes a preprocessing step that converts an ‘I’ prediction to a ‘B’ if it follows directly an ‘O’ prediction, thus making all predicted entities valid. An entity is considered as correctly predicted only if all its ‘B’ and ‘I’ labels and all its classes are predicted correctly. In the example of Fig.4 the prediction will be counted as a true positive only if all the four words “recently diagnosed abdominal carcinomatosis” are tagged as a single entity of the problem class. Every differing ‘B’ prediction will instead be counted as a false positive. The evaluation protocol explicitly counts only the true positives and the false positives, and derives the false negatives as (number of true entities – true positives).

5.3 Training and hyperparameters

For an unbiased evaluation, all the trained models have been tested blindly on unseen test data. In order to facilitate replication of the empirical results, we have used a publicly-available library for the implementation of the neural networks (i.e. the Theano neural network toolkit

bergstra2010theano) and we release our code.111HealthNER: https://github.com/ijauregiCMCRC/healthNER

To operate, any machine learning model requires both a set of parameters, which are learned automatically during training, and some “hyper-parameters”, which have to be selected manually. Therefore, we have divided the training set of each dataset into two parts: a training set for learning the parameters (70%), and a validation set (30%) for selecting the best hyperparameters

bergstra2012random. The hyper-parameters of the LSTM include the number of hidden nodes (for both LSTM versions), ; the word embedding dimension, ; and the character embedding dimension, . Additional hyper-parameters include the learning rate and the drop-out rate, which were left to their default values of and respectively srivastava2014dropout

. All weights in the network, feature encodings and the words that do not have a pre-trained word embedding have been initialized randomly from the uniform distribution within range [−1, 1], and updated during training with backpropagation. The number of training ”epochs” (i.e., iterations) was set to 100, selecting the epoch that obtained the best results on the validation set. The best model from the validation set was finally tested on the unseen, independent test set without any further tuning, and the corresponding accuracy reported in the tables. Table

2 shows all the hyper-parameters used for the experiments reported in the Results section.

Hyper-parameter Value
Word embedding dim () 300 (cc) or
600 (cc/mimic)
Word LSTM hidden layer dim () 100
Char embedding dim () 25
Char LSTM hidden layer dim () 25
Dropout 0.5
Optimization Stochastic
Gradient Descend
Learning rate 0.01
Concatenated hand-crafted features dim 146
Table 2: The hyper-parameters used in the experiments
Model F1-score (%)
Binarized Neural Embedding CRF wu2015study 82.80
CliNER boag2015cliner 80.00
Truecasing CRFSuite fu2014improving 75.86
CRF + (random) 11.27
CRF + (features) 25.53
CRF + (cc) 53.72
CRF + (cc/mimic) 58.28
CRF + (cc/mimic) + (features) 64.09
B-LSTM + (random) 65.43
B-LSTM + (random) + (features) 69.49
B-LSTM + (cc) 75.17
B-LSTM + (cc) + (char) 76.79
B-LSTM + (cc/mimic) + (char) 77.19
B-LSTM + (cc/mimic) + (char) + (features) 77.59
B-LSTM-CRF + (random) 75.05
B-LSTM-CRF + (random) + (features) 77.81
B-LSTM-CRF + (cc) 82.85
B-LSTM-CRF + (cc) + (char) 83.35
B-LSTM-CRF + (cc/mimic) + (char) 82.70
B-LSTM-CRF + (cc/mimic) + (char) + (features) 83.29
(a) CCE results over the i2b2/VA dataset
Model DrugBank MedLine
F1(%) F1(%)
WBI-NER rocktaschel2013wbi 87.80 58.10
Hybrid-DDI abacha2015text 80.00 37.00
Word2Vec+DINTO segura2015exploring 75.00 57.00
CRF + (random) 28.70 13.65
CRF + (features) 44.52 20.19
CRF + (cc) 43.42 32.62
CRF + (cc/mimic) 53.12 30.87
CRF + (cc/mimic) + (features) 66.45 29.36
B-LSTM + (random) 65.09 21.28
B-LSTM + (random) + (features) 75.43 30.88
B-LSTM+(cc) 71.75 42.39
B-LSTM+(cc) + (char) 84.35 43.33
B-LSTM + (cc/mimic) + (char) 83.63 44.39
B-LSTM + (cc/mimic) + (char) + (features) 84.06 45.92
B-LSTM-CRF + (random) 69.50 44.60
B-LSTM-CRF + (random) + (features) 75.78 43.36
B-LSTM-CRF + (cc) 79.03 57.87
B-LSTM-CRF + (cc) + (char) 87.87 59.02
B-LSTM-CRF + (cc/mimic) + (char) 88.38 60.66
B-LSTM-CRF + (cc/mimic) + (char) + (features) 87.42 59.75
(b) DNR results over the DrugBank and MedLine datasets
Table 3: Comparison of the results between the different RNN models and the state-of-the-art systems over the CNE and DNR tasks

5.4 Results

Table 2(a) and 2(b) shows the results of the proposed models and the state-of-the-art systems on the CCE task (i2b2/VA dataset) and DNR task (DrugBank and MedLine datasets), respectively. In the following subsections, we discuss the results obtained for each task.

5.4.1 CCE results over the i2b2/VA dataset

On the i2b2/VA dataset (Table 2(a)), the Bidirectional LSTM-CRF (B-LSTM-CRF) with Common Crawl embeddings (cc) and character-level embeddings (char) as features has obtained the best results (83.35% F1-score). The model has outperformed all systems from the literature (top quadrant of Table 2(a)) which are all based on conventional domain-specific feature engineering. It is important to note that deBruijin et al. de2011machine had reported a higher accuracy on 2010 i2b2/VA (85.23% F1-score), but their model was trained and tested on the original version of the dataset which is no longer available due to the restrictions introduced by the Institutional Review Board. As for what specialized embeddings are concerned, Table 4 shows that the general-domain dataset Common Crawl already contains almost all the words in the dataset. Therefore, adding the MIMIC-III embeddings (mimic) does not extend the vocabulary, and it brings no improvement. On the other hand, the B-LSTM has improved by 0.3 pp with the cc/mimic embeddings. Even though the mimic embeddings do not cover significant extra vocabulary, they may have enriched the feature space. Conversely, the cc/mimic embeddings have provided no improvements with the B-LSTM-CRF. For this, we need to take into account that the BLSTM-CRF already has a high score (83.35% F1-score). Consequently, it may be more difficult to improve its results. Using conventional feature engineering has led to lower accuracy (77.81% F1-score). Eventually, concatenating both the features and the pre-trained embeddings showed no improvement over the best model. Table 2(a) also shows the importance of using a final CRF layer in the B-LSTM-CRF, given that the B-LSTM alone was only able to achieve a 77.59% F1 score. At its turn, the CRF baseline has only obtained a 64.09% F1 score in its best configuration, lower than any version of the LSTM.

5.4.2 DNR results over the DrugBank and MedLine datasets

In the DNR task (Table 2(b)), the proposed B-LSTM-CRF with the concatenated word embeddings (cc/mimic) and the character-level embeddings (char) has improved over all the previous approaches on both DrugBank (88.38% F1 score) and MedLine (60.66% F1 score). Table 4 shows that only 49% of the words in the datasets have been found in the cc embeddings. However, when the concatenated embeddings (cc/mimic) are used, the percentage of found words has increased to 67% for DrugBank and 61% for MedLine, leading to better results in the classification task. Words that appear in the MIMIC-III dataset but are not contained in Common Crawl are typically very technical and domain-specific, such as drug names or treatments; examples include: pentostatin, sitagliptin, hydrobromide, organophosphate, pyhisiological and methimazole. In total, 1189 extra words have been mapped in DrugBank and 716 in MedLine thanks to the use of MIMIC-III. However, the B-LSTM has only obtained an accuracy improvement on the MedLine dataset, but not on DrugBank. This can be explained by the fact that the accuracy of the B-LSTM on MedLine is very low (44.33%) and, therefore, easy to improve. Instead, on DrugBank the accuracy of the B-LSTM is already very high (84.35% F1-score) and thus difficult to improve. With the B-LSTM-CRF, results with extra vocabulary covered by the cc/mimic embeddings have improved with both datasets.

As for what concerns the hand-crafted features, their use has led to higher accuracy than with the Common Crawl embeddings on the DrugBank dataset in two cases. However, the concatenation of the features and the pre-trained embeddings has not improved the best results. As in the CCE task, the B-LSTM-CRF model has proved better than the B-LSTM alone on both DrugBank (88.38% vs 84.35% F1-score) and MedLine (60.66% vs 45.92% F1-score.) Finally, we can see that the use of the character-level embeddings has led to higher relative improvements for DrugBank than for the other two datasets. A plausible explanation for this is that this dataset contains more words with distinctive prefixes and suffixes which are more effectively captured by the character-level embeddings.

In general, the CRF has significantly underperformed compared to the neural networks. We speculate that this model may require more extensive feature engineering to achieve a comparable performance, or that it may not be able to achieve it at all. In particular, we see that the CRF has performed the worst with MedLine

. A possible explanation can be found in the “curse of dimensionality”:

MedLine is a small dataset (1627 training sentences), while the overall dimensionality of the input embeddings is 746. This makes the learning problem very sparse and seems to seriously affect a linear model such as the CRF. On the contrary, the non-linear internal architecture of the neural networks may in some cases help reduce the effective dimensionality and mollify this problem.

Common Crawl Common Crawl
+ MIMIC-III
(cc) (cc+mimic)
i2b2/VA 99.99 % 99.99 %
DrugBank 49.50 % 67.02 %
MedLine 49.10 % 61.51 %
Table 4: Percentage of words assigned with pre-trained embeddings in the train, dev and test of the respective datasets
Entity Precision Recall F1-score
B-LSTM-CRF+(cc)+(char) problem 81.29 83.62 82.44
test 84.74 85.01 84.87
treatment 83.36 83.55 83.46
(a) i2b2/VA
Entity DrugBank MedLine
Precision Recall F1-score Precision Recall F1-score
B-LSTM-CRF group 81.69 87.88 84.67 69.14 60.22 64.37
drug 94.77 89.56 91.83 73.89 77.33 75.57
+(cc+mimic) brand 84.21 90.57 87.27 100.00 16.67 28.57
+(char) drug_n 00.00 00.00 00.00 68.18 25.57 37.19
(b) DrugBank and MedLine
Table 5: Results by class for the B-LSTM-CRF with character-level and cc/mimic embeddings

5.4.3 DNR results over the DrugBank and MedLine datasets

Table 4(a) and 4(b) break down the results by entity class for the best model on each dataset. With the MedLine dataset, we can notice the poor performance at detecting brand. In DrugBank, the same issue occurs with entity class drug_n. This issue is likely attributable to the small sample size. Instead, the i2b2/VA dataset all entity classes are detected with similar F1-scores, likely owing to the larger number of samples per class. However, we see that brand achieves the second best F1-score in DrugBank despite its relatively low frequency in the dataset, and that drug_n obtains a very poor performance in MedLine even if it has the second highest frequency. We identify two other main factors that may have a major impact on the accuracy: (1) the average length of the entities in each class, and (2) the number of test entities that had not been seen during the training stage. In this respect, the brand and drug entities are usually very short (average 1 word), while the group and drug_n entities often have multiple words. Since shorter entities are easier to predict correctly, brand obtains better accuracy than group in DrugBank. On the other hand, the drug_n and group entities have similar length, but in MedLine drug_n obtains a very poor performance. This is most likely because no entity of type drug_n that appears in the test set had been seen during training. Conversely, a large percentage of the test group entities had been seen during training and have therefore proved easier to predict.

6 Conclusion

In this paper, we have set to investigate the effectiveness of the Bidirectional LSTM and Bidirectional LSTM-CRF –two specific architectures of recurrent neural networks– for drug name recognition and clinical concept extraction, and compared them with a baseline CRF model. As input features, we have applied combinations of different word embeddings (Common Crawl and MIMIC-III), character-level embedding and conventional feature engineering. We have showed that the neural network models have obtained significantly better results than the CRF, and reported state-of-the-art results over the i2b2/VA, DrugBank and MedLine datasets using the B-LSTM-CRF model. We have also provided evidence that retraining GloVe on a domain-specific dataset such as MIMIC-III can help learn vector representations for domain-specific words and increase the classification accuracy. Finally, we have showed that adding hand-crafted features does not further improve performance since the neural networks can learn useful word representations automatically from pre-trained word embeddings. Consequently, time-consuming, domain-specific feature engineering can be usefully avoided.

References