Elsevier

Fuzzy Sets and Systems

Volume 128, Issue 3, 16 June 2002, Pages 365-376
Fuzzy Sets and Systems

Speeding up fuzzy c-means: using a hierarchical data organisation to control the precision of membership calculation

https://doi.org/10.1016/S0165-0114(01)00204-4Get rights and content

Abstract

We examine the run-time behaviour of conventional fuzzy c-means implementations. Investigating into FCM termination conditions and membership update equations, we derive an approximative FCM that yields the same results as a conventional implementation within a given precision. We incorporate additional information about the data set by re-organizing the set as a tree. Our modification leads to an FCM algorithm with a significantly different run time behaviour; the gain of using the modified implementation increases with an increasing number of data objects and especially an increasing number of clusters, but is also sensitive to the chosen fuzzifier.

References (10)

There are more references available in the full text version of this article.

Cited by (31)

View all citing articles on Scopus

This work was supported by the Deutsche Forschungsgemeinschaft (DFG) under grant Kl 648/1-1.

View full text