一种改进的基于粒子群的粗糙K-medoids算法  

Improved rough K-medoids algorithm based on particle swarm optimization

作　　者：杨志[1] 罗可[1] 

机构地区：[1]长沙理工大学计算机与通信工程学院,长沙410114

出　　处：《计算机工程与应用》2014年第20期110-114,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.11171095;No.71371065);湖南省自然科学衡阳联合基金(No.10JJ8008);湖南省科技计划项目(No.2013SK3146)

摘　　要：针对K-medoids算法的全局搜索能力弱和迭代计算过程计算量大的不足,提出了一种改进的基于粒子群的粗糙K-medoids算法。该算法通过粒子群算法来改善K-medoids全局搜索能力,通过计算样本集的相异度矩阵来简化粒子群编码,引入粗糙集理论处理边界模糊数据,并利用记忆技术对K-medoids的迭代过程进行优化,降低算法的复杂度。通过对UCI中的Iris、Mushroom数据集测试,该算法的准确率提高,运行时间减少。The K-me doids algorithm has the disadvantage of global search ability and large amount of the iterative calcu-lation, this paper proposes an improved rough K-medoids algorithm based on Particle Swarm Optimization（PSO）. By introducing PSO to strengthen its global search ability and calculating the dissimilarity matrix of sample set to simplify coding particle swarm, the rough set theory provides a processing method of dealing with the indeterminacy problem of boundary objects. It uses memorization technique to improve K-medoids iterative calculation, to reduce the complexity of the algorithm. Through testing the Iris, Mushroom data set of UCI, the new algorithm’s accuracy is improved and the time is shortened.

关 键 词：K-medoids算法 粒子群算法 相异度矩阵 粗糙集 记忆技术 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]