{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:05Z","timestamp":1725486065927},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729259"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72927-3_47","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"628-629","source":"Crossref","is-referenced-by-count":5,"title":["Are There Local Maxima in the Infinite-Sample Likelihood of Gaussian Mixture Estimation?"],"prefix":"10.1007","author":[{"given":"Nathan","family":"Srebro","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Dasgupta, S.: Learning mixtures of gaussians. In: Proc. of the 40th Ann. Symp. on Foundations of Computer Science (1999)","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"47_CR2","unstructured":"Arora, S., Kannan, R.: Learning mixtures of arbitrary gaussians. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing (2001)"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.jcss.2003.11.008","volume":"68","author":"S. Vempala","year":"2004","unstructured":"Vempala, S., Wang, G.: A spectral algorithm for learning mixture models. J. Comput. Syst. Sci.\u00a068, 841\u2013860 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"47_CR4","unstructured":"Dasgupta, S., Schulman, L.: A two-round variant of em for gaussian mixtures. In: Proc. of the 16th Ann. Conf. on Uncertainty in Artificial Intelligence (2000)"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Srebro, N., Shakhnarovich, G., Roweis, S.: An investigation of computational and informational limits in gaussian mixture clustering. In: Proceedings of the 23rd International Conference on Machine learning (ICML) (2006)","DOI":"10.1145\/1143844.1143953"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y., Schulman, L.J., Swamy, C.: The effectiveness of lloyd-type methods for the k-means problem. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 165\u2013176 ( 2006)","DOI":"10.1109\/FOCS.2006.75"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:10Z","timestamp":1605762490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729259"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_47","relation":{},"subject":[]}}