罗军锋, 锁志海. 一种基于密度的k-means聚类算法[J]. 微电子学与计算机, 2014, 31(10): 28-31.
引用本文: 罗军锋, 锁志海. 一种基于密度的k-means聚类算法[J]. 微电子学与计算机, 2014, 31(10): 28-31.
LUO Jun-feng, SUO Zhi-hai. A Density Based k-means Clustering Algorithm[J]. Microelectronics & Computer, 2014, 31(10): 28-31.
Citation: LUO Jun-feng, SUO Zhi-hai. A Density Based k-means Clustering Algorithm[J]. Microelectronics & Computer, 2014, 31(10): 28-31.

一种基于密度的k-means聚类算法

A Density Based k-means Clustering Algorithm

  • 摘要: 针对k-means算法中对初始聚类中心和孤立点敏感的缺点,提出一种基于密度的改进k-means算法.该算法引入信息熵和加权距离,从近邻密度出发,去除孤立点对算法的影响,同时确定初始聚类中心,使得聚类中心相对稳定.实验表明,该算法在准确性、运行效率上均有10%以上的提升.

     

    Abstract: For k-means algorithm to the initial cluster centers,sensitive to outliers shortcomings,we propose a density-based improved k-means algorithm.The algorithm introduces entropy and weighted distance,starting from the neighbor density,remove the isolated points on the algorithm while determining the initial cluster centers,making the cluster center is relatively stable.Experimental results show that the algorithm in terms of accuracy,operating efficiency has a very good improvement.

     

/

返回文章
返回