Parallel implementation of ant-based clustering algorithm based on hadoop

9Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hadoop is a distributed system infrastructure of cloud computing. Based on the characteristics of ant-based clustering algorithm, the paper implements the parallelization of this algorithm using MapReduce on Hadoop. The Map function calculates the average similarity of the object with its neighborhood objects. The Reduce function processes the objects with the Map outputs and updates related information of both ants and the objects to get ready for the next job. Results on the Hadoop clusters show that our method can significantly improve the computational efficiency with the premise of maintaining clustering accuracy. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Yang, Y., Ni, X., Wang, H., & Zhao, Y. (2012). Parallel implementation of ant-based clustering algorithm based on hadoop. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7331 LNCS, pp. 190–197). https://doi.org/10.1007/978-3-642-30976-2_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free