基于信息熵的免疫遗传算法聚类分析  

Clustering Analysis of Immune-genetic Algorithm Based on Information Entropy

作　　者：傅平[1] 罗可[1] 

机构地区：[1]长沙理工大学计算机与通信工程学院,长沙410076

出　　处：《计算机工程》2008年第6期227-228,232,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60474070;10471036);湖南省科技计划基金资助项目(05FJ3074)

摘　　要：介绍了基于信息熵的免疫遗传算法的聚类分析方法。将免疫算法引入到遗传算法中,利用免疫算法的免疫记忆、自我调节和多样性保持功能弥补了标准遗传算法的局部搜索能力差、计算量大和早熟收敛等问题。采用DNA进行抗体编码,利用信息熵来表示抗体间亲和度及浓度,并采用聚合亲和度,实现了抗体群的自我调节和多样性保持策略。实验表明,该算法优于标准遗传算法。This paper presents a clustering analysis method of immune genetic algorithm based on entropy. Immune algorithm is introduced into genetic algorithm toincorporate immune algorithm＇s functions such as immune memory, self-adjustability and the keeping of the diversity. The immune-genetic algorithm based on information entropy can overcome the shortcomings of standard genetic algorithm, e. g., poor local search capability, excessive computational cost and premature convergence, etc. This algorithm adopts DNA to code the antibody, and uses information entropy to denote the affinity and the consistence of the antibodies. The converged affinity is presented to achieve self-adjustability of colony, which keeps the diversity of colony. The experiment demonstrates that the algorithm is better than standard genetic algorithm in clustering analysis.

关 键 词：聚类 免疫遗传算法 信息熵 亲和度 

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