pPOP: Fast yet accurate parallel hierarchical clustering using partitioning-Reference-Cited by-同舟云学术

pPOP: Fast yet accurate parallel hierarchical clustering using partitioning

Published:2007-06 Issue:3 Volume:61 Page:563-578
ISSN:0169-023X
Container-title:Data & Knowledge Engineering
language:en
Short-container-title:Data & Knowledge Engineering

Author:

Dash Manoranjan,Petrutiu Simona,Scheuermann Peter

Publisher

Elsevier BV

Subject

Information Systems and Management

Reference30 articles.

1. Cluster Analysis for Applications;Anderberg,1973

2. K. Beyer, J. Goldstein, R. Ramakrishnan, U. Shaft, When is “nearest neighbor” meaningful? in: Proceedings of the International Conference on Database Theory (ICDT), 1999, pp. 217–235.

3. P.S. Bradley, U. Fayyad, C. Reina, Scaling clustering algorithms to large databases, in: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD), 1998, pp. 9–15.

4. S. Brin, Near neighbor search in large metric spaces, in: Proceedings of the International Conference on Very Large Databases (VLDB), 1995.

5. Parallel Programming in OpenMP,2000

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Survey and Experimental Review on Data Distribution Strategies for Parallel Spatial Clustering Algorithms;Journal of Computer Science and Technology;2024-05

2. Weak information extraction of gamma spectrum based on a two-dimensional wavelet transform;Radiation Physics and Chemistry;2023-07

3. cuSLINK: Single-Linkage Agglomerative Clustering on the GPU;Machine Learning and Knowledge Discovery in Databases: Research Track;2023

4. PACk;Proceedings of the VLDB Endowment;2022-02

5. Matching Entities from Multiple Sources with Hierarchical Agglomerative Clustering;Proceedings of the 13th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management;2021