The DOI matches its Crossref record; 199 of the 199 references it cites were found in a registry or an index.
Hidden Markov processes
Abstract
An overview of statistical and information-theoretic aspects of hidden Markov processes (HMPs) is presented. An HMP is a discrete-time finite-state homogeneous Markov chain observed through a discrete-time memoryless invariant channel. In recent years, the work of Baum and Petrie (1966) on finite-state finite-alphabet HMPs was expanded to HMPs with finite as well as continuous state spaces and a general alphabet. In particular, statistical properties and ergodic theorems for relative entropy densities of HMPs were developed. Consistency and asymptotic normality of the maximum-likelihood (ML) parameter estimator were proved under some mild conditions. Similar results were established for switching autoregressive processes. These processes generalize HMPs. New algorithms were developed for estimating the state, parameter, and order of an HMP, for universal coding and classification of HMPs, and for universal decoding of hidden Markov channels. These and other related topics are reviewed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Convergence of Probability Measures
Billingsley, P. (1999) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316962 · Cited by 13,910
Breitung, J., & Hamilton, J. D. (1995) · Contemporary Sociology · doi:10.2307/2076916 · Cited by 10,966
Cited by
Survey on speech emotion recognition: Features, classification schemes, and databases
El Ayadi, M., Kamel, M. S., & Karray, F. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.020 · Cited by 2,073
Yu, S.-Z. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2009.11.011 · Cited by 734
Simulation-Based Computation of Information Rates for Channels With Memory
Arnold, D. M., Loeliger, H.-A., Vontobel, P. O., Kavcic, A., & Zeng, W. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.878110 · Cited by 563
Identifiability of parameters in latent structure models with many observed variables
Allman, E. S., Matias, C., & Rhodes, J. A. (2009) · The Annals of Statistics · doi:10.1214/09-aos689 · Cited by 458
Cyclostationary Approaches to Signal Detection and Classification in Cognitive Radio
Kim, K., Akbar, I. A., Bae, K. K., Um, J.-S., Spooner, C. M., & Reed, J. H. (2007) · 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks · doi:10.1109/dyspan.2007.35 · Cited by 422
A toolbox for determining subdiffusive mechanisms
Meroz, Y., & Sokolov, I. M. (2015) · Physics Reports · doi:10.1016/j.physrep.2015.01.002 · Cited by 297
BILMES, J. A. (2006) · IEICE Transactions on Information and Systems · doi:10.1093/ietisy/e89-d.3.869 · Cited by 172
Modeling asynchronous event sequences with RNNs
Wu, S., Liu, S., Sohn, S., Moon, S., Wi, C.-I., Juhn, Y., & Liu, H. (2018) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2018.05.016 · Cited by 45
A Framework for Investigating the Performance of Chaotic-Map Truly Random Number Generators
Beirami, A., & Nejati, H. (2013) · IEEE Transactions on Circuits and Systems II: Express Briefs · doi:10.1109/tcsii.2013.2258274 · Cited by 36
Metadata
- Authors
- Ephraim, Y., & Merhav, N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2002-06
- Volume
- 48
- Issue
- 6
- Pages
- 1518-1569
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2087284982
- Cited by
- 798
- References
- 199
- FWCI
- 28.77
- 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.