{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:14:15Z","timestamp":1776885255715,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540413523","type":"print"},{"value":"9783540444183","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44418-1_13","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T05:00:14Z","timestamp":1186894814000},"page":"155-169","source":"Crossref","is-referenced-by-count":8,"title":["On-line Estimation of Hidden Markov Model Parameters"],"prefix":"10.1007","author":[{"given":"Jun","family":"Mizuno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuya","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuya","family":"Ueki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuyuki","family":"Amano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"key":"13_CR1","first-page":"205","volume":"9","author":"N. Abe","year":"1992","unstructured":"N. Abe and M. K. Warmuth. On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 9:205\u2013260, 1992.","journal-title":"Machine Learning"},{"key":"13_CR2","unstructured":"K. Azoury and M. K. Warmuth. Relative loss bounds for on-line density estimation with the exponential family of distributions. In 15th Conference on Uncertainty in Artificial Intelligence, 31\u201340, 1999. To appear in Machine Learning."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1162\/neco.1994.6.2.307","volume":"6","author":"P. Baldi","year":"1994","unstructured":"P. Baldi and Y. Chauvin. Smooth on-line learning algorithms for Hidden Markov Models. Neural Computation, 6:307\u2013318, 1994.","journal-title":"Neural Computation"},{"key":"13_CR4","first-page":"2261","volume":"4","author":"I. Collings","year":"1998","unstructured":"I. Collings and T. Ryd\u00e9n. A new maximum likelihood gradient algorithm for on-line Hidden Markov Model identification. In ICASSP 98, volume 4, 2261\u20132264, 1998.","journal-title":"ICASSP 98"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"M. Herbster and M. K. Warmuth. Tracking the best regressor. In Proc. 11th COLT, 24\u201331, 1998.","DOI":"10.1145\/279943.279949"},{"issue":"8","key":"13_CR6","doi-asserted-by":"publisher","first-page":"2557","DOI":"10.1109\/78.229888","volume":"41","author":"V. Krishnamurthy","year":"1993","unstructured":"V. Krishnamurthy and J. Moore. On-line estimation of Hidden Markov Model parameters based on the Kullback-Leibler information measure. IEEE Transaction on Signal Processing, 41(8):2557\u20132573, 1993.","journal-title":"IEEE Transaction on Signal Processing"},{"issue":"4","key":"13_CR7","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1002\/j.1538-7305.1983.tb03114.x","volume":"62","author":"S. E. Levinson","year":"1983","unstructured":"S. E. Levinson, L. R. Rabiner, and M. M. Sondhi. An introduction to the application of the theory of probabilistic functions of a markov process to automatic speech recognition. Bell System Technical Journal, 62(4):1035\u20131074, Apr. 1983.","journal-title":"Bell System Technical Journal"},{"key":"13_CR8","unstructured":"G. McLachlan and T. Krishnan. The EM Algorithm and Extensions. A Wiley-Interscience Publication, 1997."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1287\/moor.23.4.960","volume":"23","author":"E. Ordentlich","year":"1998","unstructured":"E. Ordentlich and T. Cover. The cost of achieving the best portfolio in hindsight. Mathematics of Operations Research, 23(4):960\u2013982, 1998.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.481776","volume":"42","author":"J. Rissanen","year":"1996","unstructured":"J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40\u201347, 1996.","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR11","unstructured":"J. Takeuchi and A. Barron. Asymptotically minimax regret for exponential families. In SITA\u2019 97, 665\u2013668, 1997."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"J. Takeuchi and A. Barron. Asymptotically minimax regret by bayes mixtures. In IEEE ISIT\u2019 98, 1998.","DOI":"10.1109\/ISIT.1998.708923"},{"key":"13_CR13","unstructured":"V. Vovk. Competitive on-line linear regression. Technical Report CSD-TR-97-13, Department of Computer Science, Royal Holloway, University of London, 1997."},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/18.825803","volume":"46","author":"Q. Xie","year":"2000","unstructured":"Q. Xie and A. Barron. Asymptotic minimax regret for data compression, gambling, and prediction. IEEE Trans. on Information Theory, 46(2):431\u2013445, 2000.","journal-title":"IEEE Trans. on Information Theory"},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/18.681319","volume":"44","author":"K. Yamanishi","year":"1998","unstructured":"K. Yamanishi. A decision-theoretic extension of stochastic complexity and its applications to learning. IEEE Transaction on Information Theory, 44(4):1424\u201339, July 1998.","journal-title":"IEEE Transaction on Information Theory"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"K. Yamanishi. Extended stochastic complexity and minimax relative loss analysis. In Proc. 10th ALT, volume 1720 of Lecture Notes in Artificial Intelligence, 26\u201338, 1999.","DOI":"10.1007\/3-540-46769-6_3"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44418-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T12:29:17Z","timestamp":1550752157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44418-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413523","9783540444183"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44418-1_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}