基于密度的增量式网格聚类算法

陈宁; 周龙骧; 陈安

引用本文:	陈宁,周龙骧,陈安.基于密度的增量式网格聚类算法.软件学报,2002,13(1):1-7

【打印本页】【下载PDF全文】【查看/发表评论】【EndNote】【RefMan】【BibTex】

←前一篇|后一篇→

过刊浏览高级检索

本文已被：浏览 5538次下载 8059次	码上扫一扫！
分享到：微信更多字体:加大+\|默认\|缩小-
基于密度的增量式网格聚类算法
陈宁¹, 周龙骧¹, 陈安^2,3
1.中国科学院数学与系统科学研究院,北京,100080;2.中国科学院科技政策与管理科学研究所,北京,100080;3.中国科学院软件研究所软件工程技术研究开发中心,北京,100080

摘要:

提出基于密度的网格聚类算法GDcA,发现大规模空间数据库中任意形状的聚类.该算法首先将数据空间划分成若干体积相同的单元,然后对单元进行聚类只有密度不小于给定阈值的单元才得到扩展,从而大大降低了时间复杂性在GDcA的基础上,给出增量式聚类算法IGDcA,适用于数据的批量更新.

关键词: 聚类:网格增量算法

DOI：

分类号:

基金项目:Supported by the National Natural Science Foundation of China under Grant No.69983011(国家自然科学基金);the NationalGrand Fundamental Research 973 Program of China under Grant No. G I999035807(国家重点基础研究发展规划973资助项目)

An Incremental Grid Density-Based Clustering Algorithm

CHEN Ning,ZHOU Long-xiang,CHEN An

Abstract:

Although many clustering algorithms have been proposed so far, seldom was focused on high-dimensional and incremental databases. This paper introduces a grid density-based clustering algorithm GDCA. which discovers clusters with arbitrary shape in spatial databases. It first partitions the data space into a number of units, and then deals with units instead of points. Only those units with the density no less than a given minimum density threshold are useful in extending clusters. An incremental clustering algorithm----IGDCA is also presented, applicable in periodically incremental environment.

Key words: clustering grid incremental algorithm