Study of a reasonable initial center selection method applied to a K-means clustering

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Clustering methods are divided into hierarchical clustering, partitioning clustering, and more. K-Means is a method of partitioning clustering. We improve the performance of a K-Means, selecting the initial centers of a cluster through a calculation rather than using random selecting. This method maximizes the distance among the initial centers of clusters. Subsequently, the centers are distributed evenly and the results are more accurate than for initial cluster centers selected at random. This is time-consuming, but it can reduce the total clustering time by minimizing allocation and recalculation. Compared with the standard algorithm, F-Measure is more accurate by 5.1%. Copyright © 2013 The Institute of Electronics, Information and Communication Engineers.

Cite

CITATION STYLE

APA

Lee, W., Lee, S. S., & An, D. U. (2013). Study of a reasonable initial center selection method applied to a K-means clustering. IEICE Transactions on Information and Systems, E96-D(8), 1727–1733. https://doi.org/10.1587/transinf.E96.D.1727

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free