An enhanced version of honey badger algorithm for data clustering problems
Öz
This study proposes an improved version of the Honey Badger Algorithm (HBA) for solving clustering problems, called the Clustering Honey Badger Algorithm (CHBA). The main enhancement involves modeling the smell intensity using an exponential decay function instead of the inverse square law. This modification reduces the likelihood of getting trapped in local optima and improves the algorithm’s exploratory behavior. CHBA was compared against six state-of-the-art meta-heuristic algorithms, including the original HBA, on seven benchmark clustering datasets. The evaluation was based on five common external performance metrics: accuracy, F-score, precision, sensitivity, and intra-cluster distance. According to the results, CHBA achieved the highest performance on datasets such as Cancer (94.86% accuracy), Iris (93.94% accuracy), and Ecoli (84.52% accuracy). Furthermore, Friedman test results showed that CHBA consistently ranked first in all performance metrics, with p-values less than 0.005, indicating statistically significant superiority. These findings demonstrate that CHBA is a competitive and reliable clustering algorithm, especially in complex and imbalanced data scenarios.
Anahtar Kelimeler
Kaynakça
- [1] Kaur A, Kumar Y. “A new metaheuristic algorithm based on water wave optimization for data clustering”. Evolutionary Intelligence, 15(1), 759-785, 2022.
- [2] Tarkhaneh O, Moser I. “An improved differential evolution algorithm using Archimedean spiral and neighborhood search-based mutation approach for cluster analysis”. Future Generation Computer Systems, 101, 921-939, 2019.
- [3] Gong S, Hu W, Li H, Qu Y. “Property clustering in linked data: an empirical study and its application to entity browsing”. International Journal on Semantic Web and Information Systems, 14(1), 31-70, 2018.
- [4] Chou CH, Hsieh SC, Qiu CJ. “Hybrid genetic algorithm and fuzzy clustering for bankruptcy prediction”. Applied Soft Computing, 56, 298-316, 2017.
- [5] Hyde R, Angelov P, MacKenzie AR. “Fully online clustering of evolving data streams into arbitrarily shaped clusters”. Information Sciences, 382-383, 96-114, 2017.
- [6] Wang L, Zhou X, Xing Y, Yang M, Zhang C. “Clustering ECG heartbeat using improved semi-supervised affinity propagation”. IET Software, 11(5), 207-213, 2017.
- [7] Yao H, Duan Q, Li D, Wang J. “An improved K-means clustering algorithm for fish image segmentation”. Mathematical and Computer Modelling, 58(3-4), 790-798, 2013.
- [8] Zhu J, Lung CH, Srivastava V. “A hybrid clustering technique using quantitative and qualitative data for wireless sensor networks”. Ad Hoc Networks, 25, 38-53, 2015.
Ayrıntılar
Birincil Dil
İngilizce
Konular
Elektronik Tasarım Otomosyonu
Bölüm
Araştırma Makalesi
Yazarlar
Harun Gezici
*
0000-0003-1604-1416
Türkiye
Erken Görünüm Tarihi
2 Kasım 2025
Yayımlanma Tarihi
16 Mart 2026
Gönderilme Tarihi
7 Ocak 2025
Kabul Tarihi
20 Ağustos 2025
Yayımlandığı Sayı
Yıl 2026 Cilt: 32 Sayı: 2