非均匀数据的变异系数聚类算法

Coefficient of variation clustering algorithm for non-uniform data

针对现有基于划分的聚类算法无法有效聚类簇大小和簇密度有较大差异的非均匀数据的问题,提出一种基于变异系数聚类算法。从聚类优化目标的角度出发,分析了以K-means为代表的划分聚类算法引发"均匀效应"的成因;提出以变异系数度量非均匀数据的分布散度,并基于变异系数定义一种非均匀数据的相异度公式;基于相异度公式定义了聚类目标优化函数,并根据局部优化方法给出聚类算法过程。在合成和真实数据集上的试验结果表明,与K-means、Verify2、ESSC聚类算法相比,本研究提出的非均匀数据的变异系数聚类算法(coefficient of variation clustering for non-uniform data,CVCN)聚类精度提升5%~40%。

Affected by the＂uniform effect＂,a problem existed in the partition-based algorithms remained on open and challenging taskdue to handling. To solve this problem,a clustering algorithm based on coefficient of variation was proposed. The＂uniform effect＂caused by K-means-type partitioning clustering algorithm from the view of clustering optimization was analyzed. Instead of the squared error,a new measure of dispersion for non-uniform data was proposed relied on the coefficient of variation. The clustering objective optimization function was defined using a new non-uniform data dissimilarity formula,which was proposed based on the coefficient of variation. According to the local optimization method,the clustering algorithm process was given. The experimental results on real and synthetic non-uniform datasets showed that the clustering accuracy of CVCN was better than K-means,Verify2,ESSC.