The hierarchical hidden Markov model: Analysis and applications
Open accessThe 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
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Fine et al. [10] were the first to introduce the HHMM, generalizing the HMM by viewing each state as an autonomous probabilistic HMM model itself.
“Fine et al. [10] were the first to introduce the HHMM, generalizing the HMM by viewing each state as an autonomous probabilistic HMM model itself.”
From Efficient duration and hierarchical modeling for human activity recognition (2009) · cites this paper as [10]
In a two-layer HHMM, the duration of a bottom-level state i in ch(p) follows a geometric distribution.
“In this two-layer HHMM, the duration of a bottom-level state i ∈ ch(p), denoted as D p,i , follows a geometric distribution.”
From Efficient duration and hierarchical modeling for human activity recognition (2009) · cites this paper as [10]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Maximum Likelihood from Incomplete Data Via the <i>EM</i> 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 · see citing works
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 37,139 · see citing works
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 · see citing works
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. J. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,877 · see citing works
An introduction to hidden Markov models
Rabiner, L., & Juang, B. (1986) · IEEE ASSP Magazine · doi:10.1109/massp.1986.1165342 · Cited by 4,775 · see citing works
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
Baum, L. E., & Petrie, T. (1966) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177699147 · Cited by 2,775 · see citing works
Unsupervised word sense disambiguation rivaling supervised methods
Yarowsky, D. (1995) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981658.981684 · Cited by 2,411 · see citing works
A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition
Rabiner, L. R. (1990) · Elsevier eBooks · doi:10.1016/b978-0-08-051584-7.50027-9 · Cited by 1,868 · see citing works
Elements of Information Theory
Phoenix, S. J. D. (1992) · Journal of Modern Optics · doi:10.1080/09500349214551641 · Cited by 1,411 · see citing works
Factorial Hidden Markov Models
Ghahramani, Z., & Jordan, M. I. (1997) · Machine Learning · doi:10.1023/a:1007425814087 · Cited by 1,157 · see citing works
Unsupervised Models for Named Entity Classification
Collins, M., & Singer, Y. (1999) · Cited by 819 · see citing works
Self-citationApplications of stochastic context-free grammars using the Inside-Outside algorithm
Lari, K., & Young, S. J. (1991) · Computer Speech & Language · doi:10.1016/0885-2308(91)90009-f · Cited by 639 · see citing works
The power of amnesia: Learning probabilistic automata with variable memory length
Ron, D., Singer, Y., & Tishby, N. (1997) · Machine Learning · doi:10.1007/bf00114008 · Cited by 453 · see citing works
Self-citationHidden Markov models of biological primary sequence information.
Baldi, P., Chauvin, Y., Hunkapiller, T., & McClure, M. A. (1994) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.91.3.1059 · Cited by 451 · see citing works
SELF-ORGANIZED LANGUAGE MODELING FOR SPEECH RECOGNITION
Jelinek, F. (1990) · Elsevier eBooks · doi:10.1016/b978-0-08-051584-7.50045-0 · Cited by 432 · see citing works
Robust part-of-speech tagging using a hidden Markov model
Kupiec, J. M. (1992) · Computer Speech & Language · doi:10.1016/0885-2308(92)90019-z · Cited by 422 · see citing works
The estimation of stochastic context-free grammars using the Inside-Outside algorithm
Lari, K., & Young, S. J. (1990) · Computer Speech & Language · doi:10.1016/0885-2308(90)90022-x · Cited by 380 · see citing works
A hidden Markov model that finds genes inE.coliDNA
Krogh, A., Mian, S. I., & Haussler, D. H. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.22.4768 · Cited by 315 · see citing works
An Input Output HMM Architecture
Bengio, Y., & Frasconi, P. (1994) · Cited by 266 · see citing works
Factorial Hidden Markov Models.
Zoubin Ghahramani, A., & Jordan, M. I. (1996) · doi:10.21236/ada307097 · Cited by 256 · see citing works
Complexity of strings in the class of Markov sources
Rissanen, J. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057210 · Cited by 186 · see citing works
The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length
Ron, D., Singer, Y., & Tishby, N. (1996) · Machine Learning · doi:10.1023/a:1026490906255 · Cited by 185 · see citing works
Self-citationON THE COMPUTATIONAL COMPLEXITY OFAPPROXIMATING DISTRIBUTIONS BY PROBABILISTIC AUTOMATA
Abe, N., & Warmuth, M. K. (1990) · doi:10.5555/92571.92587 · Cited by 155 · see citing works
Best-first Model Merging for Hidden Markov Model InductionPreprint
Stolcke, A., & Omohundro, S. M. (1994) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9405017 · Cited by 111 · see citing works
Script recognition using hidden Markov models
Nag, R., Wong, K.-M., & Fallside, F. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1986.1168951 · Cited by 98 · see citing works
Markov Source Modeling of Text Generation
Jelinek, F. (1985) · Springer eBooks · doi:10.1007/978-94-009-5113-6_28 · Cited by 78 · see citing works
On the computational complexity of approximating distributions by probabilistic automata
Abe, N., & Warmuth, M. K. (1992) · Machine Learning · doi:10.1007/bf00992677 · Cited by 69 · see citing works
Dynamical encoding of cursive handwriting
Singer, Y., & Tishby, N. (1994) · Biological Cybernetics · doi:10.1007/bf00202762 · Cited by 51 · see citing works
Self-citationGat, I., Tishby, N., & Abeles, M. (1997) · Network Computation in Neural Systems · doi:10.1088/0954-898x_8_3_005 · Cited by 41 · see citing works
Self-citationTraining Algorithms for Hidden Markov Models using Entropy Based Distance Functions
Singer, Y., & Warmuth, M. K. (1996) · Cited by 39 · see citing works
Self-citationInference and minimization of hidden Markov chains
Gillman, D. W., & Sipser, M. (1994) · Annual Conference on Computational Learning Theory (COLT) · doi:10.1145/180139.181091 · Cited by 20 · see citing works
Dynamical encoding of cursive handwriting
Singer, Y., & Tishby, N. (1994) · Biological Cybernetics · doi:10.1007/s004220050085 · Cited by 17 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570 · see citing works
Activity Recognition and Abnormality Detection with the Switching Hidden Semi-Markov Model
Duong, T. V., Bui, H. H., Phung, D. Q., & Venkatesh, S. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.61 · Cited by 535 · see citing works
Kiani, R., Hanks, T. D., & Shadlen, M. N. (2008) · The Journal of Neuroscience · doi:10.1523/jneurosci.4761-07.2008 · Cited by 500 · see citing works
Conditional random fields for activity recognition
Vail, D. L., Veloso, M. M., & Lafferty, J. D. (2007) · Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems · doi:10.1145/1329125.1329409 · Cited by 357 · see citing works
A Survey on Multimodal Large Language Models for Autonomous Driving
Cui, C., Ma, Y., Cao, X., Ye, W., Zhou, Y., Liang, K., Chen, J., Lu, J., Yang, Z., Liao, K.-D., et al. (2024) · 2024 IEEE/CVF Winter Conference on Applications of Computer Vision Workshops (WACVW) · doi:10.1109/wacvw60836.2024.00106 · Cited by 369 · see citing works
Recent Advances in Hierarchical Reinforcement Learning
Barto, A. G., & Mahadevan, S. (2003) · Discrete Event Dynamic Systems · doi:10.1023/a:1025696116075 · Cited by 317 · see citing works
Finding approximate POMDP solutions through belief compression
Roy, N., Gordon, G., & Thrun, S. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1496 · Cited by 254 · see citing works
Analysis of animal accelerometer data using hidden Markov models
Leos‐Barajas, V., Photopoulou, T., Langrock, R., Patterson, T. A., Watanabe, Y. Y., Murgatroyd, M., & Papastamatiou, Y. P. (2017) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.12657 · Cited by 187 · see citing works
Efficient duration and hierarchical modeling for human activity recognition
Duong, T., Phung, D., Bui, H., & Venkatesh, S. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2008.12.005 · Cited by 108 · see citing works
Recognition of human activity through hierarchical stochastic learning
Luhr, S., Bui, H. H., Venkatesh, S., & West, G. A. W. (2004) · Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003). · doi:10.1109/percom.2003.1192766 · Cited by 58 · see citing works
Samir, A., & Pahl, C. (2019) · 2019 7th International Conference on Future Internet of Things and Cloud (FiCloud) · doi:10.1109/ficloud.2019.00036 · Cited by 49 · see citing works
Directed Acyclic Graph Neural Network for Human Motion Prediction
Li, Q., Chalvatzaki, G., Peters, J., & Wang, Y. (2021) · 2021 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra48506.2021.9561540 · Cited by 29 · see citing works
- Authors
- Fine, S., Singer, Y., & Tishby, N.
- Affiliations
- Hebrew University of Jerusalem (IL)
- AT&T (United States) (US)
- Venue
- Machine Learning
- Published
- 1998-07
- Volume
- 32
- Issue
- 1
- Pages
- 41-62
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1636244751
- Cited by
- 906
- References
- 32
- Citations by year
- 2026: 10 · 2025: 17 · 2024: 19 · 2023: 26 · 2022: 39 · 2021: 36 · 2020: 51 · 2019: 34 · 2018: 30 · 2017: 39 · 2016: 33 · 2015: 31 · 2014: 53 · 2013: 36 · 2012: 43
- FWCI
- 3.53
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Machine Learning (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Speech Recognition and Synthesis
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Keywords
- hierarchical hidden Markov models, unsupervised parameter estimation, Baum-Welch algorithm, cursive script, natural language modeling
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