Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A Density-Adaptive Hybrid Linkage Criterion for Agglomerative Hierarchical Clustering

View through CrossRef
Hierarchical clustering is a widely used unsupervised learning technique due to its ability to uncover nested data structures without requiring prior knowledge of the number of clusters. However, the effectiveness of agglomerative hierarchical clustering strongly depends on the selected linkage criterion. Conventional linkage methods exhibit inherent limitations: single linkage is susceptible to the chaining effect, often producing elongated and poorly separated clusters, whereas complete linkage tends to generate overly compact clusters and may fragment naturally connected data groups. To address these challenges, this paper proposes a novel Density-Adaptive Hybrid Linkage (DAHL) criterion for agglomerative hierarchical clustering. The proposed method dynamically integrates single-linkage and complete-linkage distances through a density-driven adaptive weighting mechanism, enabling the clustering process to balance connectivity and compactness according to local cluster characteristics. Unlike conventional fixed-linkage strategies, the proposed criterion automatically adjusts its behavior during cluster formation without requiring user-defined tuning parameters. A theoretical analysis demonstrates that the proposed linkage remains bounded between the corresponding single-linkage and complete-linkage distances, thereby preserving desirable properties of both methods. Furthermore, an efficient clustering algorithm based on the proposed linkage criterion is developed. Experimental evaluations conducted on multiple benchmark datasets from the UCI Machine Learning Repository demonstrate that the proposed approach consistently outperforms traditional single-linkage, complete-linkage, and average-linkage methods in terms of Adjusted Rand Index (ARI), Normalized Mutual Information (NMI), Silhouette Score (SS), and Davies–Bouldin Index (DBI). The results confirm that the proposed density-adaptive hybrid linkage criterion provides a robust and effective framework for hierarchical clustering across datasets exhibiting diverse structuraland density characteristics.
Title: A Density-Adaptive Hybrid Linkage Criterion for Agglomerative Hierarchical Clustering
Description:
Hierarchical clustering is a widely used unsupervised learning technique due to its ability to uncover nested data structures without requiring prior knowledge of the number of clusters.
However, the effectiveness of agglomerative hierarchical clustering strongly depends on the selected linkage criterion.
Conventional linkage methods exhibit inherent limitations: single linkage is susceptible to the chaining effect, often producing elongated and poorly separated clusters, whereas complete linkage tends to generate overly compact clusters and may fragment naturally connected data groups.
To address these challenges, this paper proposes a novel Density-Adaptive Hybrid Linkage (DAHL) criterion for agglomerative hierarchical clustering.
The proposed method dynamically integrates single-linkage and complete-linkage distances through a density-driven adaptive weighting mechanism, enabling the clustering process to balance connectivity and compactness according to local cluster characteristics.
Unlike conventional fixed-linkage strategies, the proposed criterion automatically adjusts its behavior during cluster formation without requiring user-defined tuning parameters.
A theoretical analysis demonstrates that the proposed linkage remains bounded between the corresponding single-linkage and complete-linkage distances, thereby preserving desirable properties of both methods.
Furthermore, an efficient clustering algorithm based on the proposed linkage criterion is developed.
Experimental evaluations conducted on multiple benchmark datasets from the UCI Machine Learning Repository demonstrate that the proposed approach consistently outperforms traditional single-linkage, complete-linkage, and average-linkage methods in terms of Adjusted Rand Index (ARI), Normalized Mutual Information (NMI), Silhouette Score (SS), and Davies–Bouldin Index (DBI).
The results confirm that the proposed density-adaptive hybrid linkage criterion provides a robust and effective framework for hierarchical clustering across datasets exhibiting diverse structuraland density characteristics.

Related Results

Clustering Analysis of Data with High Dimensionality
Clustering Analysis of Data with High Dimensionality
Clustering analysis has been widely applied in diverse fields such as data mining, access structures, knowledge discovery, software engineering, organization of information systems...
How suitable are clustering methods for functional annotation of proteins?
How suitable are clustering methods for functional annotation of proteins?
Abstract The advent of affordable high-throughput genome sequencing has drastically expanded protein sequence databases, necessitating the development of computatio...
Hybrid Clustering Using N-Soft Set and Artificial Bee Colony for Digital Literacy
Hybrid Clustering Using N-Soft Set and Artificial Bee Colony for Digital Literacy
Introduction: Open and distance education requires a good level of digital literacy. Students in open and distance educatiom come from various ages and backgrounds, resulting in di...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background: Clustering is one of the most important data mining methods. The k-means (c-means ) and its derivative methods are the hotspot in the field of clustering research in re...

Back to Top