An improved hybrid canopy-fuzzy c-means clustering algorithm based on mapreduce model

12Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

The fuzzy c-means (FCM) is a frequently utilized algorithm at present. Yet, the clustering quality and convergence rate of FCM are determined by the initial cluster centers, and so an improved FCM algorithm based on canopy cluster concept to quickly analyze the dataset has been proposed. Taking advantage of the canopy algorithm for its rapid acquisition of cluster centers, this algorithm regards the cluster results of canopy as the input. In this way, the convergence rate of the FCM algorithm is accelerated. Meanwhile, the MapReduce scheme of the proposed FCM algorithm is designed in a cloud environment. Experimental results demonstrate the hybrid canopy-FCM clustering algorithm processed by MapReduce be endowed with better clustering quality and higher operation speed. Copyright 2016. The Korean Institute of Information Scientists and Engineers.

Author supplied keywords

Cite

CITATION STYLE

APA

Dai, W., Yu, C., & Jiang, Z. (2016). An improved hybrid canopy-fuzzy c-means clustering algorithm based on mapreduce model. Journal of Computing Science and Engineering, 10(1), 1–8. https://doi.org/10.5626/JCSE.2016.10.1.1

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