基于网格结构的CLARANS改进算法  

Improved CLARANS Algorithm Based on Grid Structure

作　　者：张书春[1] 孙秀英[2] 

机构地区：[1]郑州大学信息工程学院,郑州450002 [2]黄河科技学院,郑州450063

出　　处：《计算机工程》2012年第6期56-59,共4页Computer Engineering

基　　金：上海市自然科学基金资助项目(042R14077);河南省科技攻关计划基金资助项目(2011C520016)

摘　　要：为提高CLARANS算法的准确性和执行效率,利用网格聚类算法对数据空间进行划分的思想,结合统计信息网格算法,对算法初始节点和邻居节点的选择及替换总代价的计算进行改进。实验结果表明,与CLARANS算法相比,改进算法聚类结果的准确性和稳定性更高,执行时间明显降低。In order to improve the accuracy and efficiency of Clustering Large Applications based on Randomized Search（CLARANS） algorithm, this paper combines the idea of data space division which comes from grid-based algorithm Statistical Information Grid（STING）, improves the CLARANS algorithm by optimizing the selection of initial node and neighbor node, optimizing the calculation of total node replaces cost. Experimental results show that, compared with the CLARANS algorithm, the improved algorithm has better accuracy and stability for the clustering results, and significantly reduce the execution time.

关 键 词：CLARANS算法 统计信息网格算法 聚类 相异度 数据空间 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]