聚类分析算法的研究与改进.pdfVIP

聚类分析算法的研究与改进 聚类分析算法的研究与改进 赵炜妹，郭庆琳 （华北电力大学计算机学院，北京，102206） THE STUDY ON THE CLUSTERING ALGORITHM ZHAO Weimei , GUO Qinglin (Department of Computer Science, North China Electric Power University, Beijing, 102206) ABSTRACT: This paper elaborated on the field of data sets 0 引言 on the clustering. Cluster analysis commonly used in data 近年来，随着数据库技术的发展和数据库应用 mining comes to be hard problems for the huge data, different 的日益普及，人们积累的数据量正在以指数速度迅 date types etc. Traditional cluster analysis method often based 速增长，展现在人们而前的己不再是局限于本部 on k-average cluster algorithm which is very sensitive on the 门、本单位、本行业的庞大数据库，而是浩瀚无垠 accession of a big value isolated point because this point would 的信息海洋。如何从海量的数据中找到真正有用的 have great impact on the center values. This paper put forward 信息成为人们关注的焦点，数据挖掘技术中的聚类 a theory based on the algorithm annealing to improve the tradition k-average clustering arithmetic. By using simulation 分析是解决这一问题的有效途径。 annealing strategy, the distances from each sample point to 目前，已有的聚类算法多以k 均值算法为基础， center as well as points distribution would be considered during 不能有效的解决当一个是极大值的孤立点加入时 the process of guiding the sample point to its class and 所导致的数据分布的失真。本文中提出的基于退火 computing cluster central point. The improvement clustering 理论的改进算法，通过模拟退火过程，找到全局或 algorithm achieves the better cluster effect, and avoids because 逼近全局的最优解。理论分析和试验结果表明，算 the isolated point data creates the cluster finally partial 法是有效可行的。 optimization. Theoretical analysis and experimental results all show that this algorithm is an effective solution to problem of