 Hierarchical++: improving the hierarchical clustering algorithmWallace Anacleto Pinheiro and Ana Bárbara Sapienza Pinheiro International Journal of Data Mining, Modelling and Management, 2023, vol. 15, issue 3, 223-239 Abstract: Hierarchical grouping is a widely used grouping strategy. However, this technique often provides lower results when compared to other approaches, such as K-means clustering. In addition, many algorithms try to correct hierarchical fails refactoring intermediate clustering combination actions, which may worsen performance. In this work, we propose a new set of procedures that alter the hierarchical technique to improve its results. The idea is to do it right the first time, avoiding refactoring previous steps. These modifications involve the concept of golden boxes, based on initial points named seeds, which indicate groups that must keep disconnected. To assess our strategy, we compare the results of some approaches: traditional hierarchical clustering (single-link, complete-link, average, weighted, centroid, and median), K-means, K-means++, and the proposed method, named Hierarchical++. An experimental evaluation indicates that our proposal far surpasses the compared strategies. Keywords: clustering; grouping; similarity; golden boxes; complex distributions; dendrograms; hierarchical; K-means; seed; centroid. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:15:y:2023:i:3:p:223-239 Access Statistics for this article More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.