Journal Press India^®

Author Details ( * ) denotes Corresponding author

Clustering big data using data mining algorithms is a modern approach, used in various science and medical fields. k-means clustering algorithm is a good approach for clustering, but choosing initial centers and provides less accuracy guarantees. The enhanced k-means approach called 𝑘-means++ chooses one center uniformly at random provides better functionality, but fails to handle data of larger volume in distributed environment. The mapreduce 𝑘-means++ method handles k-means++ algorithm by enhancing it in mapper and reducer phases, also reduces the no of iterations required to obtain 𝑘 centers. in which the 𝑘-means++ initialization algorithm is executed in the mapper phase and the weighted 𝑘-means++ initialization algorithm is run in the reducer phase. it reduces huge amount of communication and i/o costs. the proposed mapreduce 𝑘-means++ method obtains (𝛼2) approximation to the optimal solution of 𝑘-means.

Keywords

VANET; MANET; ZRP; LAR; IDM; Vanet Mobi Sim; ns2

1. E. Chandra, V. P. Anuradha, A survery on clustering algorithms for data in spatial database management systems," Computer Applications, 24(9), 2011, 19-26


2. J. F. Lu, J. B. Tang, Z. M. Tang, J. Y. Yang, Hierarchicalinitialization approach for k-means clustering, Pattern Recogn. Lett., 6, 2008, 787-795


3. D. Arthur, S. Vassilvitskii, K-means++: The advantages ofcareful seeding, in Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007, 1027-1035


4. [4] B. Bahmani, B. Moseley, A. Vattani, R. Kumar, and S. Vassilvitskii, "Scalable k-means++, PVLDB, 5(7), 2012, 622-633


5. S. Papadimitriou, J. Sun, Disco: Distributed co-clusteringwith map-reduce: A case study towards petabyte-scale end-to-endmining, in Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, 2008, 512-521


6. A. Ene, S. Im, B. Moseley, Fast clustering using mapreduce, in Proceedings of the 17th ACM SIGKDD


7. International Conference on Knowledge Discovery and Data Mining, 2011, 681-689


8. R. L. Ferreira Cordeiro, C. Traina, Junior, A. J. Machado Traina, J. L'opez, U. Kang, C. Faloutsos, Clustering very large Multidimensional datasets with mapreduce, in Proceedings of the 17thACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011, 690-698


9. S. Lloyd, Least squares quantization in pcm, Information Theory, IEEE Transactions on, 28(2), 1982, 129-137


10. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, A. Y. Wu, A local search approximation algorithm for k-means clustering, Comput. Geom. Theory Appl, 28(2-3), 2004, 89-112


11. M. Song, S. Rajasekaran, Fast k-means algorithms with constant approximation, in Algorithms and Computation, 2005, 1029-1038