一种基于共享近邻的密度聚类算法

A DENSITY CLUSTERING ALGORITHM BASED ON SHARED NEAREST NEIGHBORS

  • 摘要: 针对经典的快速漂移(QuickShift)算法在偏移过程中需要人为地指定领域值,导致在复杂数据集上表现不佳等问题,提出一种改进的共享近邻密度聚类算法(QS-SNN)。该聚类算法基于共享近邻(SNN),计算出样本点之间的相似度;通过相似度衡量得到样本点的局部密度矩阵;通过在SNN领域中对样本点进行快速偏移,得到最终的聚类结果。在多个数据集上进行实验,结果分析表明,该算法比传统的Quickshift算法以及其他的聚类算法在准确度上有了较大的提升。

     

    Abstract: Aimed at the problem that the QuickShift algorithm needs to manually specify the field value in the migration process, which leads to poor performance on complex datasets, an improved shared nearest neighbor density clustering algorithm (QS-SNN) is proposed. The proposed algorithm was based on shared nearest neighbors (SNN). It calculated the similarity of each pair of points in the dataset, obtained the local density matrix of the sample points through the similarity measurement. The sample points were quickly shifted in the SNN field, so that the final clustering result was obtained. Experiments on multiple datasets show that the QS-SNN algorithm has a greater improvement in accuracy than the traditional Quickshift algorithm and other clustering algorithms.

     

/

返回文章
返回