Avoiding Local Minima in Overlap-Based Clustering by Random Swap
Systems and Computing · 15.01.2026 · 2 (1)
DOI: 10.64409/sycom.v2.i1.22 ↗Kurz gefasst
Fachartikel in der Zeitschrift Systems and Computing, online erschienen am 15.01.2026. Verfasst von Fei Wang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Context
Cluster overlap has been recently introduced as an alternative objective function to the traditional sum-of-squared error (SSE) function used in k-means. It estimates the overlap by counting how many points are shared between the neighbor clusters. The overlap k-means was shown to provide more stable centroid locations than SSE, but at the cost of losing the dynamics of the k-means algorithm.
Objective
In this paper, we address this drawback by adding a random swap step to the algorithm and introducing a new Overlap random swap.
Method
It consists of three steps: (1) selective replacement of the centroids, (2) standard cluster assignment step, (3) weighted centroid calculation giving less weight to the overlapping points.
Results
Experimental results confirm that ORS achieves competitive clustering accuracy, stable centroid locations, and improved boundary separation. The clustering accuracy (ACC) is about 95% and the centroid index (CI) is about 0.1. The algorithm converges within 3000 swap iterations.
Conclusions
These results indicate that ORS helps avoid local minima and maintains the robustness of overlap-based clustering.
Zitieren
APA
Wang, F., Li, L., & Fränti, P. (2026). Avoiding Local Minima in Overlap-Based Clustering by Random Swap. Systems and Computing, 2(1). https://doi.org/10.64409/sycom.v2.i1.22
Vancouver
Wang F, Li L, Fränti P. Avoiding Local Minima in Overlap-Based Clustering by Random Swap. Systems and Computing. 2026;2(1). doi:10.64409/sycom.v2.i1.22
BibTeX
@article{Wang2026,
author = {Wang, Fei and Li, Le and Fränti, Pasi},
title = {Avoiding Local Minima in Overlap-Based Clustering by Random Swap},
journal = {Systems and Computing},
year = {2026},
volume = {2},
number = {1},
doi = {10.64409/sycom.v2.i1.22}
}
EUVIMED