Parallel algorithms for hierarchical clustering
From MaRDI portal
Recommendations
Cited in
(24)- Parallel clustering algorithms
- Social network community detection using agglomerative spectral clustering
- A parallel branch-and-bound method for cluster analysis
- Widening: using parallel resources to improve model quality
- A distance based clustering method for arbitrary shaped clusters in large datasets
- Optimal implementations of UPGMA and other common clustering algorithms
- A hierarchical clustering algorithm for MIMD architecture
- A tandem clustering process for multimodal datasets
- K-means-type algorithms on distributed memory computer
- User identity unification in e-commerce
- scientific article; zbMATH DE number 1810466 (Why is no real title available?)
- scientific article; zbMATH DE number 5540352 (Why is no real title available?)
- Efficient Clustering for Orders
- scientific article; zbMATH DE number 1944953 (Why is no real title available?)
- A parallel clustering algorithm on the star graph and its performance
- scientific article; zbMATH DE number 1863284 (Why is no real title available?)
- Hierarchical clustering and K-means clustering: algorithms and applications
- Euro-Par 2004 Parallel Processing
- High Performance Computing for Computational Science - VECPAR 2004
- Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses
- Object clustering for high performance parallel computing
- On the approximation of Euclidean SL via geometric method
- Hellinger–Kantorovich barycenter between Dirac measures
- Adaptive learning for event modeling and characterization
This page was built for publication: Parallel algorithms for hierarchical clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672423)