{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T08:24:05Z","timestamp":1751531045079,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":10,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307688"},{"type":"electronic","value":"9780387301648"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-387-30164-8_554","type":"book-chapter","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T17:30:36Z","timestamp":1293643836000},"page":"686-689","source":"Crossref","is-referenced-by-count":2,"title":["Model-Based Clustering"],"prefix":"10.1007","author":[{"given":"Arindam","family":"Banerjee","sequence":"first","affiliation":[]},{"given":"Hanhuai","family":"Shan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"554_CR1_554","first-page":"1705","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I., & Ghosh, J. (2005). Clustering with Bregman divergences. Journal of Machine Learning Research, 6, 1705\u20131749.","journal-title":"Journal of Machine Learning Research"},{"key":"554_CR2_554","unstructured":"Bilmes, J. (1997). A gentle tutorial on the EM algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models. Technical Report ICSI-TR-97-02, University of Berkeley."},{"key":"554_CR3_554","first-page":"993","volume":"3","author":"DM Blei","year":"2003","unstructured":"Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent dirichlet allo- cation. Journal of Machine Learning Research, 3, 993\u20131022.","journal-title":"Journal of Machine Learning Research"},{"key":"554_CR4_554","volume-title":"IEEE Symposium on foundations of Computer Science (FOCS","author":"S Dasgupta","year":"1999","unstructured":"Dasgupta, S. (1999). Learning mixtures of Gaussians. IEEE Symposium on foundations of Computer Science (FOCS). Washington, DC: IEEE Press."},{"issue":"1","key":"554_CR5_554","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39(1), 1\u201338.","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"554_CR6_554","doi-asserted-by":"crossref","unstructured":"Kannan, R., Salmasian, H., & Vempala, S. (2005). The spectral method for general mixture models. Conference on Learning Theory (COLT).","DOI":"10.1007\/11503415_30"},{"key":"554_CR7_554","volume-title":"The EM algorithm and extensions","author":"GJ McLachlan","year":"1996","unstructured":"McLachlan, G. J., & Krishnan, T. (1996). The EM algorithm and extensions. New York: Wiley-Interscience."},{"key":"554_CR8_554","volume-title":"Finite mixture models. Wiley series in probability and mathematical statistics: Applied probability and statistics section","author":"GJ McLachlan","year":"2000","unstructured":"McLachlan, G. J., & Peel, D. (2000). Finite mixture models. Wiley series in probability and mathematical statistics: Applied probability and statistics section. New York: Wiley."},{"key":"554_CR9_554","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-94-011-5014-9_12","volume-title":"Learning in graphical models","author":"RM Neal","year":"1998","unstructured":"Neal, R. M., & Hinton, G. E. (1998). A view of the EM algorithm that justifies incremental, sparse, and other variants. In M. I. Jordan (Ed.), Learning in graphical models (pp. 355\u2013368). Cambridge, MA: MIT Press."},{"issue":"2","key":"554_CR10_554","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1026034","volume":"26","author":"R Redner","year":"1984","unstructured":"Redner, R., & Walker, H. (1984). Mixture densities, maximum likelihood and the EM algorithm. SIAM Review, 26(2), 195\u2013239.","journal-title":"SIAM Review"}],"container-title":["Encyclopedia of Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30164-8_554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T02:40:48Z","timestamp":1703212848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30164-8_554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9780387307688","9780387301648"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30164-8_554","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}