All-pairwise squared distances lead to more balanced clustering
Applied Computing and Intelligence · 2023
DOI: 10.3934/aci.2023006 ↗Kurz gefasst
Fachartikel in der Zeitschrift Applied Computing and Intelligence, 2023. Verfasst von Mikko I. Malinen und 1 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 57 Literaturangaben.
Abstract (Originalsprache)
In clustering, the cost function that is commonly used involves calculating all-pairwise squared distances. In this paper, we formulate the cost function using mean squared error and show that this leads to more balanced clustering compared to centroid-based distance functions, like the sum of squared distances in $ k $-means. The clustering method has been formulated as a cut-based approach, more intuitively called Squared cut (Scut). We introduce an algorithm for the problem which is faster than the existing one based on the Stirling approximation. Our algorithm is a sequential variant of a local search algorithm. We show by experiments that the proposed approach provides better overall optimization of both mean squared error and cluster balance compared to existing methods.
Zitieren
APA
Malinen, M. I., & Fränti, P. (2023). All-pairwise squared distances lead to more balanced clustering. Applied Computing and Intelligence. https://doi.org/10.3934/aci.2023006
Vancouver
Malinen MI, Fränti P. All-pairwise squared distances lead to more balanced clustering. Applied Computing and Intelligence. 2023. doi:10.3934/aci.2023006
BibTeX
@article{Malinen2023,
author = {Malinen, Mikko I. and Fränti, Pasi},
title = {All-pairwise squared distances lead to more balanced clustering},
journal = {Applied Computing and Intelligence},
year = {2023},
doi = {10.3934/aci.2023006}
}
EUVIMED