一种基于密度的模糊自适应聚类算法

A density-based fuzzy adaptive clustering algorithm

  • 摘要: 针对密度聚类算法对邻域参数设置敏感的问题,提出一种基于密度的模糊自适应聚类算法.算法在无需预先设置聚类数以及邻域参数的情况下,可以自适应地根据样本间距离关系确定邻域半径得到样本密度,并根据样本密度逐渐增加聚类中心.为了保障聚类结果的正确性,同时提出一种新的模糊聚类有效性指标以判断最佳聚类数,消除了密度聚类算法对参数的敏感性.用UCI基准数据集进行实验,发现本文算法在对数据进行聚类时,聚类质量较原始密度聚类算法在准确性和自适应性方面均有显著提高.

     

    Abstract: In order to solve the problem that the density clustering algorithm is sensitive to neighborhood parameters, this article introduces a density-based fuzzy adaptive clustering algorithm. Without predefined clustering number and neighborhood parameters, this algorithm adaptively determines the radius of neighborhood to obtain the density of each sample and increases cluster centers based on the density. A new validity measure for fuzzy clustering is proposed to choose the best clustering number so that the sensitivity of density clustering is eliminated. UCI benchmark data sets are used to compare the proposed algorithm and the traditional density clustering algorithm. Experiment results demonstrate that the proposed algorithm improves the clustering accuracy and the adaptability effectively.

     

/

返回文章
返回