arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.06255cs.DScs.DBcs.DCcs.LG
收藏

理论上有效的实用并行DBSCAN

Theoretically-Efficient and Practical Parallel DBSCAN

MIT CSAIL(麻省理工学院计算机科学与人工智能实验室);UC Riverside(加州大学河滨分校)

Yiqiu Wang, Yan Gu, Julian Shun

摘要:

空间聚类的DBSCAN方法由于其在各种数据分析任务中的适用性而受到极大的关注。在欧几里得空间中,有快速的DBSCAN顺序算法,对于二维采用$O(n\log n)$工作,对于三维或更多维采用次二次工作,并且可以近似地在线性工作中计算任何常数数量的维度。然而,现有的并行DBSCAN算法在最坏的情况下需要二次工作,使得它们对于大型数据集效率低下。本文提出了新的并行算法,欧几里德精确DBSCAN和近似DBSCAN相匹配的顺序对应的工作范围,并高度并行(polylogarithmic深度)的并行DBSCAN的理论和实践之间的差距桥梁。我们提出了我们的算法的实现以及优化,提高其实际性能。我们在各种数据集和参数设置上对我们的算法进行了全面的实验评估。我们的36核机器上的超线程的实验表明,我们优于现有的并行DBSCAN实现高达几个数量级,并实现最高33倍的最佳顺序算法的加速比。

英文摘要:

The DBSCAN method for spatial clustering has received significant attention due to its applicability in a variety of data analysis tasks. There are fast sequential algorithms for DBSCAN in Euclidean space that take $O(n\log n)$ work for two dimensions, sub-quadratic work for three or more dimensions, and can be computed approximately in linear work for any constant number of dimensions. However, existing parallel DBSCAN algorithms require quadratic work in the worst case, making them inefficient for large datasets. This paper bridges the gap between theory and practice of parallel DBSCAN by presenting new parallel algorithms for Euclidean exact DBSCAN and approximate DBSCAN that match the work bounds of their sequential counterparts, and are highly parallel (polylogarithmic depth). We present implementations of our algorithms along with optimizations that improve their practical performance. We perform a comprehensive experimental evaluation of our algorithms on a variety of datasets and parameter settings. Our experiments on a 36-core machine with hyper-threading show that we outperform existing parallel DBSCAN implementations by up to several orders of magnitude, and achieve speedups by up to 33x over the best sequential algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