Density-Based Clustering by Double-Bit Quantization Hashing
- 20 October 2019
- book chapter
- Published by Springer Nature
- p. 301-314
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An efficient and scalable density-based clustering algorithm for datasets with complex structuresNeurocomputing, 2016
- G-DBSCAN: A GPU Accelerated Algorithm for Density-based ClusteringProcedia Computer Science, 2013
- MR-DBSCAN: An Efficient Parallel Density-Based Clustering Algorithm Using MapReduce2011
- A new hybrid method based on partitioning-based DBSCAN and ant clusteringExpert Systems with Applications, 2011
- iPoc: A Polar Coordinate Based Indexing Method for Nearest Neighbor Search in High Dimensional SpaceLecture Notes in Computer Science, 2010
- ST-DBSCAN: An algorithm for clustering spatial–temporal dataData & Knowledge Engineering, 2007
- Experiments in Parallel Clustering with DBSCAN2001
- Combining Sampling Technique with DBSCAN Algorithm for Clustering Large Spatial Databases2000
- The R*-tree: an efficient and robust access method for points and rectanglesACM SIGMOD Record, 1990
- R-treesACM SIGMOD Record, 1984