基于类间差异最大化的加权距离改进K-means算法

J4 ›› 2010, Vol. 45 ›› Issue (7): 28-33.

基于类间差异最大化的加权距离改进K-means算法

张雪凤1,刘鹏1,2

1. 上海财经大学信息管理与工程学院, 上海 200433; 2. 上海财经大学继续教育学院, 上海 200080

收稿日期:2010-04-02 出版日期:2010-07-16 发布日期:2010-09-06
作者简介:张雪凤(1969-),女,副教授,主要研究方向为数据挖掘等.Email:xfzhang@sufe.edu.cn
基金资助:
上海财经大学‘211工程’三期重点学科建设项目

An improved K-means algorithm by weighted distance based on maximum between-cluster variation

ZHANG Xue-feng1, LIU Peng1,2

1. School of Information Management and Engineering, Shanghai University of Finance ＆ Economics, Shanghai 200433, China;
2. School of Continuing Education, Shanghai University of Finance ＆ Economics, Shanghai 200080, China

Received:2010-04-02 Online:2010-07-16 Published:2010-09-06

摘要/Abstract

摘要：

为了改善K-means算法的聚类效果，将聚类准则函数定义为加权的类内误差平方总和SSE(sum of the squared error),并调整了K-means算法迭代过程中重新分配数据对象的方法:使用一个带有类内数据对象数的加权距离作为重新分配数据对象的依据,同时按类间差异最大化为准则优化了加权距离中的参数。实验表明,改进后的K-means算法可以在很大程度上减少大类被拆分情况的发生,明显改善聚类效果。

关键词: K-means算法;聚类;类间差异;加权距离

Abstract:

To find natural clusters, the criterion function was improved by being defined as the weighted sum of the squared error. The way each point being assigned to the centroid in the iteration of the K-means algorithm was also modified: each point was assigned to the centroid that had minimum weighted distance. The weight was related with the number of points in each cluster, and the parameter of weighted distance was optimized by maximizing the between-cluster variation. Experimental results showed that the improved K-means algorithm significantly enhanced the clustering quality by reducing the probability of larger cluster’s being broken.

Key words: K-means algorithm; clustering; between-cluster variation; weighted distance

张雪凤1,刘鹏1,2. 基于类间差异最大化的加权距离改进K-means算法[J]. J4, 2010, 45(7): 28-33.

ZHANG Xue-feng1, LIU Peng1,2. An improved K-means algorithm by weighted distance based on maximum between-cluster variation[J]. J4, 2010, 45(7): 28-33.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed