[1]周爱武 于亚飞.K-Means聚类算法的研究[J].计算机技术与发展,2011,(02):62-65.
　ZHOU Ai-wu,YU Ya-fei.The Research about Clustering Algorithm of K-Means[J].,2011,(02):62-65.
点击复制

K-Means聚类算法的研究()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2011年02期
页码:
62-65
栏目:
智能、算法、系统工程
出版日期:
1900-01-01

文章信息/Info

Title:
The Research about Clustering Algorithm of K-Means
文章编号:
1673-629X（2011）02-0062-04
作者:
周爱武 于亚飞
安徽大学计算机科学与技术学院
Author(s):
ZHOU Ai-wu; YU Ya-fei
College of Computer Science and Technology,Anhui University
关键词:
K-Means算法; 初始聚类中心; 孤立点
Keywords:
K-Means;  initial clustering centre;  isolated point
分类号:
TP301.6
文献标志码:
A
摘要:
K-Means算法是一种经典的聚类算法,有很多优点,也存在许多不足。比如初始聚类数K要事先指定,初始聚类中心选择存在随机性,算法容易生成局部最优解,受孤立点的影响很大等。文中主要针对K-Means算法初始聚类中心的选择以及孤立点问题加以改进,首先计算所有数据对象之间的距离,根据距离和的思想排除孤立点的影响,然后提出了一种新的初始聚类中心选择方法,并通过实验比较了改进算法与原算法的优劣。实验表明,改进算法受孤立点的影响明显降低,而且聚类结果更接近实际数据分布
Abstract:
The algorithm of K-means is one kind of classical clustering algorithm,including both many points and also shortages.For example must choose the initial clustering number.The choose of initial clustering centre has randomness.The algorithm receives locally optimal solution easily,the effect of isolated point is serious.Mainly improved the choice of initial clustering centre and the problem of isolated point.First of all,the algorithm calculated distance between all data and eliminated the effect of isolated point.Then proposed one new method for choosing the initial clustering centre and compared the algorithm having improved and the original algorithm using the experiment.The experiments indicate that the effect of isolated point for algorithm having improved reduces obviously,the results of clustering approach the actual distribution of the data

相似文献/References:

[1]耿筱媛 张燕平 闫屹.改进的K—means算法在电信客户细分中的应用[J].计算机技术与发展,2008,(05):163.
　GENG Xiao-yuan,ZHANG Yan-ping,YAN Yi.Application of Improved K - means Algorithm Subdivision of Telecom Clients[J].,2008,(02):163.
[2]黄韬 刘胜辉 谭艳娜.基于k-means聚类算法的研究[J].计算机技术与发展,2011,(07):54.
　HUANG Tao,LIU Sheng-hui,TAN Yan-na.Research of Clustering Algorithm Based on K-means[J].,2011,(02):54.
[3]周爱武 陈宝楼 王琰.K-Means算法的研究与改进[J].计算机技术与发展,2012,(10):101.
　ZHOU Ai-wu,CHEN Bao-lou,WANG Yan.Research and Improvement of K-Means Algorithm[J].,2012,(02):101.
[4]周婷,张君瑛,罗成.基于Hadoop的K-means聚类算法的实现[J].计算机技术与发展,2013,(07):18.
　ZHOU Ting[],ZHANG Jun-ying[],LUO Cheng[].Realization of K-means Clustering Algorithm Based on Hadoop[J].,2013,(02):18.
[5]何聚厚,范文静.基于改进K-Means算法的教学反思文本聚类研究[J].计算机技术与发展,2013,(11):99.
　HE Ju-hou[],FAN Wen-jing[].Research on Text Clustering of Teaching Reflection Based on Improved K-Means Algorithm[J].,2013,(02):99.
[6]谢秀华,李陶深.一种基于改进PSO的K-means优化聚类算法[J].计算机技术与发展,2014,24(02):34.
[7]尹成祥 张宏军,张睿,綦秀利,等. 一种改进的K-Means算法[J].计算机技术与发展,2014,24(10):30.
　YIN Cheng-xiang,ZHANG Hong-jun,ZHANG Rui,et al. An Improved K-Means Clustering Algorithm[J].,2014,24(02):30.
[8]袁武,任勋益. 水平分割数据的保护隐私聚类挖掘方法研究[J].计算机技术与发展,2015,25(05):115.
　YUAN Wu,REN Xun-yi. Research on Privacy Preserving Clustering Method for Horizontal Partitioned Data[J].,2015,25(02):115.
[9]李振,贾瑞玉. 一种改进的K-means蚁群聚类算法[J].计算机技术与发展,2015,25(12):28.
　LI Zhen,JIA Rui-yu. An Improved K-means Ant Colony Clustering Algorithm[J].,2015,25(02):28.
[10]唐丹[],张正军[],王俐莉[]. 基于改进的近邻传播聚类算法的Gap统计研究[J].计算机技术与发展,2017,27(01):182.
　TANG Dan[],ZHANG Zheng-jun[],WANG Li-li[]. Study on Gap Statistic Based on Modified Affinity Propagation Clustering[J].,2017,27(02):182.
[11]杨永涛,李静.一种改进的K-means数字资源聚类算法[J].计算机技术与发展,2014,24(06):107.
　YANG Yong-tao[],LI Jing[].An Improved K-means Clustering Algorithm for Digital Resources[J].,2014,24(02):107.

备注/Memo

备注/Memo:
安徽省教育科研重点项目（KJ2009A57）周爱武（1965-），女，副教授，研究方向为数据库与web技术、数据仓库与数据挖掘、信息系统安全
更新日期/Last Update: 1900-01-01