BLOCK-DBSCAN: Fast clustering for large scale data
Yewang Chen, Lida Zhou, Nizar Bouguila et al. · Pattern Recognition · 2020
Cited by 176 works. doi:10.1016/j.patcog.2020.107624
Authors
References
- The Hungarian method for the assignment problem
- A density-based algorithm for discovering clusters in large spatial Databases with Noise
- Product Quantization for Nearest Neighbor Search
- Data clustering: 50 years beyond K-means
- Clustering by fast search and find of density peaks
- Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
- Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
- Proceedings of the 23rd international conference on Machine learning
- DBSCAN Revisited, Revisited
- Cover trees for nearest neighbor