计算机应用研究2012，Vol.29Issue(8)：2865-2867,3.DOI:10.3969/j.issn.1001-3695.2012.08.017
一种基于代表点的增量聚类算法
Incremental clustering algorithm based on representative points
摘要
Abstract
As the existing incremental clustering algorithms have various disadvantages such as high sensitivity to parameters, high time-space complexity, etc. This paper presented an incremental algorithm based on representative points. It first used the static clustering algorithm based on representative points to cluster the original data set. Then according the relationship between the new points and the existing representative points, the algorithm judged whether the new points should be added to the clusters containing the existing representative points or promoted as new representative points. Finally it used the static clustering algorithm again to cluster the new points. Experimental result shows that this algorithm is insensible to parameters, efficient and occupies little space.关键词
代表点/节点属性/增量聚类Key words
representative points/properties of the new points/incremental clustering分类
信息技术与安全科学引用本文复制引用
孟凡荣,李晓翠,周勇..一种基于代表点的增量聚类算法[J].计算机应用研究,2012,29(8):2865-2867,3.基金项目
国家教育部博士点基金资助项目(20100095110003) （20100095110003）
国家博士后科学基金资助项目(20070421041) （20070421041）
江苏省博士后科学基金资助项目(0701045B) （0701045B）
中国矿业大学科技基金资助项目(2007B017) （2007B017）
