块对角引导的 DBSCAN 聚类
Block-Diagonal Guided DBSCAN Clustering
AI总结:
针对DBSCAN难以处理高维大规模数据、对参数敏感及鲁棒性差的问题,提出利用相似图的块对角性质指导聚类,结合梯度下降与密度遍历算法,在十二个基准数据集上表现优于现有方法。
摘要:
聚类分析在数据库挖掘中起着至关重要的作用,而 DBSCAN 是该领域最广泛使用的算法之一。然而,DBSCAN 存在一些局限性,例如难以处理高维大规模数据、对输入参数敏感,以及在产生聚类结果时缺乏鲁棒性。本文引入了 DBSCAN 的改进版本,利用相似图的块对角性质来指导 DBSCAN 的聚类过程。核心思想是构建一个图,用于度量高维大规模数据点之间的相似度,并且该图具有通过未知置换转换为块对角形式的潜力,随后通过聚类排序过程生成所需的置换。通过识别置换图中对角块,可以轻松确定聚类结构。我们提出了一种基于梯度下降的方法来求解所提出的问题。此外,我们开发了一种基于 DBSCAN 的密度遍历算法,该算法识别图中具有高密度的聚类,并生成增广的聚类排序。然后,基于遍历顺序通过置换实现图的块对角结构,为自动和交互式聚类分析提供了灵活的基础。我们引入了一种分割与精炼算法,以在特定条件下自动搜索置换图中的所有对角块,并具有理论上的最优保证。我们在十二个具有挑战性的现实世界基准聚类数据集上广泛评估了所提出的方法,并证明了其在每个数据集上相较于最先进聚类方法的优越性能。
英文摘要:
Cluster analysis plays a crucial role in database mining, and one of the most widely used algorithms in this field is DBSCAN. However, DBSCAN has several limitations, such as difficulty in handling high-dimensional large-scale data, sensitivity to input parameters, and lack of robustness in producing clustering results. This paper introduces an improved version of DBSCAN that leverages the block-diagonal property of the similarity graph to guide the clustering procedure of DBSCAN. The key idea is to construct a graph that measures the similarity between high-dimensional large-scale data points and has the potential to be transformed into a block-diagonal form through an unknown permutation, followed by a cluster-ordering procedure to generate the desired permutation. The clustering structure can be easily determined by identifying the diagonal blocks in the permuted graph. We propose a gradient descent-based method to solve the proposed problem. Additionally, we develop a DBSCAN-based points traversal algorithm that identifies clusters with high densities in the graph and generates an augmented ordering of clusters. The block-diagonal structure of the graph is then achieved through permutation based on the traversal order, providing a flexible foundation for both automatic and interactive cluster analysis. We introduce a split-and-refine algorithm to automatically search for all diagonal blocks in the permuted graph with theoretically optimal guarantees under specific cases. We extensively evaluate our proposed approach on twelve challenging real-world benchmark clustering datasets and demonstrate its superior performance compared to the state-of-the-art clustering method on every dataset.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。