| 可变阈值的K-Means初始中心选择方法 |
| |
| 引用本文： | 刘一鸣,张化祥.可变阈值的K-Means初始中心选择方法[J].计算机工程与应用,2011,47(32):56-58. |
| |
| 作者姓名： | 刘一鸣 张化祥 |
| |
| 作者单位： | 山东师范大学 信息科学与工程学院，济南 250014 |
| |
| 基金项目： | 山东省科技研究计划项目(No.2007ZZ17,No.2008GG10001015,No.2008B0026); 山东省教育厅科研项目(No.J09LG02) |
| |
| 摘 要： | K-Means算法随机选择聚类中心初始点，导致聚类器性能不稳定。对此，提出基于可变阈值的初始聚类中心选择方法（VTK-Means）。该算法选择距已有初始点距离大于一个阈值的样例作为初始聚类中心，并根据满足条件的初始聚类中心个数适当调整阈值。在10个UCI数据集上的实验结果表明，该算法性能明显优于K-Means算法。
|
| 关 键 词： | K-Means 聚类 可变阈值 初始聚类中心 |
| 修稿时间： | |
Approach to selecting initial centers for K-Means with variable threshold |
| |
| LIU Yiming,ZHANG Huaxiang.Approach to selecting initial centers for K-Means with variable threshold[J].Computer Engineering and Applications,2011,47(32):56-58. |
| |
| Authors: | LIU Yiming ZHANG Huaxiang |
| |
| Affiliation: | Department of Information Science and Engineering，Shandong Normal University，Jinan 250014，China |
| |
| Abstract: | The K-Means algorithm selects the initial clustering centers randomly,which results in the performance of the clustering instability.In order to improve the limitation,a novel clustering algorithm(VTK-Means) based on variable threshold to select initial cluster centers is proposed in this paper.The algorithm tries to select the points whose distances to the existing initial points are longer than a threshold as the initial cluster centers,and then it appropriately adjusts the threshold according to the numb... |
| |
| Keywords: | K-Means clustering variable threshold initial cluster center
|
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
