基于改进粒计算Kmedoids聚类算法.docVIP

基于改进粒计算Kmedoids聚类算法 　　摘 要: 　　 　　针对传统??K????medoids聚类算法对初始聚类中心敏感、收敛速度缓慢以及聚类精度不够高等缺点，提出一种基于改进粒计算、粒度迭代搜索策略和优化适应度函数的新算法。该算法利用粒计算思想在有效粒子中选择??K?Ц雒芏却笄揖嗬虢显兜牧Ｗ樱?选择其中心点作为??K?Ц鼍劾喑跏贾行牡悖徊⒃诙杂Φ莫?K?Ц鲇行ЯＷ又薪?行中心点更新，来减少迭代次数；采用类间距离和类内距离优化适应度函数来提高聚类的精度。实验结果表明：该算法在UCI多个标准数据集中测试，在有效缩短迭代次数的同时提高了算法聚类准确率。 　　?ス丶?词:??K????medoids聚类算法；改进粒计算；粒度迭代搜索策略；优化适应度函数 　　 　　 　　?ブ型挤掷嗪?: TP301.6 　　 　　文献标志码:A 　　英文标题?? 　　 　　Improved ??K????medoids clustering algorithm based on improved granular computing 　　?び⑽淖髡呙? 　　 　　 　　PAN Chu???┆?*??, LUO Ke 　　?び⑽牡刂?( 　　 　　 　　School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha Hunan 410114, China 　　 　　英文摘要)?? 　　Abstract: 　　Due to the disadvantages such as sensitive to the initial selection of the center, slow convergent speed and poor accuracy in traditional ??K????medoids clustering algorithm, a novel ??K????medoids algorithm based on improved Granular Computing (GrC), granule iterative search strategy and a new fitness function was proposed in this paper. The algorithm selected ??K?? granules using the granular computing thinking in the high??density area which were far apart, selected its center point as the ??K?? initial cluster centers, and updated ??K?? center points in candidate granules to reduce the number of iterations. What??s more, a new fitness function was presented based on between??class distance and within??class distance to improve clustering accuracy. Tested on a number of standard data sets in UCI, the experimental results show that this new algorithm reuduces the number of iterations effectively and improves the accuracy ofclustering. 　　英文关键词??Key words: 　　 　　??K????medoids clustering algorithm; improved granular computing; granule iterative search strategy; improved fitness function?? 　　0 引言?? 　　聚类算法是根据数据的相似性将数据对象划分在不同簇中的过程，使得同一簇中的对象具有较高的相似度，不同簇中数据对象不相似。 ??K????medoids算法是属于基于划分方法的一种????［1］??，是??K????means算法的改进。??K????medoids算法能有效处理异常数据和噪声数据，具有很好的鲁棒性，所以在聚类算法中得到广泛的应用。但是在