• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Approximate k values using Repulsive Force without Domain Knowledge in k-means

Vol. 14, No. 3, March 31, 2020
10.3837/tiis.2020.03.004, Download Paper (Free):

Abstract

The k-means algorithm is widely used in academia and industry due to easy and simple implementation, enabling fast learning for complex datasets. However, k-means struggles to classify datasets without prior knowledge of specific domains. We proposed the repulsive k-means (RK-means) algorithm in a previous study to improve the k-means algorithm, using the repulsive force concept, which allows deleting unnecessary cluster centroids. Accordingly, the RK-means enables to classifying of a dataset without domain knowledge. However, three main problems remain. The RK-means algorithm includes a cluster repulsive force offset, for clusters confined in other clusters, which can cause cluster locking; we were unable to prove RK-means provided optimal convergence in the previous study; and RK-means shown better performance only normalize term and weight. Therefore, this paper proposes the advanced RK-means (ARK-means) algorithm to resolve the RK-means problems. We establish an initialization strategy for deploying cluster centroids and define a metric for the ARK-means algorithm. Finally, we redefine the mass and normalize terms to close to the general dataset. We show ARK-means feasibility experimentally using blob and iris datasets. Experiment results verify the proposed ARK-means algorithm provides better performance than k-means, k’-means, and RK-means.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
J. Kim, M. Ryu and S. Cha, "Approximate k values using Repulsive Force without Domain Knowledge in k-means," KSII Transactions on Internet and Information Systems, vol. 14, no. 3, pp. 976-990, 2020. DOI: 10.3837/tiis.2020.03.004.

[ACM Style]
Jung-Jae Kim, Minwoo Ryu, and Si-Ho Cha. 2020. Approximate k values using Repulsive Force without Domain Knowledge in k-means. KSII Transactions on Internet and Information Systems, 14, 3, (2020), 976-990. DOI: 10.3837/tiis.2020.03.004.

[BibTeX Style]
@article{tiis:23383, title="Approximate k values using Repulsive Force without Domain Knowledge in k-means", author="Jung-Jae Kim and Minwoo Ryu and Si-Ho Cha and ", journal="KSII Transactions on Internet and Information Systems", DOI={10.3837/tiis.2020.03.004}, volume={14}, number={3}, year="2020", month={March}, pages={976-990}}