| 基于K-means聚类算法的研究 |
| |
| 引用本文： | 步媛媛,关忠仁.基于K-means聚类算法的研究[J].西南民族学院学报(自然科学版),2009,35(1):198-200. |
| |
| 作者姓名： | 步媛媛 关忠仁 |
| |
| 作者单位： | [1]成都信息工程学院计算机系,四川成都610225 [2]成都信息工程学院网络中心,四川成都610225 |
| |
| 摘 要： | 原始的k-means算法是从样本点的集合中随机选取K个中心，这种选取具有盲目性和随意性，它在很大程度上决定了算法的有效性．为消除选取初始中心的盲目性，应充分利用已有数据样本点的信息．采取对数据进行预处理的方式来选取初始中心．实验证明新的初始点的选取不仅提高了算法的计算效率，也提高了算法最终确定的聚类的精度．
|
| 关 键 词： | 数据挖掘 聚类 k-means算法 聚类中心 |
Research of clustering algorithm based on K-means |
| |
| BU Yuan-yuan,GUAN Zhong-ren.Research of clustering algorithm based on K-means[J].Journal of Southwest Nationalities College(Natural Science Edition),2009,35(1):198-200. |
| |
| Authors: | BU Yuan-yuan GUAN Zhong-ren |
| |
| Institution: | BU Yuan-yuan, GUAN Zhong-ren (1. Department of Computer Sciences, Chengdu Institute of In formation Engineering, Chengdu 610041, P.R.C.; 2. Internet Management Center, Chengdu Institute of Information Engineering, Chengdu 610041, P.R.C.) |
| |
| Abstract: | Original k-means clustering algorithm is the means that selects K centers randomly from the data sample cluster .This selection is blind and random, and to a certain extent the validity of algorithm lies on the selection. In order to avoid the blindness of selection, we should make full use of the information of existing data sample dot. We make pre-treatment of the data to choose the initial center. The experiment improves not only the calculation efficiency of algorithm, but also the precision of ultimate clustering. |
| |
| Keywords: | data mining clustering K-means clustering center |
| 本文献已被 维普 万方数据 等数据库收录！ |
