{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:55Z","timestamp":1763467735222},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,5,26]],"date-time":"2006-05-26T00:00:00Z","timestamp":1148601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2006,9,25]]},"DOI":"10.1007\/s10618-005-0033-3","type":"journal-article","created":{"date-parts":[[2006,5,25]],"date-time":"2006-05-25T18:30:34Z","timestamp":1148581834000},"page":"291-307","source":"Crossref","is-referenced-by-count":34,"title":["Accelerated EM-based clustering of large data sets"],"prefix":"10.1007","volume":"13","author":[{"given":"Jakob J.","family":"Verbeek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan R. J.","family":"Nunnink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Vlassis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Comm ACM 18(9):509\u2013517","DOI":"10.1145\/361002.361007"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Bishop CM, Svens\u00e9n M, Williams CKI (1998) GTM: The generative topographic mapping. Neur Comput 10:215\u2013234","DOI":"10.1162\/089976698300017953"},{"key":"33_CR3","unstructured":"Bradley PS, Fayyad UM, Reina CA (1998) Scaling EM (expectation maximization) clustering to large databases. Technical Report MSR-TR-98-35, Microsoft Research"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Dasgupta S (1999) Learning mixtures of Gaussians. In: Proceedings of the IEEE Symposium on Foundations of Computer Science, vol. 40. IEEE Computer Society Press, Los Alamitos, CA, USA, pp 634\u2013644","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J Royal Stat Soc Ser B (Methodological) 39(1):1\u201338","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Gersho A, Gray RM (1992) Vector quantization and signal compression. Kluwer Academic Publishers, Boston","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Kanungo T, Mount DM, Netanyahu N, Piatko C, Silverman R, Wu AY (2002) An efficient k-means clustering algorithm: Analysis and implementation. Trans Patt Anal Mach Intell 24:881\u2013892","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"33_CR8","unstructured":"Li JQ, Barron AR (2000) Mixture density estimation. In: Solla SA, Leen TK, M\u00fcller K-R (eds) Advances in neural information processing systems, vol. 12. MIT Press, Cambridge, MA, USA, pp 279\u2013285"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Lindsay BG (1983) The geometry of mixture likelihoods: A general theory. Ann Stat 11(1):86\u201394","DOI":"10.1214\/aos\/1176346059"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"McCallum A, Nigam K, Ungar L (2000) Efficient clustering of high-dimensional data sets with application to reference matching. In: Ramakrishnan R, Stolfo S (eds) Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, vol. 6. ACM Press, New-York, NY, USA","DOI":"10.1145\/347090.347123"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"McLachlan GJ, Peel D (2000) Finite mixture models. John Wiley & Sons","DOI":"10.1002\/0471721182"},{"key":"33_CR12","unstructured":"Moore A (1999) Very fast EM-based mixture model clustering using multiresolution kd-trees. In: Kearns MJ, Solla SA, Cohn DA (eds) Advances in Neural information processing systems, vol. 11. MIT Press, Cambridge, MA, USA, pp 543\u2013549"},{"key":"33_CR13","unstructured":"Moore A, Pelleg D (1999) Accelerating exact k-means algorithms with geometric reasoning. In: Proc 5th Int Conf Knowledge Discovery and Data Mining, pp 277\u2013281"},{"key":"33_CR14","unstructured":"Moore AW (2000) The anchors hierarchy: Using the triangle inequality to survive high-dimensional data. In: Boutilier C, Goldszmidt M (eds) Proceedings of the Annual conference on uncertainty in artificial intelligence, vol. 16. Morgan Kaufmann, San Mateo, CA, USA, pp 397\u2013405"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Moore AW, Lee MS (1998) Cached sufficient statistics for efficient machine learning with large data sets. J Arti Intell Res 8:67\u201391","DOI":"10.1613\/jair.453"},{"key":"33_CR16","unstructured":"Neal RM, Hinton GE (1998) A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Jordan MI (eds) Learning in graphical models. Kluwer, Boston, MA, USA, pp 355\u2013368"},{"key":"33_CR17","unstructured":"Nunnink JRJ (2003) Large scale Gaussian mixture modelling using a greedy expectation-maximisation algorithm. Master's thesis, Informatics Institute, University of Amsterdam. www.science.uva.nl\/research\/ias\/alumni\/m.sc.theses"},{"key":"33_CR18","unstructured":"Omohundro SM (1989) Five balltree construction algorithms. Technical Report TR-89-063, International Computer Science Institute, Berkeley"},{"key":"33_CR19","unstructured":"Rose K (1998) Deterministic annealing for clustering, compression, classification, regression and related optimization proble ms. IEEE Trans Inform The 86(11):2210\u20132239"},{"key":"33_CR20","unstructured":"Sand P, Moore AW (2001) Repairing faulty mixture models using density estimation. In: Brodley CE, Danyluk AP (eds) Proceedings of the international conference on machine learning, vol. 18. Morgan Kaufmann, San Mateo, CA, USA, pp 457\u2013464"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Sproull RF (1991) Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6:579\u2013589","DOI":"10.1007\/BF01759061"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Thiesson B, Meek C, Heckerman D (2001). Accelerating EM for large databases. Mach Learn 45(3):279\u2013299","DOI":"10.1023\/A:1017986506241"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Titsias M, Likas A (2001) Shared kernel models for class conditional density estimation. IEEE Trans Neur Netw 12(5):987\u2013997","DOI":"10.1109\/72.950129"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Verbeek JJ, Vlassis N, Kr\u00f6se BJA (2003) Efficient greedy learning of Gaussian mixture models. Neur Comput 15(2):469\u2013485","DOI":"10.1162\/089976603762553004"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Vlassis N, Likas A (2002) A greedy EM algorithm for Gaussian mixture learning. Neur Proc Lett 15(1):77\u201387","DOI":"10.1023\/A:1013844811137"},{"key":"33_CR26","unstructured":"Zhang T (2002) A general greedy approximation algorithm with applications. In: Dietterich TG, Becker S, Ghahramani Z (eds) Advances in neural information processing systems, vol. 14. MIT Press, Cambridge, MA, USA"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-005-0033-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-005-0033-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-005-0033-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:29:39Z","timestamp":1559244579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-005-0033-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,26]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,9,25]]}},"alternative-id":["33"],"URL":"https:\/\/doi.org\/10.1007\/s10618-005-0033-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,26]]}}}