Parallel algorithms for hierarchical clustering
From MaRDI portal
Publication:672423
DOI10.1016/0167-8191(95)00017-IzbMath0875.68750OpenAlexW2049631158WikidataQ127908734 ScholiaQ127908734MaRDI QIDQ672423
Publication date: 28 February 1997
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(95)00017-i
Related Items (12)
Optimal implementations of UPGMA and other common clustering algorithms ⋮ Adaptive learning for event modeling and characterization ⋮ User Identity Unification in e-Commerce ⋮ On the approximation of Euclidean SL via geometric method ⋮ Social network community detection using agglomerative spectral clustering ⋮ Hellinger–Kantorovich barycenter between Dirac measures ⋮ K-MEANS-TYPE ALGORITHMS ON DISTRIBUTED MEMORY COMPUTER ⋮ A hierarchical clustering algorithm for MIMD architecture ⋮ A distance based clustering method for arbitrary shaped clusters in large datasets ⋮ Widening: using parallel resources to improve model quality ⋮ Efficient Clustering for Orders ⋮ A tandem clustering process for multimodal datasets
This page was built for publication: Parallel algorithms for hierarchical clustering