Accelerated EM-based clustering of large data sets
Open Access
- 26 May 2006
- journal article
- Published by Springer Science and Business Media LLC in Data Mining and Knowledge Discovery
- Vol. 13 (3), 291-307
- https://doi.org/10.1007/s10618-005-0033-3
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Learning mixtures of GaussiansPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An efficient k-means clustering algorithm: analysis and implementationIeee Transactions On Pattern Analysis and Machine Intelligence, 2002
- Finite Mixture ModelsWiley Series in Probability and Statistics, 2000
- Efficient clustering of high-dimensional data sets with application to reference matchingPublished by Association for Computing Machinery (ACM) ,2000
- Accelerating exactk-means algorithms with geometric reasoningPublished by Association for Computing Machinery (ACM) ,1999
- GTM: The Generative Topographic MappingNeural Computation, 1998
- Vector Quantization and Signal CompressionPublished by Springer Science and Business Media LLC ,1992
- The Geometry of Mixture Likelihoods: A General TheoryThe Annals of Statistics, 1983
- Maximum Likelihood from Incomplete Data Via the EM AlgorithmJournal of the Royal Statistical Society: Series B (Methodological), 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975