DOCSLIB.ORG

Accelerated Estimation of Conditional Random Fields Using a Pseudo-Likelihood-Inspired Perceptron Variant

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Accelerated Estimation of Conditional Random Fields Using a Pseudo-Likelihood-Inspired Perceptron Variant Accelerated Estimation of Conditional Random Fields using a Pseudo-Likelihood-inspired Perceptron Variant Teemu Ruokolainena Miikka Silfverbergb Mikko Kurimoa Krister Lindénb a Department of Signal Processing and Acoustics, Aalto University, firstname.lastname@aalto.fi b Department of Modern Languages, University of Helsinki, firstname.lastname@helsinki.fi Abstract quired by the stochastic gradient descent algo- rithm employed in ML estimation (Vishwanathan We discuss a simple estimation approach et al., 2006). Additionally, while ML and percep- for conditional random fields (CRFs). The tron training share an identical time complexity, approach is derived heuristically by defin- the perceptron is in practice faster due to sparser ing a variant of the classic perceptron al- parameter updates. gorithm in spirit of pseudo-likelihood for Despite its simplicity, running the perceptron al- maximum likelihood estimation. The re- gorithm can be tedious in case the data contains sulting approximative algorithm has a lin- a large number of labels. Previously, this prob- ear time complexity in the size of the la- lem has been addressed using, for example, k-best bel set and contains a minimal amount of beam search (Collins and Roark, 2004; Zhang and tunable hyper-parameters. Consequently, Clark, 2011; Huang et al., 2012) and paralleliza- the algorithm is suitable for learning CRF- tion (McDonald et al., 2010). In this work, we based part-of-speech (POS) taggers in explore an alternative strategy, in which we mod- presence of large POS label sets. We ify the perceptron algorithm in spirit of the classic present experiments on five languages. pseudo-likelihood approximation for ML estima- Despite its heuristic nature, the algorithm tion (Besag, 1975). The resulting novel algorithm provides surprisingly competetive accura- has linear complexity w.r.t. the label set size and cies and running times against reference contains only a single hyper-parameter, namely, methods. the number of passes taken over the training data set. 1 Introduction We evaluate the algorithm, referred to as the The conditional random field (CRF) model (Laf- pseudo-perceptron, empirically in POS tagging ferty et al., 2001) has been successfully applied on five languages. The results suggest that the to several sequence labeling tasks in natural lan- approach can yield competitive accuracy com- guage processing, including part-of-speech (POS) pared to perceptron training accelerated using a tagging. In this work, we discuss accelerating the violation-fixed 1-best beam search (Collins and CRF model estimation in presence of a large num- Roark, 2004; Huang et al., 2012) which also pro- ber of labels, say, hundreds or thousands. Large la- vides a linear time complexity in label set size. bel sets occur in POS tagging of morphologically The rest of the paper is as follows. In Section 2, rich languages (Erjavec, 2010; Haverinen et al., we describe the pseudo-perceptron algorithm and 2013). discuss related work. In Sections 3 and 4, we CRF training is most commonly associated with describe our experiment setup and the results, re- the (conditional) maximum likelihood (ML) crite- spectively. Conclusions on the work are presented rion employed in the original work of Lafferty et in Section 5. al. (2001). In this work, we focus on an alternative training approach using the averaged perceptron 2 Methods algorithm of Collins (2002). While yielding com- petitive accuracy (Collins, 2002; Zhang and Clark, 2.1 Pseudo-Perceptron Algorithm 2011), the perceptron algorithm avoids extensive The (unnormalized) CRF model for input and tuning of hyper-parameters and regularization re- output sequences x = (x1, x2, . , x x ) and | | 74 Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, pages 74–78, Gothenburg, Sweden, April 26-30 2014. c 2014 Association for Computational Linguistics y = (y1, y2, . , y x ), respectively, is written as are decoded in a standard manner using the Viterbi | | search. p (y x; w) exp w Φ(y, x) | ∝ · The appeal of PP is that the time complexity x of search is reduced to O( x ), i.e., linear | | | | × |Y| = exp w φ(yi n, . , yi, x, i) , in the number of labels in the label set. On the · − other hand, we no longer expect the obtained pa- iY=n (1) rameters to necessarily generalize well to test in- where w denotes the model parameter vector, Φ stances.1 Consequently, we consider PP a heuris- the vector-valued global feature extracting func- tic estimation approach motivated by the rather tion, φ the vector-valued local feature extracting well-established success of PL (Korcˇ and Förstner, function, and n the model order. We denote the 2008; Sutton and McCallum, 2009).2 tag set as . The model parameters w are esti- Y Next, we study yet another heuristic pseudo- mated based on training data, and test instances variant of the perceptron algorithm referred to as are decoded using the Viterbi search (Lafferty et the piecewise-pseudo-perceptron (PW-PP). This al., 2001). algorithm is analogous to the piecewise-pseudo- Given the model definition (1), the param- likelihood (PW-PL) approximation presented by eters w can be estimated in a straightforward Sutton and McCallum (2009). In this variant, the manner using the structured perceptron algo- original graph is first split into smaller, possibly rithm (Collins, 2002). The algorithm iterates overlapping subgraphs (pieces). Subsequently, we over the training set a single instance (x, y) at apply the PP approximation to the pieces. We em- a time and updates the parameters according ploy the approach coined factor-as-piece by Sut- (i) (i 1) to the rule w = w − + ∆Φ(x, y, z), where ton and McCallum (2009), in which each piece ∆Φ(x, y, z) for the ith iteration is written as contains n + 1 consecutive variables, where n is ∆Φ(x, y, z) = Φ(x, y) Φ(x, z). The predic- − the CRF model order. tion z is obtained as The PW-PP approach is motivated by the results z = arg max w Φ(x, u) (2) of Sutton and McCallum (2009) who found PW- u (x) · PL to increase stability w.r.t. accuracy compared ∈Y by performing the Viterbi search over to plain PL across tasks. Note that the piecewise (x) = , a product of x copies approximation in itself is not interesting in chain- Y Y × · · · × Y | | of . In case the perceptron algorithm yields structured CRFs, as it results in same time com- Y a small number of incorrect predictions on the plexity as standard estimation. Meanwhile, the training data set, the parameters generalize well PW-PP algorithm has same time complexity as PP. to test instances with a high probability (Collins, 2.2 Related work 2002). The time complexity of the Viterbi search is Previously, impractical running times of percep- O( x n+1). Consequently, running the per- tron learning have been addressed most notably | | × |Y| ceptron algorithm can become tedious if the la- using the k-best beam search method (Collins and bel set cardinality and/or the model order n Roark, 2004; Zhang and Clark, 2011; Huang et |Y| is large. In order to speed up learning, we define al., 2012). Here, we consider the ”greedy” 1-best a variant of the algorithm in the spirit of pseudo- beam search variant most relevant as it shares the likelihood (PL) learning (Besag, 1975). In anal- time complexity of the pseudo search. Therefore, ogy to PL, the key idea of the pseudo-perceptron in the experimental section of this work, we com- (PP) algorithm is to obtain the required predictions pare the PP and 1-best beam search. We are aware of at least two other learning ap- over single variables yi while fixing the remaining variables to their true values. In other words, in- proaches inspired by PL, namely, the pseudo-max stead of using the Viterbi search to find the z as in and piecewise algorithms of Sontag et al. (2010) and Alahari et al. (2010), respectively. Com- (2), we find a z0 for each position i 1.. x as ∈ | | pared to these approaches, the PP algorithm pro- z0 = arg max w Φ(x, u) , (3) vides a simpler estimation tool as it avoids the u (x) · ∈Yi0 1We leave formal treatment to future work. with i0(x) = y1 yi 1 yi+1 2 Y { }×· · ·×{ − }×Y ×{ }× Meanwhile, note that pseudo-likelihood is a consistent y x . Subsequent to training, test instances estimator (Gidas, 1988; Hyvärinen, 2006). · · · × { | |} 75 hyper-parameters involved in the stochastic gradi- lang. train. dev. test tags train. tags ent descent algorithms as well as the regularization eng 38,219 5,527 5,462 45 45 and margin functions inherent to the approaches of rom 5,216 652 652 405 391 est 5,183 648 647 413 408 Alahari et al. (2010) and Sontag et al. (2010). On cze 5,402 675 675 955 908 the other hand, Sontag et al. (2010) show that the fin 5,043 630 630 2,355 2,141 pseudo-max approach achieves consistency given certain assumptions on the data generating func- Table 1: Overview on data. The training (train.), tion. Meanwhile, as discussed in previous section, development (dev.) and test set sizes are given in we consider PP a heuristic and do not provide any sentences. The columns titled tags and train. tags generalization guarantees. To our understanding, correspond to total number of tags in the data set Alahari et al. (2010) do not provide generalization and number of tags in the training set, respectively. guarantees for their algorithm. POS tagging. Our preliminary experiments using 3 Experimental Setup the latest violation updates supported this. Conse- 3.1 Data quently, we employ the early updates. We also provide results using the CRFsuite For a quick overview of the data sets, see Table 1.
Load more

