Experiments in parallel clustering with DBSCAN

DOI10.1007/3-540-44681-8_46MaRDI QIDQ4791915zbMATH OpenFDO

Authors Domenica Arlia, Massimo Coppola

Publication date 4 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2150/21500326

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel clustering algorithms
• Parallel clustering methods for data mining
• scientific article; zbMATH DE number 1810466
• Anytime parallel density-based clustering
• Parallel algorithms for hierarchical clustering

Cited in

(8)

• DBSCAN
• Anytime parallel density-based clustering
• Elephant against Goliath: performance of big data versus high-performance computing DBSCAN clustering implementations
• Parallel clustering methods for data mining
• scientific article; zbMATH DE number 1057775 (Why is no real title available?)
• Approaches for scaling DBSCAN algorithm to large spatial databases
• $$\mathtt {IP.LSH.DBSCAN}$$: Integrated Parallel Density-Based Clustering Through Locality-Sensitive Hashing
• Density-based clustering in MapReduce with guarantees on parallel time, space, and solution quality

This page was built for publication: Experiments in parallel clustering with DBSCAN

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791915)