When Fireflies Cluster; Enhancing Automatic Clustering via Centroid-Guided Firefly Optimization

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Ariyaratne, MKA, Gusrialdi, Azwirman, Nikulin, Yury, Peltonen, Jaakko
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909054307139584
author Ariyaratne, MKA
Gusrialdi, Azwirman
Nikulin, Yury
Peltonen, Jaakko
author_facet Ariyaratne, MKA
Gusrialdi, Azwirman
Nikulin, Yury
Peltonen, Jaakko
contents This work presents a novel variant of the Firefly Algorithm (FA) for data clustering, addressing limitations of traditional methods like K-Means that struggle with non-uniform cluster shapes, densities, and the need for pre-defining the number of clusters. The proposed algorithm introduces a centroid movement strategy and a multi-objective fitness function that balances compactness, separation, and a novel TSP-based navigation penalty. It automatically estimates the optimal number of clusters and dynamically adjusts cluster boundaries. Application to robotic sensor networks highlights its practical value, with experiments showing improved clustering quality and reduced intra-cluster path distances compared to K-Means. These results confirm the algorithm's robustness in complex spatial clustering tasks, with potential for future extensions to higher-dimensional and adaptive scenarios.
format Preprint
id arxiv_https___arxiv_org_abs_2605_18460
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle When Fireflies Cluster; Enhancing Automatic Clustering via Centroid-Guided Firefly Optimization
Ariyaratne, MKA
Gusrialdi, Azwirman
Nikulin, Yury
Peltonen, Jaakko
Artificial Intelligence
Machine Learning
Neural and Evolutionary Computing
This work presents a novel variant of the Firefly Algorithm (FA) for data clustering, addressing limitations of traditional methods like K-Means that struggle with non-uniform cluster shapes, densities, and the need for pre-defining the number of clusters. The proposed algorithm introduces a centroid movement strategy and a multi-objective fitness function that balances compactness, separation, and a novel TSP-based navigation penalty. It automatically estimates the optimal number of clusters and dynamically adjusts cluster boundaries. Application to robotic sensor networks highlights its practical value, with experiments showing improved clustering quality and reduced intra-cluster path distances compared to K-Means. These results confirm the algorithm's robustness in complex spatial clustering tasks, with potential for future extensions to higher-dimensional and adaptive scenarios.
title When Fireflies Cluster; Enhancing Automatic Clustering via Centroid-Guided Firefly Optimization
topic Artificial Intelligence
Machine Learning
Neural and Evolutionary Computing
url https://arxiv.org/abs/2605.18460