Scalable parallel clustering approach for large data using parallel K means and firefly algorithms

This paper mainly focuses in identifying the limitations of the k means algorithm and to propose the parallelization of the k-means using firefly based clustering method. The new parallel architecture can handle large number of clusters. Firefly algorithm to find initial optimal cluster centroid and then k-means algorithm with optimized centroid to refined them and improve clustering accuracy. The final convergence issue is also addressed and solved to a great extent. Finally modified algorithm is compared with parallel k means is demonstrated with experiments and it has been found that the performance of modified algorithm is better than the existing algorithm. Four typical benchmark data sets from the UCI machine learning repository are used to demonstrate the results of the techniques. To achieve this we can use fork/join method in java programming. It is the most effective design method for achieve good parallel performance.