文件名称:AnImprovedHeuristicAnt-ClusteringAlgorithm
介绍说明--下载内容均来自于网络,请自行研究使用
本文提出了一种可以带来启发式知识指导蚂蚁在二维网格空间移动。降低移动蚂蚁的随机性,避免了产生“未分配的数据对象”。我们通过实验结果表明,这种改进的聚类启发式蚁群算法具有优越性并减少在经典算法的运行时间。-An improved heuristic ant—clustering algorithm(HAC)is presented in this paper.A device of memory bank is
proposed,which can bring forth heuristic knowledge guiding ant to move in the bi—dimension grid space. The device
lowers the randomness of ants moving and avoids the producing of“un-assigned data object”.we have made some
experiments on real data sets and synthetic data sets.The results demonstrate that HAC has superiority in
misclassification en"or rate and runtime over the classical algorithm.
proposed,which can bring forth heuristic knowledge guiding ant to move in the bi—dimension grid space. The device
lowers the randomness of ants moving and avoids the producing of“un-assigned data object”.we have made some
experiments on real data sets and synthetic data sets.The results demonstrate that HAC has superiority in
misclassification en"or rate and runtime over the classical algorithm.
相关搜索: hac
(系统自动生成,下载前可以参看下载内容)
下载文件列表
AnImprovedHeuristicAnt-ClusteringAlgorithm.pdf