{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T20:03:24Z","timestamp":1746302604865,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_33","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T10:06:19Z","timestamp":1130148379000},"page":"349-359","source":"Crossref","is-referenced-by-count":4,"title":["Gossip-Based Greedy Gaussian Mixture Learning"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Vlassis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiannis","family":"Sfakianakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojtek","family":"Kowalczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471721182","volume-title":"Finite Mixture Models","author":"G.J. McLachlan","year":"2000","unstructured":"McLachlan, G.J., Peel, D.: Finite Mixture Models. John Wiley & Sons, Chichester (2000)"},{"key":"33_CR2","volume-title":"Advances in Neural Information Processing Systems","author":"A.W. Moore","year":"1999","unstructured":"Moore, A.W.: Very fast EM-based mixture model clustering using multiresolution kd-trees. In: Advances in Neural Information Processing Systems, vol.\u00a011. MIT Press, Cambridge (1999)"},{"issue":"2","key":"33_CR3","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1162\/089976699300016728","volume":"11","author":"M.E. Tipping","year":"1999","unstructured":"Tipping, M.E., Bishop, C.M.: Mixtures of probabilistic principal component analysers. Neural Computation\u00a011(2), 443\u2013482 (1999)","journal-title":"Neural Computation"},{"issue":"5","key":"33_CR4","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1109\/72.950129","volume":"12","author":"M. Titsias","year":"2001","unstructured":"Titsias, M., Likas, A.: Shared kernel models for class conditional density estimation. IEEE Trans. Neural Networks\u00a012(5), 987\u2013997 (2001)","journal-title":"IEEE Trans. Neural Networks"},{"key":"33_CR5","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. Roy. Statist. Soc. B\u00a039, 1\u201338 (1977)","journal-title":"J. Roy. Statist. Soc. B"},{"key":"33_CR6","unstructured":"Meila, M., Heckerman, D.: An experimental comparison of several clustering and initialization methods. In: Proc. 14th Ann. Conf. on Uncertainty in Artificial Intelligence, San Francisco, CA, pp. 386\u2013395 (1998)"},{"key":"33_CR7","volume-title":"Advances in Neural Information Processing Systems","author":"J.Q. Li","year":"2000","unstructured":"Li, J.Q., Barron, A.R.: Mixture density estimation. In: Advances in Neural Information Processing Systems, vol.\u00a012. The MIT Press, Cambridge (2000)"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1013844811137","volume":"15","author":"N. Vlassis","year":"2002","unstructured":"Vlassis, N., Likas, A.: A greedy EM algorithm for Gaussian mixture learning. Neural Processing Letters\u00a015(1), 77\u201387 (2002)","journal-title":"Neural Processing Letters"},{"issue":"2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1162\/089976603762553004","volume":"15","author":"J.J. Verbeek","year":"2003","unstructured":"Verbeek, J.J., Vlassis, N., Kr\u00f6se, B.: Efficient greedy learning of Gaussian mixture models. Neural Computation\u00a015(2), 469\u2013485 (2003)","journal-title":"Neural Computation"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1162\/089976600300015088","volume":"12","author":"N. Ueda","year":"2000","unstructured":"Ueda, N., Nakano, R., Ghahramani, Z., Hinton, G.E.: SMEM algorithm for mixture models. Neural Computation\u00a012, 2109\u20132128 (2000)","journal-title":"Neural Computation"},{"key":"33_CR11","volume-title":"Advances in Neural Information Processing Systems","author":"W. Kowalczyk","year":"2005","unstructured":"Kowalczyk, W., Vlassis, N.: Newscast EM. In: Saul, L.K., Weiss, Y., Bottou, L. (eds.) Advances in Neural Information Processing Systems, vol.\u00a017. MIT Press, Cambridge (2005)"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-94-011-5014-9_12","volume-title":"Learning in graphical models","author":"R.M. Neal","year":"1998","unstructured":"Neal, R.M., Hinton, G.E.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Jordan, M.I. (ed.) Learning in graphical models, pp. 355\u2013368. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"33_CR13","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumour spreading. In: Proc. 41th IEEE Symp. on Foundations of Computer Science, Redondo Beach, CA (2000)"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. 44th IEEE Symp. on Foundations of Computer Science, Cambridge, MA (2003)","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: Design, analysis and applications. In: Proc. IEEE Infocom, Miami, FL (2005)","DOI":"10.1109\/INFCOM.2005.1498447"},{"issue":"2","key":"33_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/380995.381010","volume":"2","author":"G. Forman","year":"2000","unstructured":"Forman, G., Zhang, B.: Distributed data clustering can be efficient and exact. ACM SIGKDD Explorations\u00a02(2), 34\u201338 (2000)","journal-title":"ACM SIGKDD Explorations"},{"issue":"8","key":"33_CR17","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1109\/TSP.2003.814623","volume":"51","author":"R.D. Nowak","year":"2003","unstructured":"Nowak, R.D.: Distributed EM algorithms for density estimation and clustering in sensor networks. IEEE Trans. on Signal Processing\u00a051(8), 2245\u20132253 (2003)","journal-title":"IEEE Trans. on Signal Processing"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Dasgupta, S.: Learning mixtures of Gaussians. In: Proc. IEEE Symp. on Foundations of Computer Science, New York (1999)","DOI":"10.1109\/SFFCS.1999.814639"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T04:58:22Z","timestamp":1736053102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11573036_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}