计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (28): 43-45.DOI: 10.3778/j.issn.1002-8331.2010.28.012

• 研究、探讨 • 上一篇    下一篇

聚类邻域自适应调整的多载蚁群算法

沈明明,毛 力   

  1. 江南大学 信息工程学院,江苏 无锡 214122
  • 收稿日期:2010-01-14 修回日期:2010-04-16 出版日期:2010-10-01 发布日期:2010-10-01
  • 通讯作者: 沈明明

New multi-loading ant colony algorithm based on adaptive adjustment of clustering neighborhood

SHEN Ming-ming,MAO Li   

  1. School of Information Technology,Jiangnan University,Wuxi,Jiangsu 214122,China
  • Received:2010-01-14 Revised:2010-04-16 Online:2010-10-01 Published:2010-10-01
  • Contact: SHEN Ming-ming

摘要: 针对基本蚁群聚类算法较长时间开销和易产生冗余聚类数目的缺陷,提出了一种基于动态邻域的多载蚁群聚类算法。算法通过邻域动态自适应调整寻找纯净的邻域,增强蚂蚁记忆体记忆纯净邻域的大小,蚂蚁之间协同交流进行多载整合相似邻域形成最终聚类结果。实验结果表明新算法能有效提高算法效率且取得较好的聚类效果。

关键词: 蚁群聚类算法, 动态邻域, 多载

Abstract: In order to solve the problems that the general antcolony clustering algorithm expenses a long time and easily produces redundant number of clusters,a new multi-loading ant colony clustering algorithm based on dynamic neighborhood is provided.The algorithm seeks for the pure neighborhood through the neighborhood dynamic auto-adapted adjustment,enhances ant’s memory to store the size of the pure neighborhood,exchanges the information between ants,multi-loads and merges the similar regions to form the final cluster result.Experiment shows that the new algorithm effectively advances the efficiency of algorithm and the result of clustering.

Key words: ant colony clustering algorithm, dynamic neighborhood, multi-load

中图分类号: