摘要
通过对真实世界蚁群的模拟仿真,提出一种基于随机游走的约束蚂蚁聚类算法来处理以must-link和can-not-link形式出现的约束聚类问题.在人工数据集和UCI标准数据集上的实验结果表明我们的算法优于无监督的蚁群聚类算法和COP-Kmeans算法.
By simulating the clustering behaviors of the real-world ant colonies,we propose in this paper a constrained ant clustering algorithm based on random walk to deal with the constrained clustering problems with pairwise must-link and cannot-link constraints.Experimental results show that our approach is more effective on both synthetic datasets and UCI datasets compared with the unsupervised random walk ant-based clustering algorithm and the COP-Kmeans algorithm.
出处
《微电子学与计算机》
CSCD
北大核心
2012年第4期169-172,共4页
Microelectronics & Computer
基金
国家自然科学基金项目(61003180
61070047)
江苏省科技厅自然科学基金项目(BK2010318)
江苏省教育厅自然科学基金项目(09KJB20013B)
关键词
约束聚类
蚂蚁聚类
随机游走
constrained clustering
ant clustering
random walk
