Original K-Means - How is Original K-Means abbreviated?
References in periodicals archive
As shown in above Algorithm, the original k-means algorithm make up of two phases: In the first phase determining the initial centroids and the other for assigning data object to the nearest clusters and then recomputed the cluster centroids.
Original k-means algorithm is computationally expensive and the quality of the resulting clusters heavily depends on the selection of initial centroids.
We compared our proposed algorithm result with the result obtaining by DBSCANA and modified k-means result , that used the links between clusters with the original k-means
algorithm, we found that the errors in our result is less than the errors in that algorithm.