IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v42y2025i2d10.1007_s00357-025-09506-5.html
   My bibliography  Save this article

Identifying Effective Algorithms and Measures for Enhanced Clustering Quality: A Comprehensive Examination of Arbitrary Decisions in Hierarchical Clustering Algorithms

Author

Listed:
  • Rashid Behzadidoost

    (University of Tabriz)

  • Habib Izadkhah

    (University of Tabriz)

Abstract

Hierarchical clustering algorithms are widely used in various applications to group similar samples. However, a common challenge arises during the merging process when two or more clusters have equal values, with no clear criterion to determine which clusters should be merged next. This leads to arbitrary decisions, which can negatively impact the quality of clustering results. The issue of arbitrary decisions has been highlighted in previous studies, emphasizing the need for algorithms and measures that minimize their occurrence. This study provides a comprehensive analysis of arbitrary decisions generated by nine popular hierarchical clustering algorithms across 100 measures, including similarities, distances, and entropy. In total, 737 unique combinations of clustering algorithms and measures were evaluated, many of which are novel and have not been previously explored. The results show that the Agglomerative Information Bottleneck algorithm, when paired with measures such as cross-entropy and Jensen difference, the combined algorithm with Soergel and Fidelity measures, the weighted combined algorithm with cosine similarity and fidelity measures, and the median algorithm with covariance similarity and squared chord distance measures, exhibited minimal arbitrary decisions for binary data. For non-binary data, the agglomerative information bottleneck algorithm with cross-entropy and Kullback-Leibler measures, the centroid algorithm with Hellinger and squared chord distance measures, and the median algorithm with Hellinger and Jeffries-Matusita distance measures showed fewer arbitrary decisions. This study provides valuable insights for researchers and practitioners by identifying specific clustering algorithms and measures that are less prone to arbitrary decisions, thereby enhancing the quality of clustering outcomes. Overall, this paper contributes to the field of clustering by evaluating the effectiveness of new combinations of algorithms and measures in reducing arbitrary decisions.

Suggested Citation

  • Rashid Behzadidoost & Habib Izadkhah, 2025. "Identifying Effective Algorithms and Measures for Enhanced Clustering Quality: A Comprehensive Examination of Arbitrary Decisions in Hierarchical Clustering Algorithms," Journal of Classification, Springer;The Classification Society, vol. 42(2), pages 457-489, July.
    • Handle: RePEc:spr:jclass:v:42:y:2025:i:2:d:10.1007_s00357-025-09506-5
    DOI: 10.1007/s00357-025-09506-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-025-09506-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00357-025-09506-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. András Schubert & András Telcs, 2014. "A note on the Jaccardized Czekanowski similarity index," Scientometrics, Springer;Akadémiai Kiadó, vol. 98(2), pages 1397-1399, February.
    2. Maurice Roux, 2018. "A Comparative Study of Divisive and Agglomerative Hierarchical Clustering Algorithms," Journal of Classification, Springer;The Classification Society, vol. 35(2), pages 345-366, July.
    3. Han Zhang & Yilang Peng, 2024. "Image Clustering: An Unsupervised Approach to Categorize Visual Data in Social Science Research," Sociological Methods & Research, , vol. 53(3), pages 1534-1587, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Denitsa ZHECHEVA & Nayden NENKOV, 2022. "Business demands for processing unstructured textual data – text mining techniques for companies to implement," Access Journal, Access Press Publishing House, vol. 3(2), pages 107-120, April.
    2. Costa, Luciano da F., 2022. "On similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 599(C).
    3. Rajesh Ranjan & Jitender Kumar Chhabra, 2025. "An Effective Crow Search Algorithm and Its Application in Data Clustering," Journal of Classification, Springer;The Classification Society, vol. 42(1), pages 134-162, March.
    4. Regal, Andrés & Gonzalez-Feliu, Jesús & Rodriguez, Michelle, 2023. "A spatio-functional logistics profile clustering analysis method for metropolitan areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    5. Tien-Chin Wang & Binh Ngoc Phan & Thuy Thi Thu Nguyen, 2021. "Evaluating Operation Performance in Higher Education: The Case of Vietnam Public Universities," Sustainability, MDPI, vol. 13(7), pages 1-21, April.
    6. James Ming Chen & Mobeen Ur Rehman, 2021. "A Pattern New in Every Moment: The Temporal Clustering of Markets for Crude Oil, Refined Fuels, and Other Commodities," Energies, MDPI, vol. 14(19), pages 1-58, September.
    7. Rui Jin & Chunyuan Huang & Pei Wang & Junyong Ma & Yiliang Wan, 2023. "Identification of Inefficient Urban Land for Urban Regeneration Considering Land Use Differentiation," Land, MDPI, vol. 12(10), pages 1-24, October.
    8. Chen, James Ming & Rehman, Mobeen Ur & Vo, Xuan Vinh, 2021. "Clustering commodity markets in space and time: Clarifying returns, volatility, and trading regimes through unsupervised machine learning," Resources Policy, Elsevier, vol. 73(C).

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:42:y:2025:i:2:d:10.1007_s00357-025-09506-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.