Data quantity of Big Data was too big to be processed with traditional clustering analysis technologies. Time consuming was long, problem of computability existed with traditional technologies. Having analyzed on k-means clustering algorithm, a new algorithm was proposed. Parallelizing part of k-means was found. The algorithm was improved with the method of redesigning flow with MapReduce framework. Problems mentioned above were solved. Experiments show that new algorithm is feasible and effective.
CITATION STYLE
Yuan, Y. M., & Wu, C. L. (2012). Research on Clustering Analysis of Big Data. Advanced Engineering Forum, 6–7, 82–87. https://doi.org/10.4028/www.scientific.net/aef.6-7.82
Mendeley helps you to discover research relevant for your work.