Research Article

A boosted hierarchical clustering linkage algorithm: K-Centroid link supported with OWA approach

Volume: 28 Number: 1 January 12, 2026
TR EN

A boosted hierarchical clustering linkage algorithm: K-Centroid link supported with OWA approach

Abstract

The choice of linkage algorithm plays a crucial role in determining the quality of hierarchical clustering and therefore must be made carefully. This selection significantly influences the effectiveness of the clustering process. However, conventional linkage methods do not take into account the influence of records located near the cluster centers. Previous studies proposed the k-centroid link, a new cluster merging criterion that analyzes instances near cluster centers in greater detail to improve clustering quality. The k-centroid link computes the average distance among the k nearest data points to the central point within each cluster. In this study, we enhance the clustering capability of the k-centroid link by integrating the Ordered Weighted Averaging (OWA) approach. Specifically, OWA values of the average distances between the k nearest records to each cluster center are calculated using a constant-level weighted stress function across different α values, rather than relying solely on direct distance calculations. The proposed model was evaluated on 24 publicly available benchmark datasets specifically designed for clustering tasks. The results demonstrate that the k-centroid link can be significantly improved through the application of OWA-based approaches with different stress functions.

Keywords

References

  1. Jyothi, B., Lingamgunta, S., and Eluri, S. Intelligent deep learning-based hierarchical clustering for unstructured text data, Concurrency and Computation: Practice and Experience, 34, Article e7388, (2022).
  2. Ghasemkhani, B., Yilmaz, R., and Kut, A., Birant, D. Logistic Model Tree Forest for Steel Plates Faults Prediction, Machines, 11(7), 679, (2023).
  3. Senthilnath, J., Shreyas, P., Ritwik, R., Suresh, S., Sushant, K., and Benediktsson, J. Hierarchical clustering approaches for flood assessment using multi-sensor satellite images, International Journal of Image and Data Fusion, 10(1): 28-44, (2019).
  4. Alberto, F., and Sergio, G. Versatile Linkage: a family of space-conserving strategies for agglomerative hierarchical clustering, Journal of Classification, 37: 584-597, (2019).
  5. Jaroonchokanan, N., Termsaithong, T., and Suwanna, S. Dynamics of hierarchical clustering in stocks market during financial crises, Physica A: Statistical Mechanics and Its Applications, 607: 128183, (2022).
  6. Zhong, C., Wang, H., and Yang, Q. Hydrochemical interpretation of groundwater in Yinchuan basin using self-organizing maps and hierarchical clustering, Chemosphere, 309: 136787, (2022).
  7. Nasibov, E. A robust algorithm for solution of the fuzzy clustering problem on the basis of the fuzzy joint points method, Cybernetics and System Analysis, 44(1): 7–17, (2008).
  8. Atilgan, C., and Nasibov, E. A space-efficient minimum spanning tree approach to the fuzzy joint points clustering algorithm, IEEE Transactions on Fuzzy Systems, 27(6): 1317-1322, (2019).

Details

Primary Language

English

Subjects

Machine Learning (Other)

Journal Section

Research Article

Early Pub Date

January 12, 2026

Publication Date

January 12, 2026

Submission Date

February 6, 2025

Acceptance Date

October 5, 2025

Published in Issue

Year 2026 Volume: 28 Number: 1

APA
Doğan, A., & Nasiboğlu, E. (2026). A boosted hierarchical clustering linkage algorithm: K-Centroid link supported with OWA approach. Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 28(1), 191-211. https://doi.org/10.25092/baunfbed.1634534
AMA
1.Doğan A, Nasiboğlu E. A boosted hierarchical clustering linkage algorithm: K-Centroid link supported with OWA approach. Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi. 2026;28(1):191-211. doi:10.25092/baunfbed.1634534
Chicago
Doğan, Alican, and Efendi Nasiboğlu. 2026. “A Boosted Hierarchical Clustering Linkage Algorithm: K-Centroid Link Supported With OWA Approach”. Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi 28 (1): 191-211. https://doi.org/10.25092/baunfbed.1634534.
EndNote
Doğan A, Nasiboğlu E (January 1, 2026) A boosted hierarchical clustering linkage algorithm: K-Centroid link supported with OWA approach. Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi 28 1 191–211.
IEEE
[1]A. Doğan and E. Nasiboğlu, “A boosted hierarchical clustering linkage algorithm: K-Centroid link supported with OWA approach”, Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi, vol. 28, no. 1, pp. 191–211, Jan. 2026, doi: 10.25092/baunfbed.1634534.
ISNAD
Doğan, Alican - Nasiboğlu, Efendi. “A Boosted Hierarchical Clustering Linkage Algorithm: K-Centroid Link Supported With OWA Approach”. Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi 28/1 (January 1, 2026): 191-211. https://doi.org/10.25092/baunfbed.1634534.
JAMA
1.Doğan A, Nasiboğlu E. A boosted hierarchical clustering linkage algorithm: K-Centroid link supported with OWA approach. Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi. 2026;28:191–211.
MLA
Doğan, Alican, and Efendi Nasiboğlu. “A Boosted Hierarchical Clustering Linkage Algorithm: K-Centroid Link Supported With OWA Approach”. Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi, vol. 28, no. 1, Jan. 2026, pp. 191-1, doi:10.25092/baunfbed.1634534.
Vancouver
1.Alican Doğan, Efendi Nasiboğlu. A boosted hierarchical clustering linkage algorithm: K-Centroid link supported with OWA approach. Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi. 2026 Jan. 1;28(1):191-21. doi:10.25092/baunfbed.1634534