The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
A spectral algorithm for learning Hidden Markov Models
Open accessOverview
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
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
System Identification: Theory for the User
Lennart Ljung, A. (1987) · Cited by 17,690
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
Elements of Information Theory
Jacobs, K. (1992) · Discrete Stochastics · doi:10.1007/978-3-0348-8645-1_7 · Cited by 2,918
Subspace Identification for Linear Systems
Van Overschee, P., & De Moor, B. (1996) · Springer eBooks · doi:10.1007/978-1-4613-0465-4 · Cited by 2,586
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
Baum, L. E., & Eagon, J. A. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11751-8 · Cited by 1,036
Subspace Methods for System Identification
Katayama, T. (2005) · Communications and Control Engineering · doi:10.1007/1-84628-158-x · Cited by 860
On the definition of a family of automata
Schützenberger, M. P. (1961) · Information and Control · doi:10.1016/s0019-9958(61)80020-x · Cited by 645
Learning mixtures of Gaussians
Dasgupta, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814639 · Cited by 588
The most predictable criterion.
Hotelling, H. (1935) · Journal of Educational Psychology · doi:10.1037/h0058165 · Cited by 581
Predictive Representations of State
Littman, M. L., & Sutton, R. S. (2001) · Cited by 425
On the learnability of discrete distributions
Kearns, M., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R. E., & Sellie, L. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195155 · Cited by 273
On Spectral Learning of Mixtures of Distributions
Achlioptas, D., & McSherry, F. (2005) · Lecture notes in computer science · doi:10.1007/11503415_31 · Cited by 237
Learning mixtures of arbitrary gaussians
Sanjeev, A., & Kannan, R. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380808 · Cited by 216
Observable Operator Models for Discrete Stochastic Time Series
Jaeger, H. (2000) · Neural Computation · doi:10.1162/089976600300015411 · Cited by 174
Hilbert Space Embeddings of Hidden Markov Models
Song, L., Boots, B., Siddiqi, S. M., Gordon, G. J., & Smola, A. J. (2018) · Figshare · doi:10.1184/r1/6475772 · Cited by 161
A spectral algorithm for learning mixtures of distributions
Vempala, S., & Wang, G. J. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181888 · Cited by 144
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians
Dasgupta, S., & Schulman, L. J. (2007) · CaltechAUTHORS (California Institute of Technology) · doi:10.5555/1248659.1248666 · Cited by 134
The Spectral Method for General Mixture Models
Kannan, R., Salmasian, H., & Vempala, S. (2005) · Lecture notes in computer science · doi:10.1007/11503415_30 · Cited by 115
Isotropic PCA and Affine-Invariant Clustering
Brubaker, S. C., & Vempala, S. (2008) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.48 · Cited by 98
Reduced-Rank Hidden Markov ModelsPreprint
Siddiqi, S. M., Boots, B., & Gordon, G. J. (2009) · arXiv (Cornell University) · doi:10.1184/r1/6476282 · Cited by 97
Realizations by stochastic finite automata
Carlyle, J. W., & Paz, A. (1971) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(71)80005-3 · Cited by 92
Learning Mixtures of Product Distributions using Correlations and Independence
Chaudhuri, K., & Rao, S. B. (n.d.) · Cited by 90
Learning nonsingular phylogenies and hidden Markov models
Mossel, E., & Roch, S. (2006) · The Annals of Applied Probability · doi:10.1214/105051606000000024 · Cited by 69
Surveys in Combinatorics, 1989: Invited Papers at the Twelfth British Combinatorial Conference
Siemons, J. (1989) · Cambridge University Press eBooks · doi:10.1017/cbo9781107359949 · Cited by 65
Isotropic PCA and Affine-Invariant Clustering
Brubaker, S. C., & Vempala, S. (2008) · Bolyai Society mathematical studies · doi:10.1007/978-3-540-85221-6_8 · Cited by 52
On the Learnability of Hidden Markov Models
Terwijn, S. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45790-9_21 · Cited by 28
The Value of Observation for Monitoring Dynamic Systems
Even-Dar, E., Kakade, S. M., & Mansour, Y. (n.d.) · Cited by 11
Self-citation
Cited by
Tensor decompositions for learning latent variable models
(2012) · arXiv (Cornell University) · doi:10.5555/2627435.2697055 · Cited by 779
Self-citationKernel Mean Embedding of Distributions: A Review and Beyond
Muandet, K., Fukumizu, K., Sriperumbudur, B., & Schölkopf, B. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000060 · Cited by 409
A Latent Variable Model Approach to PMI-based Word Embeddings
Arora, S., Li, Y., Liang, Y., Ma, T., & Risteski, A. (2016) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00106 · Cited by 286
Causal Effect Inference with Deep Latent-Variable Models
Louizos, C., Shalit, U., Mooij, J. M., Sontag, D. A., Zemel, R. S., & Welling, M. (2017) · UvA-DARE (University of Amsterdam) · doi:10.48550/arxiv.1705.08821 · Cited by 267
Rodosthenous, T., Shahrezaei, V., & Evangelou, M. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa530 · Cited by 67
Metadata
- Authors
- Hsu, D., Kakade, S. M., & Zhang, T.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2012-09
- Volume
- 78
- Issue
- 5
- Pages
- 1460-1480
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W1825640910
- Cited by
- 278
- References
- 32
- FWCI
- 28.81
- Type
- journal article
- Language
- en
- Open access
- bronze
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.
