| 一种K-means算法的k值优化方案 |
| |
| 引用本文： | 吴艳文,胡学钢. 一种K-means算法的k值优化方案[J]. 巢湖学院学报, 2007, 9(6): 21-24 |
| |
| 作者姓名： | 吴艳文 胡学钢 |
| |
| 作者单位： | 合肥工业大学计算机与信息学院,安徽,合肥,230000 |
| |
| 摘 要： | 聚类算法是数据挖掘中核心技术之一,而k-means算法在经典聚类算法中占有重要地位。针对k-means聚类算法的最佳聚类个数k不易获得,因而使得该聚类算法的应用受到限制,为此提出一种k值优化方法:通过给出大于最佳聚类数的可能聚类数,而得到优化的聚类个数。通过实例给予验证,其结果说明该方法合理有效。
|
| 关 键 词： | 聚类 k均值算法 聚类数优化 数据挖掘 |
| 文章编号： | 1672-2868（2007）06-0021-04 |
| 修稿时间： | 2007-10-04 |
PROJECT ABOUTt OPTIMIZED THE NUMBER OF CLUSTERS IN K-MEANS CLUSTERING |
| |
| WU Yan-wen,HU Xue-gang. PROJECT ABOUTt OPTIMIZED THE NUMBER OF CLUSTERS IN K-MEANS CLUSTERING[J]. Chaohu College Journal, 2007, 9(6): 21-24 |
| |
| Authors: | WU Yan-wen HU Xue-gang |
| |
| Abstract: | clustering is the one of core technology in data mining.K-means algorithm is a very famous clustering algorithm in the classical clustering.The paper focus on the clustering number of k-means algorithm which is hard to be given and hinders the application.So the paper puts forward a novel k optimized method,which we can obtain the optimized number of clusters if we afford a maximum number of clusters.The test experiment has proved the method reasonable and right. |
| |
| Keywords: | Clustering k-means algorithm clustering number optimized data mining |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
