Efficient fuzzy-pruned high dimensional clustering with minimal distance measure.

In this paper, we present a novel clustering approach that eliminates the need for predefined cluster centres and cluster counts, addressing common limitations in traditional clustering algorithms. We achieve this by allowing each data point within the problem space to serve as a potential cluster centre, determined by the presence of nearby data points. Three distinct algorithms are introduced: i) Identifying valid data points for clustering by assessing their presence within the specified vicinity of each potential cluster centre, allowing data points to belong to multiple clusters, ii) Calculating the fuzzy membership of shared data points among the clusters and iii) Retaining shared data points in the cluster with the highest membership and removing them from others. A comprehensive evaluation of this method using synthetic data and benchmark datasets from well-known problems demonstrates promising performance. Our approach offers increased flexibility, ease of use, and enhances the fidelity of cluster centres to the underlying data distribution. [ABSTRACT FROM AUTHOR]