Export file:


  • RIS(for EndNote,Reference Manager,ProCite)
  • BibTex
  • Text


  • Citation Only
  • Citation and Abstract

Scalable Clustering by Truncated Fuzzy c-means

1. Department of Mathematics University of Connecticut 341 Mansfield Road, Storrs, CT 06269-1009, USA;
2. Business School Hunan University Changsha, Hunan 410082, China;
3. Columbian College of Arts & Sciences George Washington University Washington, D. C., 20052, USA

Most existing clustering algorithms are slow for dividing a large dataset into a large number of clusters. In this paper, we propose a truncated FCM algorithm to address this problem. The main idea behind our proposed algorithm is to keep only a small number of cluster centers during the iterative process of the FCM algorithm. Our numerical experiments on both synthetic and real datasets show that the proposed algorithm is much faster than the original FCM algorithm and the accuracy is comparable to that of the original FCM algorithm.
  Article Metrics
Download full text in PDF

Export Citation

Article outline

Copyright © AIMS Press All Rights Reserved