返回
GriT-DBSCAN: A spatial clustering algorithm for very large databases
DOI:10.1016/j.patcog.2023.109658.png)
摘要
En 中文
DBSCAN is a fundamental spatial clustering algorithm with numerous practical applications. However, a bottleneck of DBSCAN is its O (n 2 ) worst-case time complexity. To address this limitation, we propose a new grid-based algorithm for exact DBSCAN in Euclidean space called GriT-DBSCAN, which is based on the following two techniques. First, we introduce grid tree to organize the non-empty grids for the purpose of efficient non-empty neighboring grids queries. Second, by utilizing the spatial relationships among points, we propose a technique that iteratively prunes unnecessary distance calculations when determining whether the minimum distance between two sets is less than or equal to a certain threshold. We theoretically demonstrate that GriT-DBSCAN has excellent reliability in terms of time complexity. In addition, we obtain two variants of GriT-DBSCAN by incorporating heuristics, or by combining the second technique with an existing algorithm. Experiments are conducted on both synthetic and real-world data sets to evaluate the efficiency of GriT-DBSCAN and its variants. The results show that our algorithms outperform existing algorithms.
Keyword:
DBSCAN
Clustering
Indexing methods
Spatial databases
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.4W
被引数:
4.5W
机构
引用论文
Unsupervised person re-identification via simultaneous clustering and mask prediction
PATTERN RECOGNITION
IF7.6
A local tangent plane distance-based approach to 3D point cloud segmentation via clustering基于局部切平面距离的三维点云聚类分割方法
PATTERN RECOGNITION
IF7.6
A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method一种利用分组方法加速邻居搜索的快速DBSCAN聚类算法
PATTERN RECOGNITION
IF7.6

