本文已被：浏览 1526次 下载 3272次
Received:December 29, 2011 Revised:March 14, 2012
Received:December 29, 2011 Revised:March 14, 2012
中文摘要: 每一种聚类算法都有其适合处理的特定分布的数据集. 为了给未知分布数据集挑选合适的聚类算法, 提出了一种挑选聚类算法的网格连通图方法SCGG. SCGG通过对数据潜在类结构的分析, 若含有环形结构类则选择层次聚类的单连接算法对数据聚类, 否则选择k-means算法. 实验显示该方法十分的有效, 能够挑选到合适的聚类算法对数据聚类.
Abstract:Each clustering algorithm has its suitable treatment of specific distribution data set. The SCGG method based on the Grid-Connected Graph is proposed to select suitable clustering algorithm for unknown distribution data set. The SCGG method analyses the potential structure of the data set. If the data set has ring clustering structure, the method select a single hierarchiral clustering algorithm, otherwise it selects the k-means. Experiment results show that SCGG is very efficient and successful.
文章编号： 中图分类号： 文献标志码：
基金项目:国家自然科学基金(61175123);福建省教育厅资助项目(JA09043);高校产学合作重大项目(2010H6007)
引用文本：
李翔宇,王开军,郭躬德.挑选聚类算法的网格连通图方法.计算机系统应用,2012,21(9):103-107
LI Xiang-Yu,WANG Kai-Jun,GUO Gong-De.Selection of Clustering Algorithms Based on Grid-Connected Graph.COMPUTER SYSTEMS APPLICATIONS,2012,21(9):103-107
李翔宇,王开军,郭躬德.挑选聚类算法的网格连通图方法.计算机系统应用,2012,21(9):103-107
LI Xiang-Yu,WANG Kai-Jun,GUO Gong-De.Selection of Clustering Algorithms Based on Grid-Connected Graph.COMPUTER SYSTEMS APPLICATIONS,2012,21(9):103-107
