DOCSLIB.ORG

Graphical Models and Conditional Random Fields

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Graphical Models and Conditional Random Fields Presenter: Shih-Hsiang Lin Bishop, C. M., “Pattern Recognition and Machine Learning,” Springer, 2006 Sutton, C., McCallum, A., “An Introduction to Conditional Random Fields for Relational Learning,” Introduction to Statistical Relational Learning, MIT Press. 2007 Rahul Gupta, “Conditional Random Fields,” Dept. of Computer Science and Engg., IIT Bombay, India. Overview • Introduction to graphical models • Applications of graphical models • More detail on conditional random fields • Conclusions 2 Introduction to Graphical Models Power of Probabilistic Graphical Models • Why do we need graphical models – Graphs are an intuitive way of representing and visualizing the relationships between many variables • Used to design and motivate new models – A graph allows us to abstract out the conditional independence relationships between the variables from the details of their parametric forms. • Provide a new insights into existing model – Graphical models allow us to define general message-passing algorithms that implement probabilistic inference efficiently • Graph based algorithms for calculation and computation Probability Graph Theory Theory Probability Graphical Models 4 Probability Theory • What do we need to know in advance – Probability Theory •Sum Rule(Law of Total Probability or Marginal Probability) p()x = ∑ p(x, y ) y • Product Rule (Chain Rule) p()x, y = p(x | y )p(y ) = p(y | x )p(x ) • From the above we can derive Bayes’ theorem p(x | y )p(y ) p()x | y p(y ) p()y | x = = p()x ∑ p()()x | y p y y 5 Conditional Independence and Marginal Independence • Conditional Independence x y | z ⇔ p(x | y, z ) = p(x | z ) which is equivalent to saying p()x, y | z = p(x | y, z )p(y | z ) = p(x | z )(p y | z ) – Conditional independence crucial in practical applications since we can rarely work with a general joint distribution • Marginal Independence x y ⇔ a b | 0 ⇔ p()x, y = p(x )p(y ) •Example empty set – Amount of Speeding Fine Type of Car | Speed – Lung Cancer Yellow Teeth | Smoking – Child’s Genes Grandparents’ Genes | Parents’ Genes – Ability of Team A Ability of Team B 6 Graphical models a b a b c c Directed Graph Undirected Graph • A graphical model comprises nodes connected by links – Nodes (vertices) correspond to random variables – Links (edges or arcs) represents the relationships between the variables • Directed graphs are useful for expressing casual relationships between random variables • Undirected graphs are better suited to expressing soft constraints between random variables 7 Directed Graphs • Consider an arbitrary distribution p(a,b, c ), we can write the joint distribution in the form – By successive application of the product rule p()a,b, c = p(c | a,b )p(a,b ) * Note that this decomposition holds for or any choice of joint distribution p()a,b, c = p(c | a,b )p(b | a )p(a ) • We then can represent the above equation in terms of a simple graphical models – First, we introduce a node for each of the random variables – Second, for each conditional distribution we add directed links to the graph a b A fully connected graph c 8 Directed Graphs (cont.) • Let us consider another case p(x1 , x2 , x3 , x4 , x5 , x6 , x7 ) p(x1 , x2 , x3 , x4 , x5 , x6 , x7 ) = p(x7 | x1 ,L , x6 )L p(x2 | x1 )p(x1 ) x1 x3 x2 x5 Again, it is a fully connected graph x6 x4 x7 • What would happen if some links were dropped?? (considering the relationship between nodes) 9 Directed Graphs (cont.) • The joint distribution of p ( x 1 , x 2 , x 3 , x 4 , x 5 , x 6 , x 7 ) is therefore given by x1 x3 x p(x1 , x2 , x3 , x4 , x5 , x6 , x7 ) 2 = p()x1 × p ()x2 × p ()x3 × p (x4 | x1 , x2 , x3 )× x5 p()()()x5 | x1 , x3 × p x6 | x4 × p x7 | x4 , x5 x6 x4 x7 * The joint distribution is then defined by the product of a conditional distribution for each node conditioned on the variables corresponding to the parents of that node in the graph • Thus, for a graph with K nodes, the joint distribution is given by K where parent x denotes the set of parents of xk p()x1 ,L , x K = ∏ p()xk | parent ()xk ( k ) k =1 • We always restrict the directed graph must have no directed cycles – Such graphs are also called directed acyclic graphs (DAGs) or Bayesian network 10 Directed Graph: Conditional Independence • Joint distribution over 3 variables specified by the graph p(a,b, c ) = p(a | c )p(b | c )p(c ) c if node c is not observed a b p()a,b = ∑ p(a | c )p(b | c )p(c )()≠ p a p(b ) Î a b | 0 c c if node c is observed a b p(a,b, c ) p()a,b | c = = p()()a | c p b | c Î a b | c p()c The node c is said to be tail-to-tail r.w.t. this path from node a to node b Î this observation ‘blocks’ the path from a to b and cause a and b to become conditionally independent 11 Directed Graph: Conditional Independence (cont.) • The second example p(a,b, c ) = p(a )p(c | a )p(b | c ) a c b if node c is not observed p(a,b )()= p a ∑ p(c | a )p(b | c ) = p(a )p(b | a ) ≠ p(a )p(b ) Î a b | 0 c a c b if node c is observed p()a,b, c p(a )p(c | a )p(b | c ) p()a,b | c = = = p()()a | c p b | c Î a b | c p()c p()c The node c is said to be head-to-tail r.w.t. this path from node a to node b Î this observation ‘blocks’ the path from a to b and cause a and b to become conditionally independent 12 Directed Graph: Conditional Independence (cont.) • The third example p(a,b, c ) = p(a )p(b )p(c | a,b ) c if node c is not observed a b p(a,b ) = ∑ p(a,b, c ) = p(a )p(b )∑ p(c | a,b ) = p(a )p(b ) Î a b | 0 c c c if node c is observed a b p()a,b, c p(a )p(b )p(c | a,b ) p()a,b | c = = ≠ p()()a | c p b | c Î a b | c p()c p()c The node c is said to be head-to-head r.w.t. this path from node a to node b Î the conditioned node c ‘unblocks’ the path and renders a and b dependent 13 D-separation •ifA B | C C d-separated A from B – We need to consider all possible paths from any node in A to any node in B – Any such path is said to be blocked if it includes a node such that either (a) the arrows on the path meet either head-to-tail or tail-to-tail at the node, and the node is in the set C (b) the arrows meet head-to-tail at the node, and neither the node, nor any of its descendants, is in the set C – If all paths are blocked, then A is said to be d-separated from B by C a f a f e b e b c c a b | c a b | f 14 Markov Blankets • Markov blankets (or Markov boundary) of a node x is the minimal set of nodes that isolates nodes A from the rest of the graph – Every set of nodes in the network is conditionally independent of A when conditioned on the Markov blanket of the node A p()A | MB (A)∩ B = p(A | MB (A)) – MB(A)= {parents(A) and children(A) and parents-of-children(A)} A 15 Examples of Directed Graphs • Hidden Markov models • Kalman filters • Factor analysis • Probabilistic principal component analysis • Independent component analysis • Mixtures of Gaussians • Transformed component analysis • Probabilistic expert systems • Sigmoid belief networks • Hierarchical mixtures of experts • etc,… 16 Example: State Space Models (SSM) • Hidden Markov models • Kalman filters Hidden Observed yt −1 yt yt +1 xt −1 xt xt +1 P ()X ,Y = L p(yt | yt −1 )p(xt | yt )p(yt +1 | y )L 17 Example: Factorial SSM • Multiple hidden sequences Hidden Observed 18 Markov Random Fields • Random Field – Let F = { F 1 , F 2 ,..., F M } be a family of random variables defined on the set S , in which each random variable F i takes a value f i in a label set L. The family F is called a random field • Markov Random Field – F is said to be a Markov random field on S with respect to a neighborhood system N if and only if the following two conditions are satisfied Possitivity : P(f ) > 0,∀f ∈F Markovianity : P(fi | all other f )= P(fi | neighbors(fi )) a b c P(b | all other node) = P(b | c,d) e d 19 Undirected Graphs • An undirected graphical model can also called Markov random fields, or also known as a Markov networks – It has a set of nodes each of which corresponds to a variable of group of variables, as well as a set of links each of which connects a pair of nodes • In an undirected graphical models, the joint distribution is product of non-negative functions over the cliques of the graph ψ x 1 where C ( C ) are the clique potential, and Z is a p()x = ∏ ψ C ()xC normalization constant (sometimes called the partition function) Z C A B a b 1 p()x = ψ ()(a, c ψ b, c, d )(ψ c, d , e ) c Z A B C e d C 20 Clique Potentials • A clique is a fully connected subgraph – By clique we usually mean maximal clique (i.e.
Recommended publications
  • Information Extraction from Electronic Medical Records Using Multitask Recurrent Neural Network with Contextual Word Embedding

    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.
  • A Multitask Bi-Directional RNN Model for Named Entity Recognition On

    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.
  • ML Cheatsheet Documentation

    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.
  • CRF, CTC, Word2vec

    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.
  • PDF Hosted at the Radboud Repository of the Radboud University Nijmegen

    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.
  • Conditional Random Fields Meet Deep Neural Networks for Semantic

    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.
  • Evaluating the Utility of Hand-Crafted Features in Sequence Labelling∗

    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.
  • Deep Recurrent Conditional Random Field Network for Protein Secondary Prediction

    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].
  • Conditional Random Fields by Charles Sutton and Andrew Mccallum

    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.
  • Fast and Effective Biomedical Named Entity Recognition Using Temporal Convolutional Network with Conditional Random Field

    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.
  • Thesis Submitted for the Requirements of The

    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.
  • Conditional Random Field Autoencoders for Unsupervised Structured Prediction

    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