一种基于密度的引力聚类算法  

A Gravitational Clustering Algorithm Based on Density

作　　者：张天伍[1] 李卫平[2] 

机构地区：[1]河南工程学院计算机科学与工程系,河南新郑451191 [2]中原工学院信息商务学院计算科学系,郑州450007

出　　处：《河南科学》2008年第11期1400-1404,共5页Henan Science

摘　　要：针对传统基于距离的聚类算法所存在的缺点,将万有引力和牛顿第二运动定律思想引入到聚类过程中,提出了一种改进的基于密度的引力聚类算法GCABD.该算法可以自动决定目标数据集中的簇的个数,并且能发现任意形状的簇且可以过滤"噪声"数据.实验结果表明,所提出的GCABD算法的聚类效果和精度均比典型的K-means算法好,提高了聚类质量.Directing against the drawbacks of traditional algorithm based on distance,the paper introduces gravitation and Newton second law of motion into the process of clustering, and proposes an improved algorithm GCABD （Gravitational Clustering Algorithm Based on Density）. This algorithm can decide automatically the number of clusters in the target data set, and find any clusters with arbitrary forms and filter the noisy data. The experimental results show that GCABD algorithm is superior than typical K-means algorithm in clustering effect and precision, enhances the clustering quality greatly.

关 键 词：数据挖掘 聚类分析 聚类算法 引力 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]