Improving Hierarchical Clustering Algorithm
Luming Yang
Abstract
Luming Yang
Abstract
The agglomerative hierarchical clustering algorithm is introduced in this paper based on the standard algorithm.Through sorting the distance between clusters to avoid recomputing the distance between clusters we proposed the improved algorithm,which decreases the complexity.According to the experiment,the improved algorithm has the same clustering results as the standard agglomerative hierarchical clustering algorithm,but the speed is higher.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The agglomerative hierarchical clustering algorithm is introduced in this paper based on the standard algorithm.Through sorting the distance between clusters to avoid recomputing the distance between clusters we proposed the improved algorithm,which decreases the complexity.According to the experiment,the improved algorithm has the same clustering results as the standard agglomerative hierarchical clustering algorithm,but the speed is higher.
Key concepts: Hierarchical clustering, Cluster analysis, Single-linkage clustering, Hierarchical clustering of networks, CURE data clustering algorithm, Canopy clustering algorithm, Computer science, Correlation clustering