Parallel bisecting k-means with prediction clustering algorithm
- 1 January 2007
- journal article
- Published by Springer Science and Business Media LLC in The Journal of Supercomputing
- Vol. 39 (1), 19-37
- https://doi.org/10.1007/s11227-006-0002-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Efficient disk-based K-means clustering for relational databasesIEEE Transactions on Knowledge and Data Engineering, 2004
- Empirical and Theoretical Comparisons of Selected Criterion Functions for Document ClusteringMachine Learning, 2004
- Data clusteringACM Computing Surveys, 1999
- LogPCommunications of the ACM, 1996
- Scatter/Gather: a cluster-based approach to browsing large document collectionsPublished by Association for Computing Machinery (ACM) ,1992
- An algorithm for generating artificial test clustersPsychometrika, 1985
- The complexity of the generalized Lloyd - Max problem (Corresp.)IEEE Transactions on Information Theory, 1982
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948