A MapReduce-based K-means clustering algorithm
Authors:
- 20 September 2021
- journal article
- research article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (4) , 5181-5202
Abstract
No abstract availableKeywords
Funding Information
- The National Natural Science Foundation of China (41562019, 61762046)
- the national key Research and Development Program of China (2018YFC1504705)
This publication has 44 references indexed in Scilit:
- Human action recognition via multi-task learning base on spatial–temporal featureInformation Sciences, 2015
- Fast Gaussian kernel learning for classification tasks based on specially structured global optimizationNeural Networks, 2014
- Performance analysis of statistical optimal data fusion algorithmsInformation Sciences, 2014
- Multilayer Obstacle-Avoiding X-Architecture Steiner Minimal Tree Construction Based on Particle Swarm OptimizationIEEE Transactions on Cybernetics, 2014
- Toward efficient and privacy-preserving computing in big data eraIEEE Network, 2014
- A self‐guided search for good local minima of the sum‐of‐squared‐error in nonlinear least squares regressionJournal of Chemometrics, 2014
- A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reductionSoft Computing, 2014
- MapReduceCommunications of the ACM, 2008
- A Survey of Clustering Data Mining Techniques2006
- An extended study of the K-means algorithm for data clustering and its applicationsJournal of the Operational Research Society, 2004