| 注册
首页|期刊导航|计算机与数字工程|蚁群聚类算法中邻域变化规律的研究

蚁群聚类算法中邻域变化规律的研究

牛永洁 薛苏琴

计算机与数字工程2013,Vol.41Issue(4):516-517,657,3.
计算机与数字工程2013,Vol.41Issue(4):516-517,657,3.

蚁群聚类算法中邻域变化规律的研究

Neighborhood's Variation in Ant Colony Clustering Algorithm

牛永洁 1薛苏琴1

作者信息

  • 折叠

摘要

Abstract

In order to improve the clustering effect of the LF algorithm, two different ways of neighborhood increases linearly and neighborhood decreases linearly were used in iterative process of the improvement of basic LF algorithm. Result of neighborhood linear decrement method are better than the neighborhood increment and the neighborhood remain unchanged. The result was verified by Iris and Wine data in UCI data sets and FM was a criterion for clustering effect. Because clustering datas were rough classification through decreasing strategy in the early running of the algorithm, with decrease gradually of neighborhood, the granularity of data classification was refined. The best results of clustering was achieved at the end of iterative.

关键词

蚁群聚类/邻域/递增/递减/全局记忆

Key words

ant colony clustering/ neighborhood/ increment/ decrement, global memory

分类

信息技术与安全科学

引用本文复制引用

牛永洁,薛苏琴..蚁群聚类算法中邻域变化规律的研究[J].计算机与数字工程,2013,41(4):516-517,657,3.

基金项目

陕西省高等继续教育教学改革研究项目:基于碎片化学习理念的继续教育E-learning平台开发与研究(编号:11J23)资助. (编号:11J23)

计算机与数字工程

1672-9722

访问量3
|
下载量0
段落导航相关论文