一种基于网格和密度凝聚点的快速聚类算法  

A fast clustering algorithm based on grid and density condensation point

作　　者：陈卓[1] 孟庆春[1] 魏振钢[1] 任丽婕[1] 窦金凤[1] 

机构地区：[1]中国海洋大学计算机科学系,山东青岛266071

出　　处：《哈尔滨工业大学学报》2005年第12期1654-1657,共4页Journal of Harbin Institute of Technology

基　　金：国家自然科学基金资助项目(60374031);山东省自然科学基金资助项目(Y2002G18)

摘　　要：提出的快速聚类算法通过凝聚点来准确反映数据空间的几何特征,然后采用网格和密度相结合的方法,利用爬山法和连通性原理进行聚类处理,克服了传统网格聚类算法聚类质量降低的缺点.实验结果证明,本算法的聚类效率优于传统爬山法、C lique算法和DBSCAN算法.A new kind of clustering algorithm called CGDCP is presented. The creativity of CGDCP is capturing the shape of data space by condensation points, and then using grid - based and density - based clustering methods based on the theories of a climbing hill algorithm and connectivity to deal with the data. CGDCP retains the good features of grid - based and density - based clustering methods and overcomes the traditional shortcomings of the grid - based clustering method＇s quality debasement resulting from little or no consideration of data distribution when partitioning the grids. Experimental results confirm that the execution efficiency of CGDCP is much better than a traditional climbing hill algorithm and the Clique algorithm.

关 键 词：聚类 网格 密度 牛顿爬山法 凝聚点 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]