Recommended publications
  • Information Extraction from Electronic Medical Records Using Multitask Recurrent Neural Network with Contextual Word Embedding
    applied sciences Article Information Extraction from Electronic Medical Records Using Multitask Recurrent Neural Network with Contextual Word Embedding Jianliang Yang 1 , Yuenan Liu 1, Minghui Qian 1,*, Chenghua Guan 2 and Xiangfei Yuan 2 1 School of Information Resource Management, Renmin University of China, 59 Zhongguancun Avenue, Beijing 100872, China 2 School of Economics and Resource Management, Beijing Normal University, 19 Xinjiekou Outer Street, Beijing 100875, China * Correspondence: [email protected]; Tel.: +86-139-1031-3638 Received: 13 August 2019; Accepted: 26 August 2019; Published: 4 September 2019 Abstract: Clinical named entity recognition is an essential task for humans to analyze large-scale electronic medical records efficiently. Traditional rule-based solutions need considerable human effort to build rules and dictionaries; machine learning-based solutions need laborious feature engineering. For the moment, deep learning solutions like Long Short-term Memory with Conditional Random Field (LSTM–CRF) achieved considerable performance in many datasets. In this paper, we developed a multitask attention-based bidirectional LSTM–CRF (Att-biLSTM–CRF) model with pretrained Embeddings from Language Models (ELMo) in order to achieve better performance. In the multitask system, an additional task named entity discovery was designed to enhance the model’s perception of unknown entities. Experiments were conducted on the 2010 Informatics for Integrating Biology & the Bedside/Veterans Affairs (I2B2/VA) dataset. Experimental results show that our model outperforms the state-of-the-art solution both on the single model and ensemble model. Our work proposes an approach to improve the recall in the clinical named entity recognition task based on the multitask mechanism.
    [Show full text]
  • A Multitask Bi-Directional RNN Model for Named Entity Recognition On
    Chowdhury et al. BMC Bioinformatics 2018, 19(Suppl 17):499 https://doi.org/10.1186/s12859-018-2467-9 RESEARCH Open Access A multitask bi-directional RNN model for named entity recognition on Chinese electronic medical records Shanta Chowdhury1,XishuangDong1,LijunQian1, Xiangfang Li1*, Yi Guan2, Jinfeng Yang3 and Qiubin Yu4 From The International Conference on Intelligent Biology and Medicine (ICIBM) 2018 Los Angeles, CA, USA. 10-12 June 2018 Abstract Background: Electronic Medical Record (EMR) comprises patients’ medical information gathered by medical stuff for providing better health care. Named Entity Recognition (NER) is a sub-field of information extraction aimed at identifying specific entity terms such as disease, test, symptom, genes etc. NER can be a relief for healthcare providers and medical specialists to extract useful information automatically and avoid unnecessary and unrelated information in EMR. However, limited resources of available EMR pose a great challenge for mining entity terms. Therefore, a multitask bi-directional RNN model is proposed here as a potential solution of data augmentation to enhance NER performance with limited data. Methods: A multitask bi-directional RNN model is proposed for extracting entity terms from Chinese EMR. The proposed model can be divided into a shared layer and a task specific layer. Firstly, vector representation of each word is obtained as a concatenation of word embedding and character embedding. Then Bi-directional RNN is used to extract context information from sentence. After that, all these layers are shared by two different task layers, namely the parts-of-speech tagging task layer and the named entity recognition task layer.
    [Show full text]
  • ML Cheatsheet Documentation
    ML Cheatsheet Documentation Team Sep 02, 2021 Basics 1 Linear Regression 3 2 Gradient Descent 21 3 Logistic Regression 25 4 Glossary 39 5 Calculus 45 6 Linear Algebra 57 7 Probability 67 8 Statistics 69 9 Notation 71 10 Concepts 75 11 Forwardpropagation 81 12 Backpropagation 91 13 Activation Functions 97 14 Layers 105 15 Loss Functions 117 16 Optimizers 121 17 Regularization 127 18 Architectures 137 19 Classification Algorithms 151 20 Clustering Algorithms 157 i 21 Regression Algorithms 159 22 Reinforcement Learning 161 23 Datasets 165 24 Libraries 181 25 Papers 211 26 Other Content 217 27 Contribute 223 ii ML Cheatsheet Documentation Brief visual explanations of machine learning concepts with diagrams, code examples and links to resources for learning more. Warning: This document is under early stage development. If you find errors, please raise an issue or contribute a better definition! Basics 1 ML Cheatsheet Documentation 2 Basics CHAPTER 1 Linear Regression • Introduction • Simple regression – Making predictions – Cost function – Gradient descent – Training – Model evaluation – Summary • Multivariable regression – Growing complexity – Normalization – Making predictions – Initialize weights – Cost function – Gradient descent – Simplifying with matrices – Bias term – Model evaluation 3 ML Cheatsheet Documentation 1.1 Introduction Linear Regression is a supervised machine learning algorithm where the predicted output is continuous and has a constant slope. It’s used to predict values within a continuous range, (e.g. sales, price) rather than trying to classify them into categories (e.g. cat, dog). There are two main types: Simple regression Simple linear regression uses traditional slope-intercept form, where m and b are the variables our algorithm will try to “learn” to produce the most accurate predictions.
    [Show full text]
  • CRF, CTC, Word2vec
    NPFL114, Lecture 9 CRF, CTC, Word2Vec Milan Straka April 26, 2021 Charles University in Prague Faculty of Mathematics and Physics Institute of Formal and Applied Linguistics unless otherwise stated Structured Prediction Structured Prediction NPFL114, Lecture 9 CRF CTC CTCDecoding Word2Vec CLEs Subword Embeddings 2/30 Structured Prediction Consider generating a sequence of N given input . y1, … , yN ∈ Y x1, … , xN Predicting each sequence element independently models the distribution . P (yi∣ X) However, there may be dependencies among the themselves, which is difficult to capture by yi independent element classification. NPFL114, Lecture 9 CRF CTC CTCDecoding Word2Vec CLEs Subword Embeddings 3/30 Maximum Entropy Markov Models We might model the dependencies by assuming that the output sequence is a Markov chain, and model it as P (yi∣ X, yi−1) . Each label would be predicted by a softmax from the hidden state and the previous label. The decoding can be then performed by a dynamic programming algorithm. NPFL114, Lecture 9 CRF CTC CTCDecoding Word2Vec CLEs Subword Embeddings 4/30 Maximum Entropy Markov Models However, MEMMs suffer from a so-called label bias problem. Because the probability is factorized, each is a distribution and must sum to one. P (yi∣ X, yi−1) Imagine there was a label error during prediction. In the next step, the model might “realize” that the previous label has very low probability of being followed by any label – however, it cannot express this by setting the probability of all following labels low, it has to “conserve the mass”. NPFL114, Lecture 9 CRF CTC CTCDecoding Word2Vec CLEs Subword Embeddings 5/30 Conditional Random Fields Let G = (V , E) be a graph such that y is indexed by vertices of G.
    [Show full text]
  • PDF Hosted at the Radboud Repository of the Radboud University Nijmegen
    PDF hosted at the Radboud Repository of the Radboud University Nijmegen The following full text is a publisher's version. For additional information about this publication click this link. http://hdl.handle.net/2066/179506 Please be advised that this information was generated on 2021-09-30 and may be subject to change. Algorithmic composition of polyphonic music with the WaveCRF Umut Güçlü*, Yagmur˘ Güçlütürk*, Luca Ambrogioni, Eric Maris, Rob van Lier, Marcel van Gerven, Radboud University, Donders Institute for Brain, Cognition and Behaviour Nijmegen, the Netherlands {u.guclu, y.gucluturk}@donders.ru.nl *Equal contribution Abstract Here, we propose a new approach for modeling conditional probability distributions of polyphonic music by combining WaveNET and CRF-RNN variants, and show that this approach beats LSTM and WaveNET baselines that do not take into account the statistical dependencies between simultaneous notes. 1 Introduction The history of algorithmically generated music dates back to the musikalisches würfelspiel (musical dice game) of the eighteenth century. These early methods share with modern machine learning techniques the emphasis on stochasticity as a crucial ingredient for “machine creativity”. In recent years, artificial neural networks dominated the creative music generation literature [3]. In several of the most successful architectures, such as WaveNet, the output of the network is an array that specifies the probabilities of each note given the already produced composition [3]. This approach tends to be infeasible in the case of polyphonic music because the network would need to output a probability value for every possible simultaneous combination of notes. The naive strategy of producing each note independently produces less realistic compositions as it ignores the statistical dependencies between simultaneous notes.
    [Show full text]
  • Conditional Random Fields Meet Deep Neural Networks for Semantic
    IEEE SIGNAL PROCESSING MAGAZINE, VOL. XX, NO. XX, JANUARY 2018 1 Conditional Random Fields Meet Deep Neural Networks for Semantic Segmentation Anurag Arnab∗, Shuai Zheng∗, Sadeep Jayasumana, Bernardino Romera-Paredes, Mans˚ Larsson, Alexander Kirillov, Bogdan Savchynskyy, Carsten Rother, Fredrik Kahl and Philip Torr Abstract—Semantic Segmentation is the task of labelling every object category. Semantic Segmentation, the main focus of this pixel in an image with a pre-defined object category. It has numer- article, aims for a more precise understanding of the scene by ous applications in scenarios where the detailed understanding assigning an object category label to each pixel within the of an image is required, such as in autonomous vehicles and image. Recently, researchers have also begun tackling new medical diagnosis. This problem has traditionally been solved scene understanding problems such as instance segmentation, with probabilistic models known as Conditional Random Fields which aims to assign a unique identifier to each segmented (CRFs) due to their ability to model the relationships between the pixels being predicted. However, Deep Neural Networks object in the image, as well as bridging the gap between natural (DNNs) have recently been shown to excel at a wide range of language processing and computer vision with tasks such as computer vision problems due to their ability to learn rich feature image captioning and visual question answering, which aim at representations automatically from data, as opposed to traditional describing an image in words, and answering textual questions hand-crafted features. The idea of combining CRFs and DNNs from images respectively. have achieved state-of-the-art results in a number of domains.
    [Show full text]
  • Evaluating the Utility of Hand-Crafted Features in Sequence Labelling∗
    Evaluating the Utility of Hand-crafted Features in Sequence Labelling∗ Minghao Wu♠♥y Fei Liu♠ Trevor Cohn♠ ♠The University of Melbourne, Victoria, Australia ~JD AI Research, Beijing, China [email protected] [email protected] [email protected] Abstract Orthogonal to the advances in deep learning is the effort spent on feature engineering. A rep- Conventional wisdom is that hand-crafted fea- resentative example is the task of named entity tures are redundant for deep learning mod- recognition (NER), one that requires both lexi- els, as they already learn adequate represen- cal and syntactic knowledge, where, until recently, tations of text automatically from corpora. In this work, we test this claim by proposing a most models heavily rely on statistical sequential new method for exploiting handcrafted fea- labelling models taking in manually engineered tures as part of a novel hybrid learning ap- features (Florian et al., 2003; Chieu and Ng, 2002; proach, incorporating a feature auto-encoder Ando and Zhang, 2005). Typical features include loss component. We evaluate on the task of POS and chunk tags, prefixes and suffixes, and ex- named entity recognition (NER), where we ternal gazetteers, all of which represent years of show that including manual features for part- accumulated knowledge in the field of computa- of-speech, word shapes and gazetteers can im- tional linguistics. prove the performance of a neural CRF model. The work of Collobert et al.(2011) started We obtain a F1 of 91.89 for the CoNLL-2003 English shared task, which significantly out- the trend of feature engineering-free modelling performs a collection of highly competitive by learning internal representations of compo- baseline models.
    [Show full text]
  • Deep Recurrent Conditional Random Field Network for Protein Secondary Prediction
    Deep Recurrent Conditional Random Field Network for Protein Secondary Prediction Johansen, Alexander Rosenberg; Sønderby, Casper Kaae; Sønderby, Søren Kaae; Winther, Ole Published in: ACM-BCB '17 DOI: 10.1145/3107411.3107489 Publication date: 2017 Citation for published version (APA): Johansen, A. R., Sønderby, C. K., Sønderby, S. K., & Winther, O. (2017). Deep Recurrent Conditional Random Field Network for Protein Secondary Prediction. In ACM-BCB '17: Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (pp. 73-78) https://doi.org/10.1145/3107411.3107489 Download date: 28. Sep. 2021 Session 3: Proteins and RNA Structure, Dynamics, and Analysis I ACM-BCB’17, August 20–23, 2017, Boston, MA, USA Deep Recurrent Conditional Random Field Network for Protein Secondary Prediction Alexander Rosenberg Johansen Casper Kaae Sønderby Technical University of Denmark, DTU Compute University of Copenhagen, Bioinformatics Centre [email protected] [email protected] Søren Kaae Sønderby Ole Winther University of Copenhagen, Bioinformatics Centre Technical University of Denmark, DTU Compute [email protected] [email protected] ABSTRACT methods [18] has emerged and received state of the art perfor- Deep learning has become the state-of-the-art method for predict- mance [6, 19, 26, 29, 31]. These approaches have arisen as the chal- ing protein secondary structure from only its amino acid residues lenge of annotating secondary protein structures is predictable from and sequence prole. Building upon these results, we propose to conformations along the sequence of the amino acid and sequence combine a bi-directional recurrent neural network (biRNN) with proles [29].
    [Show full text]
  • Conditional Random Fields by Charles Sutton and Andrew Mccallum
    Foundations and TrendsR in Machine Learning Vol. 4, No. 4 (2011) 267–373 c 2012 C. Sutton and A. McCallum DOI: 10.1561/2200000013 An Introduction to Conditional Random Fields By Charles Sutton and Andrew McCallum Contents 1 Introduction 268 1.1 Implementation Details 271 2 Modeling 272 2.1 Graphical Modeling 272 2.2 Generative versus Discriminative Models 278 2.3 Linear-chain CRFs 286 2.4 General CRFs 290 2.5 Feature Engineering 293 2.6 Examples 298 2.7 Applications of CRFs 306 2.8 Notes on Terminology 308 3 Overview of Algorithms 310 4 Inference 313 4.1 Linear-Chain CRFs 314 4.2 Inference in Graphical Models 318 4.3 Implementation Concerns 328 5 Parameter Estimation 331 5.1 Maximum Likelihood 332 5.2 Stochastic Gradient Methods 341 5.3 Parallelism 343 5.4 Approximate Training 343 5.5 Implementation Concerns 350 6 Related Work and Future Directions 352 6.1 Related Work 352 6.2 Frontier Areas 359 Acknowledgments 362 References 363 Foundations and TrendsR in Machine Learning Vol. 4, No. 4 (2011) 267–373 c 2012 C. Sutton and A. McCallum DOI: 10.1561/2200000013 An Introduction to Conditional Random Fields Charles Sutton1 and Andrew McCallum2 1 School of Informatics, University of Edinburgh, Edinburgh, EH8 9AB, UK, [email protected] 2 Department of Computer Science, University of Massachusetts, Amherst, MA, 01003, USA, [email protected] Abstract Many tasks involve predicting a large number of variables that depend on each other as well as on other observed variables. Structured prediction methods are essentially a combination of classification and graphical modeling.
    [Show full text]
  • Fast and Effective Biomedical Named Entity Recognition Using Temporal Convolutional Network with Conditional Random Field
    MBE, 17(4): 3553–3566. DOI: 10.3934/mbe.2020200 Received: 31 December 2019 Accepted: 20 April 2020 http://www.aimspress.com/journal/MBE Published: 12 May 2020 Research article Fast and effective biomedical named entity recognition using temporal convolutional network with conditional random field Chao Che1;*, Chengjie Zhou1, Hanyu Zhao1, Bo Jin2, and Zhan Gao3 1 Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, Dalian University, Dalian 116622, China 2 School of Innovation and Entrepreneurship, Dalian University of Technology, Dalian 116024, China 3 Beijing Haoyisheng Cloud Hospital Management Technology Ltd. Beijing 100120, China * Correspondence: Tel: +86-041187402046; Email: [email protected]. Abstract: Biomedical named entity recognition (Bio-NER) is the prerequisite for mining knowledge from biomedical texts. The state-of-the-art models for Bio-NER are mostly based on bidirectional long short-term memory (BiLSTM) and bidirectional encoder representations from transformers (BERT) models. However, both BiLSTM and BERT models are extremely computationally intensive. To this end, this paper proposes a temporal convolutional network (TCN) with a conditional random field (TCN-CRF) layer for Bio-NER. The model uses TCN to extract features, which are then decoded by the CRF to obtain the final result. We improve the original TCN model by fusing the features extracted by convolution kernel with different sizes to enhance the performance of Bio-NER. We compared our model with five deep learning models on the GENIA and CoNLL-2003 datasets. The experimental results show that our model can achieve comparative performance with much less training time. The implemented code has been made available to the research community.
    [Show full text]
  • Thesis Submitted for the Requirements of The
    Robust Biomedical Name Entity Recognition Based on Deep Machine Learning Robert Phan A Thesis submitted for the requirements of the Degree of Doctor of Philosophy Faculty of Science and Technology & UC Health Research Institute 10 June 2020 Abstract Biomedical Named Entity Recognition (Bio-NER) is a complex natural language processing (NLP) task for extracting important concepts (named entities) from biomedical texts, such as RNA (Ribonucleic acid), protein, cell type, cell line, and DNA (Deoxyribonucleic acid), and attempts to discover automatically, biomedical knowledge and clinical concepts and terms from text-based digital health records. For automatic recognition and discovery, researchers have investigated extensively different types of machine learning models, leading to sophisticated NER systems. However, most of the computer based NER systems often require manual annotations, and handcrafted features specifically designed for each type of biomedical or clinical entities. The feature generation process for biomedical and clinical NLP texts, requires extensive manual efforts, significant background knowledge from biomedical, clinical and linguistic experts, and suffer from lack of generalization capabilities for different application contexts, and difficult to adapt to new biomedical entity types or the clinical concepts and terms. Recently, there have been increasing efforts to apply different machine learning models to improve the performance and generalization capabilities of automatic Named Entity Recognition (NER) systems for different application contexts. However, their performance and robustness for biomedical and clinical contexts are far from optimal, due to the complex nature of medical texts and lack of annotated dictionaries, and requirement of multi-disciplinary experts for annotating massive training data for the manual feature generation process.
    [Show full text]
  • Conditional Random Field Autoencoders for Unsupervised Structured Prediction
    Conditional Random Field Autoencoders for Unsupervised Structured Prediction Waleed Ammar Chris Dyer Noah A. Smith School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213, USA {wammar,cdyer,nasmith}@cs.cmu.edu Abstract We introduce a framework for unsupervised learning of structured predictors with overlapping, global features. Each input’s latent representation is predicted con- ditional on the observed data using a feature-rich conditional random field (CRF). Then a reconstruction of the input is (re)generated, conditional on the latent struc- ture, using a generative model which factorizes similarly to the CRF. The autoen- coder formulation enables efficient exact inference without resorting to unrealistic independence assumptions or restricting the kinds of features that can be used. We illustrate connections to traditional autoencoders, posterior regularization, and multi-view learning. We then show competitive results with instantiations of the framework for two canonical tasks in natural language processing: part-of-speech induction and bitext word alignment, and show that training the proposed model can be substantially more efficient than a comparable feature-rich baseline. 1 Introduction Conditional random fields [24] are used to model structure in numerous problem domains, includ- ing natural language processing (NLP), computational biology, and computer vision. They enable efficient inference while incorporating rich features that capture useful domain-specific insights. De- spite their ubiquity in supervised
    [Show full text]