\mathtt {IP.LSH.DBSCAN}: Integrated Parallel Density-Based Clustering Through Locality-Sensitive Hashing

DOI10.1007/978-3-031-12597-3_17zbMATH Open1512.68303MaRDI QIDQ6487364FDOQ6487364

Authors: Marina Papatriantafilou, Philippas Tsigas 

Publication date: 9 December 2022

Recommendations

• scientific article; zbMATH DE number 1863284
• Anytime parallel density-based clustering
• Faster \textsc{dbscan} and \textsc{hdbscan} in low-dimensional Euclidean spaces
• Faster DBScan and HDBscan in low-dimensional Euclidean spaces
• Discovery Science

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Locality-sensitive hashing scheme based on \(p\)-stable distributions
• On the hardness and approximation of Euclidean DBSCAN
• A randomized concurrent algorithm for disjoint set union
• $$\mathtt {IP.LSH.DBSCAN}$$: Integrated Parallel Density-Based Clustering Through Locality-Sensitive Hashing

Cited In (4)

• A locality sensitive hashing filter for encrypted vector databases
• $$\mathtt {IP.LSH.DBSCAN}$$: Integrated Parallel Density-Based Clustering Through Locality-Sensitive Hashing
• GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
• Anytime parallel density-based clustering

This page was built for publication: $$\mathtt {IP.LSH.DBSCAN}$$: Integrated Parallel Density-Based Clustering Through Locality-Sensitive Hashing

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