Bidirectional recurrent neural networks: Difference between revisions

Content deleted Content added
Undo low-quality reference: deepai.org
adding links to references using Google Scholar
Line 1:
{{Orphan|date=March 2016}}
 
'''Bidirectional Recurrent Neural Networks''' ('''BRNN''') connect two hidden layers of opposite directions to the same output. With this form of [[Generative model|generative deep learning]], the output layer can get information from past (backwards) and future (forward) states simultaneously. Invented in 1997 by Schuster and Paliwal,<ref name="Schuster">Schuster, Mike, and Kuldip K. Paliwal. "[https://www.researchgate.net/profile/Mike_Schuster/publication/3316656_Bidirectional_recurrent_neural_networks/links/56861d4008ae19758395f85c.pdf Bidirectional recurrent neural networks]." Signal Processing, IEEE Transactions on 45.11 (1997): 2673-2681.2. Awni Hannun, Carl Case, Jared Casper, Bryan Catanzaro, Greg Diamos, Erich Elsen, Ryan</ref> BRNNs were introduced to increase the amount of input information available to the network. For example, [[multilayer perceptron]] (MLPs) and [[time delay neural network]] (TDNNs) have limitations on the input data flexibility, as they require their input data to be fixed. Standard [[recurrent neural network]] (RNNs) also have restrictions as the future input information cannot be reached from the current state. On the contrary, BRNNs do not require their input data to be fixed. Moreover, their future input information is reachable from the current state. <ref>{{Cite web|url=https://arxiv.org/pdf/1801.01078.pdf|title=Recent Advances in Recurrent Neural Networks|last=|first=|date=|website=|archive-url=|archive-date=|dead-url=|access-date=}}</ref>
 
BRNN are especially useful when the context of the input is needed. For example, in handwriting recognition, the performance can be enhanced by knowledge of the letters located before and after the current letter.
Line 18:
Applications of BRNN include :
 
*Speech Recognition (Combined with [[Long short-term memory]])<ref>Graves, Alex, Santiago Fernández, and Jürgen Schmidhuber. "[https://mediatum.ub.tum.de/doc/1290195/file.pdf Bidirectional LSTM networks for improved phoneme classification and recognition]." Artificial Neural Networks: Formal Models and Their Applications–ICANN 2005. Springer Berlin Heidelberg, 2005. 799-804.
</ref><ref>Graves, Alan, Navdeep Jaitly, and Abdel-rahman Mohamed. "[http://www.cs.toronto.edu/~graves/asru_2013.pdf Hybrid speech recognition with deep bidirectional LSTM]." Automatic Speech Recognition and Understanding (ASRU), 2013 IEEE Workshop on. IEEE, 2013.</ref>
 
*Translation<ref>Sundermeyer, Martin, et al. "[https://www.aclweb.org/anthology/D14-1003 Translation modeling with bidirectional recurrent neural networks]." Proceedings of the Conference on Empirical Methods on Natural Language Processing, October. 2014.</ref>
*Handwritten Recognition<ref>Liwicki, Marcus, et al. "[https://mediatum.ub.tum.de/doc/1289961/file.pdf A novel approach to on-line handwriting recognition based on bidirectional long short-term memory networks]." Proc. 9th Int. Conf. on Document Analysis and Recognition. Vol. 1. 2007.</ref>
*Protein Structure Prediction<ref>Baldi, Pierre, et al. "[https://academic.oup.com/bioinformatics/article-pdf/15/11/937/693153/150937.pdf Exploiting the past and the future in protein secondary structure prediction]." Bioinformatics 15.11 (1999): 937-946.</ref><ref>Pollastri, Gianluca, and Aoife Mclysaght. "[https://academic.oup.com/bioinformatics/article/21/8/1719/250163 Porter: a new, accurate server for protein secondary structure prediction]." Bioinformatics 21.8 (2005): 1719-1720.</ref>
*Part-of-speech tagging
*Dependency Parsing<ref>Grella and Cangialosi "[https://arxiv.org/pdf/1802.02116 Non-Projective Dependency Parsing via Latent Heads Representation]" (2018).</ref>
*Entity Extraction<ref>{{Cite arxiv|last=Dernoncourt|first=Franck|last2=Lee|first2=Ji Young|last3=Szolovits|first3=Peter|date=2017-05-15|title=NeuroNER: an easy-to-use program for named-entity recognition based on neural networks|eprint=1705.05487|class=cs.CL}}</ref>