A Self-Adaptive Fuzzy<i> c</i>-Means Algorithm for Determining the Optimal Number of Clusters

<div>An example. Point A is of the highest local density. If A does not belong to any cluster, then A is a core point. Points B, C, D, and E are directly density-reachable to point A. Point F is density-reachable to point A. Point H is a border point.</div>

Computational Intelligence and Neuroscience

fig1

Figure 1

Figure 1: A Self-Adaptive Fuzzy<i> c</i>-Means Algorithm for Determining the Optimal Number of Clusters 

Computational Intelligence and Neuroscience

A Self-Adaptive Fuzzy c-Means Algorithm for Determining the Optimal Number of Clusters

Figure 1