A Study on Cluster Size Sensitivity of Fuzzy c-Means Algorithm Variants

Detecting clusters of different sizes represents a serious difficulty for all c-means clustering models. This study investigates the set of various modified fuzzy c-means clustering algorithms within the bounds of the probabilistic constraint, from the point of view of their sensitivity to cluster sizes. Two numerical frameworks are constructed, one of them addressing clusters of different cardinalities but relatively similar diameter, while the other manipulating with both cluster cardinality and diameter. The numerical evaluations have shown the existence of algorithms that can effectively handle both cases. However, these are difficult to automatically adjust to the input data through their parameters.