{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T02:10:01Z","timestamp":1736561401575,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352945"},{"type":"electronic","value":"9783540352969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_5","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T14:49:15Z","timestamp":1159454955000},"page":"20-34","source":"Crossref","is-referenced-by-count":30,"title":["PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption"],"prefix":"10.1007","author":[{"given":"Jon","family":"Feldman","sequence":"first","affiliation":[]},{"given":"Rocco A.","family":"Servedio","sequence":"additional","affiliation":[]},{"given":"Ryan","family":"O\u2019Donnell","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/11503415_31","volume-title":"Learning Theory","author":"D. Achlioptas","year":"2005","unstructured":"Achlioptas, D., McSherry, F.: On spectral learning of mixtures of distributions. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol.\u00a03559, pp. 458\u2013469. Springer, Heidelberg (2005)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Kannan, R.: Learning mixtures of arbitrary Gaussians. In: Proceedings of the 33rd Symposium on Theory of Computing, pp. 247\u2013257 (2001)","DOI":"10.1145\/380752.380808"},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley, Chichester (1991)"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/S0097539798342496","volume":"31","author":"M. Cryan","year":"2002","unstructured":"Cryan, M., Goldberg, L., Goldberg, P.: Evolutionary trees can be learned in polynomial time in the two state general Markov model. SIAM Journal on Computing\u00a031(2), 375\u2013397 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Dasgupta, S.: Learning mixtures of gaussians. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 634\u2013644 (1999)","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"5_CR6","unstructured":"Dasgupta, S., Schulman, L.: A Two-round Variant of EM for Gaussian Mixtures. In: Proceedings of the 16th Conf. on UAI, pp. 143\u2013151 (2000)"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Royal Stat. Soc. Ser. B\u00a039, 1\u201338 (1977)","journal-title":"J. Royal Stat. Soc. Ser. B"},{"key":"5_CR8","unstructured":"Feldman, J., O\u2019Donnell, R., Servedio, R.: PAC learning mixtures of Gaussians with no separation assumption. available at: http:\/\/research.microsoft.com\/~odonnell"},{"key":"5_CR9","unstructured":"Feldman, J., O\u2019Donnell, R., Servedio, R.: Learning mixtures of product distributions over discrete domains. In: Proc. 46th IEEE FOCS, pp. 501\u2013510 (2005)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/inco.1997.2648","volume":"138","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Kearns, M., Ron, D., Rubinfeld, R., Schapire, R., Sellie, L.: Efficient learning of typical finite automata from random walks. Information and Computation\u00a0138(1), 23\u201348 (1997)","journal-title":"Information and Computation"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Freund, Y., Mansour, Y.: Estimating a mixture of two product distributions. In: Proceedings of the 12th Annual COLT, pp. 183\u2013192 (1999)","DOI":"10.1145\/307400.307412"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11503415_30","volume-title":"Learning Theory","author":"R. Kannan","year":"2005","unstructured":"Kannan, R., Salmasian, H., Vempala, S.S.: The spectral method for general mixture\u00a0models. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS, vol.\u00a03559, pp. 444\u2013457. Springer, Heidelberg (2005)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kearns, M., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R., Sellie, L.: On the learnability of discrete distributions. In: Proc. 26th STOC, pp. 273\u2013282 (1994)","DOI":"10.1145\/195058.195155"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Lindsay, B.: Mixture models: theory, geometry and applications. Institute for Mathematical Statistics (1995)","DOI":"10.1214\/cbms\/1462106013"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M.: Evaluation be easier than generation. In: Proceedings of the 28th Symposium on Theory of Computing (STOC), pp. 74\u201383 (1996)","DOI":"10.1145\/237814.237833"},{"key":"5_CR16","volume-title":"Statistical analysis of finite mixture distributions","author":"D.M. Titterington","year":"1985","unstructured":"Titterington, D.M., Smith, A.F.M., Makov, U.E.: Statistical analysis of finite mixture distributions. Wiley & Sons, Chichester (1985)"},{"issue":"11","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L.: A theory of the learnable. Communications of the ACM\u00a027(11), 1134\u20131142 (1984)","journal-title":"Communications of the ACM"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Vempala, S., Wang, G.: A spectral algorithm for learning mixtures of distributions. In: Proceedings of the 43rd IEEE FOCS, pp. 113\u2013122 (2002)","DOI":"10.1109\/SFCS.2002.1181888"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T01:40:10Z","timestamp":1736559610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11776420_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}