{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:12:01Z","timestamp":1760706721817,"version":"3.41.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1023\/a:1007301011561","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T04:48:21Z","timestamp":1040532501000},"page":"97-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["A Comparison of New and Old Algorithms for a Mixture Estimation Problem"],"prefix":"10.1007","volume":"27","author":[{"given":"David P.","family":"Helmbold","sequence":"first","affiliation":[]},{"given":"Robert E.","family":"Schapire","sequence":"additional","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abe, N., Takeuchi, J., and Warmuth, M. (1991). Polynomial learnability of probablistic concepts with respect to the Kullback-Leibler divergence. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 277-289. Morgan Kaufmann.","key":"130973_CR1","DOI":"10.1016\/B978-1-55860-213-7.50029-8"},{"key":"130973_CR2","volume-title":"Neuro-Computing: Algorithms, Architectures, and Applications","author":"J. Bridle","year":"1989","unstructured":"Bridle, J. (1989). Probabilistic interpretation of feedforward classification network outputs with relationships to statistical pattern recognition. In Fogelman-Souli, F. and H\u00e9rault, J., editors, Neuro-Computing: Algorithms, Architectures, and Applications. New York: Springer Verlag."},{"issue":"1","key":"130973_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1467-9965.1991.tb00002.x","volume":"1","author":"T. Cover","year":"1991","unstructured":"Cover, T. (1991). Universal portfolios. Mathematical Finance, 1(1):1-29.","journal-title":"Mathematical Finance"},{"key":"130973_CR4","first-page":"1","volume":"B39","author":"A. Dempster","year":"1977","unstructured":"Dempster, A., Laird, N., and Rubin, D. (1977). Maximum-likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, B39:1-38.","journal-title":"Journal of the Royal Statistical Society"},{"unstructured":"Duda, R. and Hart, P. (1973). Pattern Classification and Scene Analysis. Wiley.","key":"130973_CR5"},{"unstructured":"Golub, G. and Van Loan, C. (1989). Matrix Computations. Johns-Hopkins University Press.","key":"130973_CR6"},{"key":"130973_CR7","first-page":"243","volume-title":"Proc. 13th International Conference on Machine Learning","author":"D. Helmbold","year":"1996","unstructured":"Helmbold, D., Schapire, R. E., Singer, Y., and Warmuth, M. K. (1996). On-line portfolio selection using multiplicative updates. In Proc. 13th International Conference on Machine Learning, pages 243-251. Morgan Kaufmann, San Francisco."},{"doi-asserted-by":"crossref","unstructured":"Kivinen, J. and Warmuth, M. (1995a). Additive versus exponentiated gradient updates. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing.","key":"130973_CR8","DOI":"10.1145\/225058.225121"},{"doi-asserted-by":"crossref","unstructured":"Kivinen, J. and Warmuth, M. (1995b). The perceptron algorithm vs. winnow: linear vs. logarithmic mistake bounds when few input variables are relevant. In Proceedings of the Eighth Annual Workshop on Computational Learning Theory.","key":"130973_CR9","DOI":"10.1145\/225298.225333"},{"key":"130973_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1022869011914","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318.","journal-title":"Machine Learning"},{"unstructured":"Luenberger, D. (1984). Linear and Nonlinear Programming. Addison-Wesley.","key":"130973_CR11"},{"key":"130973_CR12","volume-title":"Bayesian Statistics, 4","author":"X. Meng","year":"1992","unstructured":"Meng, X. and Rubin, D. (1992). Recent extensions of the EM algorithm (with discussion). In Bernardo, J., Berger, J., Dawid, A., and Smith, A., editors, Bayesian Statistics, 4. Oxfod: Clarendon Press."},{"unstructured":"Neal, R. and Hinton, G. (1993). A new view of the EM algorithm that justifies incremental and other variants. Unpublished manuscript.","key":"130973_CR13"},{"key":"130973_CR14","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1137\/0135032","volume":"35","author":"B. Peters","year":"1978","unstructured":"Peters, B. and Walker, H. (1978a). An iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions. SIAM Journal of Applied Mathematics, 35:362-378.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"130973_CR15","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/0135036","volume":"35","author":"B. Peters","year":"1978","unstructured":"Peters, B. and Walker, H. (1978b). The numerical evaluation of the maximum-likelihood estimates of a subset of mixture proportions. SIAM Journal of Applied Mathematics, 35:447-452.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"130973_CR16","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1026034","volume":"26","author":"R. Redner","year":"1984","unstructured":"Redner, R. and Walker, H. (1984). Mixture densities, maximum likelihood, and the EM algorithm. Siam Review, 26:195-239.","journal-title":"Siam Review"},{"unstructured":"Singer, Y. and Warmuth, M. (1996). Training algorithms for hidden markov models using entropy based distance functions. To appear in Advances in Neural Information Processing Systems, 8.","key":"130973_CR17"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007301011561.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007301011561\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007301011561.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:44:43Z","timestamp":1752147883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007301011561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["130973"],"URL":"https:\/\/doi.org\/10.1023\/a:1007301011561","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[1997,4]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}