一种基于密度的启发性群体智能聚类算法  

A Heuristic Density-Based Clustering Algorithm of Swarm Intelligence

作　　者：陈云飞[1] 刘玉树[1] 钱越英[1] 赵基海[1] 

机构地区：[1]北京理工大学信息科学技术学院计算机科学工程系,北京100081

出　　处：《北京理工大学学报》2005年第1期45-48,53,共5页Transactions of Beijing Institute of Technology

基　　金：国家部委预研项目(10405033)

摘　　要：提出一种基于密度的启发性群体智能聚类算法.针对以往群体智能聚类算法中分类错误率较高、算法运行时间较长等不足,提出记忆体方法和基于密度的先行(lookahead)策略.用人工数据集和真实数据集进行实验,将实验结果进行比较分析.分析结果表明,基于密度的启发性群体智能聚类算法能够得到令人满意的聚类结果,其分类错误率和运行时间明显小于其它聚类算法.A new heuristic density-based ant colony clustering algorithm (HDACC) is presented.The device of memory bank is first proposed, which brings forth the heuristic knowledge guiding ant to move in the bi-dimensional grid space. In this way, the algorithm's convergence is speeded up and the appearance of 'un-assigned data object' avoided, and the error rate in classification drops subsequently. A density-based method is then proposed permiting each ant to look ahead and reduces the number of times in region-inquiry. Consequently the clustering time is saved. Some experiments were made on real and synthetic date sets. Experimental results were compared with those obtained using other classical clustering algorithms. The results demonstrated that the proposed HDBCSI is a viable and effective clustering algorithm.

关 键 词：密度 群体智能 聚类算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]