| 一种改进的K-means聚类算法 |
| |
| 引用本文： | 王燕. 一种改进的K-means聚类算法[J]. 计算机应用与软件, 2004, 21(10): 122-123 |
| |
| 作者姓名： | 王燕 |
| |
| 作者单位： | 浙江警官职业学院信息管理系,杭州,310018 |
| |
| 摘 要： | 本文提出了一种改进的K-means算法(FKN)。此算法将传统算法任意选取初始聚类中心变为选取出现频率最高的一组颜色作为初始聚类中心，从而极大地提高了K-means的速度。通过实验证明了FKN较K-means有较低的时间复杂性及较低的颜色平均误差。
|
| 关 键 词： | 色彩量化 聚类分析 图像处理 |
A MODIFIED K-MEANS CLUSTERING ALGORITHM |
| |
| Wang Yan. A MODIFIED K-MEANS CLUSTERING ALGORITHM[J]. Computer Applications and Software, 2004, 21(10): 122-123 |
| |
| Authors: | Wang Yan |
| |
| Abstract: | In this paper a modified K-means algorithm(FKM) is presented.FKM chooses a set of colors which appear most frequently,instead of random choices as private clustering center,and the computation time is greatly reduced.It is proved by the tests that FKM has the less time complexity and the lower mean error of color. |
| |
| Keywords: | Color quantization Clustering analyzing Image processing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
