基于距离浓度的K-均值聚类算法  

K-means clustering algorithm based distance concentration

作　　者：刘韬[1] 蔡淑琴[1] 曹丰文[2] 崔志磊[2] 

机构地区：[1]华中科技大学管理学院,湖北武汉430074 [2]苏州职业大学电子信息工程系,江苏苏州215104

出　　处：《华中科技大学学报（自然科学版）》2007年第10期50-52,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(70271030);中国博士后科学基金资助项目(20060390849);华中科技大学博士后科研专项基金资助项目

摘　　要：提出的基于距离浓度的K-均值聚类算法把聚类的数据对象视为抗原,聚类中心看作是免疫系统中的抗体,聚类过程表示为免疫系统不断产生抗体,识别抗原,最后产生出可以捕获抗原的最佳抗体过程.定义了抗体浓度和亲和度,使得抗体之间的距离越大,其距离浓度越小,反之则浓度越大,从而提高了算法的搜索效率.设计了抗体的期望繁殖率计算方法和克隆变异方法.仿真结果表明:该算法不仅克服了传统的K-均值聚类算法易陷入局部极小值的缺点,而且避免了对初始化选值敏感性的问题,同时也有较快的收敛速度.Using the immune recognizing principle,the data object to cluster was denoted as the antigens set,and the clustering center was the antibodies set.The clustering was the process to obtain the best antibodies to catch the antigens by producing the antibodies and recognizing the antigens unceasingly.The distance concentration and the affinity,between antibody and antigen,and between antibody and antibody,were defined about the K-means clustering.It makes that the longer the distance between antibodies is,the lower the distance concentration is,per contra.This design improves the clustering search efficiency.The antibody reproduction function was also proposed,and the antibody cloning algorithm was presented simultaneously.The experimental results show that the algorithm not only avoids the local optima and is robust to initialization,but also increases the convergence speed.

关 键 词：聚类 距离浓度 免疫 算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]