Automatic Optimization Algorithm of Clusters Number Based on Maximum Distance
Hong Zhou, Jun Gao
Abstract
Hong Zhou, Jun Gao
Abstract
K-means clustering algorithm clusters datasets according to the certain clustering number k.However k cannot be confirmed beforehand.A new clustering validity index was designed from the standpoint of sample geometry.Based on the index a new method for determining the optimal clustering number in K-means clustering algorithm was proposed.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
K-means clustering algorithm clusters datasets according to the certain clustering number k.However k cannot be confirmed beforehand.A new clustering validity index was designed from the standpoint of sample geometry.Based on the index a new method for determining the optimal clustering number in K-means clustering algorithm was proposed.
Key concepts: Cluster analysis, Correlation clustering, Single-linkage clustering, CURE data clustering algorithm, Determining the number of clusters in a data set, Canopy clustering algorithm, Algorithm, k-medians clustering