{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T07:43:58Z","timestamp":1792136638446,"version":"4.4.0"},"reference-count":33,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1016\/j.jcss.2011.12.025","type":"journal-article","created":{"date-parts":[[2012,1,18]],"date-time":"2012-01-18T16:03:58Z","timestamp":1326902638000},"page":"1460-1480","source":"Crossref","is-referenced-by-count":148,"title":["A spectral algorithm for learning Hidden Markov Models"],"prefix":"10.1016","volume":"78","author":[{"given":"Daniel","family":"Hsu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sham M.","family":"Kakade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2011.12.025_br0010","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0304-4149(03)00086-3","article-title":"Linear optimal prediction and innovations representations of hidden Markov models","volume":"108","author":"Andersson","year":"2003","journal-title":"Stochastic Process. Appl."},{"issue":"3","key":"10.1016\/j.jcss.2011.12.025_br0020","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1090\/S0002-9904-1967-11751-8","article-title":"An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology","volume":"73","author":"Baum","year":"1967","journal-title":"Bull. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.jcss.2011.12.025_br0030","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1214\/aoms\/1177697196","article-title":"A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains","volume":"41","author":"Baum","year":"1970","journal-title":"Ann. of Math. Statist."},{"key":"10.1016\/j.jcss.2011.12.025_br0040","doi-asserted-by":"crossref","unstructured":"S. Charles Brubaker, Santosh Vempala, Isotropic PCA and affine-invariant clustering, in: FOCS, 2008.","DOI":"10.1109\/FOCS.2008.48"},{"key":"10.1016\/j.jcss.2011.12.025_br0050","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/S0022-0000(71)80005-3","article-title":"Realization by stochastic finite automaton","volume":"5","author":"Carlyle","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jcss.2011.12.025_br0060","unstructured":"Kamalika Chaudhuri, Satish Rao, Learning mixtures of product distributions using correlations and independence, in: COLT, 2008."},{"key":"10.1016\/j.jcss.2011.12.025_br0070","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/j.jcss.2011.12.025_br0080","unstructured":"G. Cybenko, V. Crespi, Learning Hidden Markov Models using non-negative matrix factorization, Technical report, 2008, arXiv:0809.4086."},{"key":"10.1016\/j.jcss.2011.12.025_br0090","unstructured":"Sanjoy Dasgupta, Learning mixutres of Gaussians, in: FOCS, 1999."},{"issue":"February","key":"10.1016\/j.jcss.2011.12.025_br0100","first-page":"203","article-title":"A probabilistic analysis of EM for mixtures of separated, spherical Gaussians","volume":"8","author":"Dasgupta","year":"2007","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"10.1016\/j.jcss.2011.12.025_br0110","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster","year":"1977","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"10.1016\/j.jcss.2011.12.025_br0120","unstructured":"Even-Dar Eyal, Sham M. Kakade, Yishay Mansour, Planning in POMDPs using multiplicity automata, in: UAI, 2005."},{"key":"10.1016\/j.jcss.2011.12.025_br0130","unstructured":"Even-Dar Eyal, Sham M. Kakade, Yishay Mansour, The value of observation for monitoring dynamic systems, in: IJCAI, 2007."},{"key":"10.1016\/j.jcss.2011.12.025_br0140","first-page":"197","article-title":"Matrices deHankel","volume":"53","author":"Fliess","year":"1974","journal-title":"J. Math. Pures Appl."},{"key":"10.1016\/j.jcss.2011.12.025_br0150","doi-asserted-by":"crossref","DOI":"10.1037\/h0058165","article-title":"The most predictable criterion","author":"Hotelling","year":"1935","journal-title":"J. Educ. Psychol."},{"issue":"6","key":"10.1016\/j.jcss.2011.12.025_br0160","doi-asserted-by":"crossref","DOI":"10.1162\/089976600300015411","article-title":"Observable operator models for discrete stochastic time series","volume":"12","author":"Jaeger","year":"2000","journal-title":"Neural Comput."},{"key":"10.1016\/j.jcss.2011.12.025_br0170","series-title":"New Directions in Statistical Signal Processing: From Systems to Brain","first-page":"417","article-title":"Learning observable operator models via the es algorithm","author":"Jaeger","year":"2006"},{"key":"10.1016\/j.jcss.2011.12.025_br0180","series-title":"Subspace Methods for System Identification","author":"Katayama","year":"2005"},{"key":"10.1016\/j.jcss.2011.12.025_br0190","doi-asserted-by":"crossref","unstructured":"M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, L. Sellie, On the learnability of discrete distributions, in: STOC, 1994, pp. 273\u2013282.","DOI":"10.1145\/195058.195155"},{"key":"10.1016\/j.jcss.2011.12.025_br0200","unstructured":"Michael Littman, Richard Sutton, Singh Satinder, Predictive representations of state, in: Advances in Neural Information Processing Systems 14 (NIPS), 2001, pp. 1555\u20131561."},{"key":"10.1016\/j.jcss.2011.12.025_br0210","series-title":"System Identification: Theory for the User","author":"Ljung","year":"1987"},{"key":"10.1016\/j.jcss.2011.12.025_br0220","series-title":"Surveys in Combinatorics","first-page":"148","article-title":"On the method of bounded differences","author":"McDiarmid","year":"1989"},{"issue":"2","key":"10.1016\/j.jcss.2011.12.025_br0230","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1214\/105051606000000024","article-title":"Learning nonsingular phylogenies and Hidden Markov Models","volume":"16","author":"Mossel","year":"2006","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/j.jcss.2011.12.025_br0240","series-title":"Subspace Identification of Linear Systems","author":"Overschee","year":"1996"},{"issue":"2","key":"10.1016\/j.jcss.2011.12.025_br0250","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/5.18626","article-title":"A tutorial on Hidden Markov Models and selected applications in speech recognition","volume":"77","author":"Rabiner","year":"1989","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.jcss.2011.12.025_br0260","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","article-title":"On the definition of a family of automata","volume":"4","author":"Sch\u00fctzenberger","year":"1961","journal-title":"Inform. Control"},{"key":"10.1016\/j.jcss.2011.12.025_br0270","unstructured":"S.M. Siddiqi, B. Boots, G.J. Gordon, Reduced-rank Hidden Markov Models, in: Proceedings of the 13th International Conference on Artificial Intelligence and Statistics, 2010."},{"key":"10.1016\/j.jcss.2011.12.025_br0280","unstructured":"Le Song, Byron Boots, Sajid M. Siddiqi, Geoffrey J. Gordon, Alex Smola, Hilbert space embeddings of Hidden Markov Models, in: Proceedings of the 27th International Conference on Machine Learning, 2010."},{"key":"10.1016\/j.jcss.2011.12.025_br0290","series-title":"Matrix Perturbation Theory","author":"Stewart","year":"1990"},{"key":"10.1016\/j.jcss.2011.12.025_br0300","doi-asserted-by":"crossref","unstructured":"Sebastiaan Terwijn, On the learnability of Hidden Markov Models, in: International Colloquium on Grammatical Inference, 2002.","DOI":"10.1007\/3-540-45790-9_21"},{"key":"10.1016\/j.jcss.2011.12.025_br0310","doi-asserted-by":"crossref","unstructured":"B. Vanluyten, J. Willems, B. De Moor, A new approach for the identification of Hidden Markov Models, in: Conference on Decision and Control, 2007.","DOI":"10.1109\/CDC.2007.4434912"},{"key":"10.1016\/j.jcss.2011.12.025_br0320","doi-asserted-by":"crossref","unstructured":"Santosh Vempala, Grant Wang, A spectral algorithm for learning mixtures of distributions, in: FOCS, 2002.","DOI":"10.1109\/SFCS.2002.1181888"},{"key":"10.1016\/j.jcss.2011.12.025_br0330","unstructured":"MingJie Zhao, Herbert Jaeger, The error controlling algorithm for learning OOMs, Technical report 6, International University Bremen, 2007."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000012000244?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000012000244?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T23:45:51Z","timestamp":1713397551000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000012000244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["S0022000012000244"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2011.12.025","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}