An Optimal and Stable Algorithm for Clustering Numerical Data

• Published in: Algorithms Vol. 14; no. 7; p. 197
• Main Authors: Seman, Ali, Mohd Sapawi, Azizian
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.07.2021
• Subjects: Algorithms; categorical clustering; Cluster analysis; Clustering; Datasets; fuzzy clustering; Heuristic; Methods; numerical clustering; Optimization; partitional clustering algorithm; Stability
• ISSN: 1999-4893; 1999-4893
• DOI: 10.3390/a14070197

In the conventional k-means framework, seeding is the first step toward optimization before the objects are clustered. In random seeding, two main issues arise: the clustering results may be less than optimal and different clustering results may be obtained for every run. In real-world applications, optimal and stable clustering is highly desirable. This report introduces a new clustering algorithm called the zero k-approximate modal haplotype (Zk-AMH) algorithm that uses a simple and novel seeding mechanism known as zero-point multidimensional spaces. The Zk-AMH provides cluster optimality and stability, therefore resolving the aforementioned issues. Notably, the Zk-AMH algorithm yielded identical mean scores to maximum, and minimum scores in 100 runs, producing zero standard deviation to show its stability. Additionally, when the Zk-AMH algorithm was applied to eight datasets, it achieved the highest mean scores for four datasets, produced an approximately equal score for one dataset, and yielded marginally lower scores for the other three datasets. With its optimality and stability, the Zk-AMH algorithm could be a suitable alternative for developing future clustering tools.