The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Input-output HMMs for sequence processing
Abstract
We consider problems of sequence processing and propose a solution based on a discrete-state model in order to represent past context. We introduce a recurrent connectionist architecture having a modular structure that associates a subnetwork to each state. The model has a statistical interpretation we call input-output hidden Markov model (IOHMM). It can be trained by the estimation-maximization (EM) or generalized EM (GEM) algorithms, considering state trajectories as missing data, which decouples temporal credit assignment and actual parameter estimation. The model presents similarities to hidden Markov models (HMMs), but allows us to map input sequences to output sequences, using the same processing style as recurrent neural networks. IOHMMs are trained using a more discriminant learning paradigm than HMMs, while potentially taking advantage of the EM algorithm. We demonstrate that IOHMMs are well suited for solving grammatical inference problems on a benchmark problem. Experimental results are presented for the seven Tomita grammars, showing that these adaptive models can attain excellent generalization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
(1988) · Cited by 16,582
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
Learning long-term dependencies with gradient descent is difficult
Bengio, Y., Simard, P., & Frasconi, P. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279181 · Cited by 8,542
Self-citationIntroduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
Adaptive Mixtures of Local Experts
Jacobs, R. A., Jordan, M. I., Nowlan, S. J., & Hinton, G. E. (1991) · Neural Computation · doi:10.1162/neco.1991.3.1.79 · Cited by 5,384
Maximum Likelihood from Incomplete Data via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1976) · Cited by 4,517
A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
Williams, R. J., & Zipser, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.270 · Cited by 4,369
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
Non-negative Matrices and Markov Chains
Seneta, E. (1981) · Springer Series in Statistics · doi:10.1007/0-387-32792-4 · Cited by 2,807
Phoneme recognition using time-delay neural networks
Waibel, A., Hanazawa, T., Hinton, G., Shikano, K., & Lang, K. J. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.21701 · Cited by 2,643
Bridle, J. S. (1990) · Neurocomputing · doi:10.1007/978-3-642-76153-9_28 · Cited by 1,237
Connectionist Speech Recognition: A Hybrid Approach
Bourlard, H. A., & Morgan, N. H. (1993) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1,115
Levinson, S. E., Rabiner, L. R., & Sondhi, M. M. (1983) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1983.tb03114.x · Cited by 978
Inductive Inference: Theory and Methods
Angluin, D., & Smith, C. H. (1983) · ACM Computing Surveys · doi:10.1145/356914.356918 · Cited by 887
10.2 Maximum Likelihood from Incomplete Data
(2024) · Hierarchical Quantile Modeling · doi:10.1051/978-2-7598-3719-9.c026 · Cited by 780
Learning State Space Trajectories in Recurrent Neural Networks
Pearlmutter, B. A. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.263 · Cited by 656
Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks
Giles, C. L., Miller, C. B., Chen, D., Chen, H. H., Sun, G. Z., & Lee, Y. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.393 · Cited by 392
Mixture Models: Inference and Applications to Clustering.
Hand, D. J., McLachlan, G. J., & Basford, K. E. (1989) · Applied Statistics · doi:10.2307/2348072 · Cited by 392
Refinement of approximate domain theories by knowledge-based neural networks
Towell, G. G., SHAVLIK, J. W., & Noordewier, M. O. (1990) · Cited by 369
Links between Markov models and multilayer perceptrons
Bourlard, H., & Wellekens, C. J. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.62605 · Cited by 340
Improving the convergence of back-propagation learning with second-order methods
Becker, S., & LeCun, Y. (1989) · Cited by 331
The induction of dynamical recognizers
Pollack, J. B. (1991) · Machine Learning · doi:10.1007/bf00114845 · Cited by 294
Locally recurrent globally feedforward networks: a critical review of architectures
Tsoi, A. C., & Back, A. D. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279187 · Cited by 279
The Acoustic-Modeling Problem in Automatic Speech Recognition.
Brown, P. F. (1987) · doi:10.21236/ada188529 · Cited by 248
Learning from hints in neural networks
Abu-Mostafa, Y. S. (1990) · Journal of Complexity · doi:10.1016/0885-064x(90)90006-y · Cited by 241
The problem of learning long-term dependencies in recurrent networks
Bengio, Y., Frasconi, P., & Simard, P. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298725 · Cited by 241
Self-citationHidden Markov models: a guided tour
Poritz, A. B. (2003) · ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1988.196495 · Cited by 235
Global optimization of a neural network-hidden Markov model hybrid
Bengio, Y., De Mori, R., Flammia, G., & Kompe, R. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.125866 · Cited by 203
Self-citationLocal Feedback Multilayered Networks
Frasconi, P., Gori, M., & Soda, G. (1992) · Neural Computation · doi:10.1162/neco.1992.4.1.120 · Cited by 189
Self-citationContinuous speech recognition via centisecond acoustic states
Bakis, R. (1976) · The Journal of the Acoustical Society of America · doi:10.1121/1.2003011 · Cited by 175
Induction of Finite-State Languages Using Second-Order Recurrent Networks
Watrous, R. L., & Kuhn, G. M. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.406 · Cited by 151
Hierarchies of adaptive experts
Jordan, M. I., & Jacobs, R. A. (1991) · neural information processing systems · Cited by 150
Smooth On-Line Learning Algorithms for Hidden Markov Models
Baldi, P., & Chauvin, Y. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.307 · Cited by 119
Representation of Finite State Automata in Recurrent Radial Basis Function Networks
Frasconi, P., Gori, M., Maggini, M., & Soda, G. (1996) · Machine Learning · doi:10.1007/bf00116897 · Cited by 107
Self-citationWord recognition using hidden control neural architecture
Levin, E. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1990.115740 · Cited by 99
Unified integration of explicit knowledge and learning by example in recurrent networks
Frasconi, P., Gori, M., Maggini, M., & Soda, G. (1995) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.382304 · Cited by 87
Self-citationStatic and Dynamic Error Propagation Networks with Application to Speech Coding
Robinson, A. J., & Fallside, F. (1987) · Cited by 79
Network Structuring and Training Using Rule-based Knowledge
Volker Tresp, C., Hollatz, J., & Ahmad, S. (1992) · Cited by 78
Mixtures of Controllers for Jump Linear and Non-Linear Plants
Cacciatore, T. W., & Nowlan, S. J. (1993) · Cited by 62
BPS: a learning algorithm for capturing the dynamic nature of speech
Gori, M., Bengio, & Mori, R. D. (1989) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1989.118276 · Cited by 60
A structure by which a recurrent neural network can approximate a nonlinear dynamic system
Seidl, D. R., & Lorenz, R. D. (2002) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1991.155422 · Cited by 60
The “moving targets” training algorithm
Rohwer, R. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52255-7_31 · Cited by 57
A Unified Gradient-Descent/Clustering Architecture for Finite State Machine Induction
Das, S., & Mozer, M. C. (1993) · Cited by 52
Diffusion of Context and Credit Information in Markovian Models
Bengio, Y., & Frasconi, P. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.233 · Cited by 45
Self-citationCredit Assignment through Time: Alternatives to Backpropagation
Bengio, Y., & Frasconi, P. (1993) · Cited by 36
Self-citationInserting rules into recurrent neural networks
Giles, C. L., & Omlin, C. W. P. (2003) · Machine learning for signal processing ... · doi:10.1109/nnsp.1992.253712 · Cited by 27
Cited by
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Self-citationA review of unsupervised feature learning and deep learning for time-series modeling
Längkvist, M., Karlsson, L., & Loutfi, A. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2014.01.008 · Cited by 1,243
GradientBased Learning Applied to Document Recognition
(2009) · Intelligent Signal Processing · doi:10.1109/9780470544976.ch9 · Cited by 1,135
Machine Learning for Sequential Data: A Review
Dietterich, T. G. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-70659-3_2 · Cited by 666
Twenty Years of Mixture of Experts
Yuksel, S. E., Wilson, J. N., & Gader, P. D. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2200299 · Cited by 606
Metadata
- Authors
- Bengio, Y., & Frasconi, P.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1996-09
- Volume
- 7
- Issue
- 5
- Pages
- 1231-1249
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2165959773
- Cited by
- 300
- References
- 51
- FWCI
- 6.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.