%0 Journal Article
%T An Incremental Grid Density-Based Clustering Algorithm<br>基于密度的增量式网格聚类算法
%A CHEN Ning
%A ZHOU Long-xiang
%A CHEN An
%A <br>陈宁
%A 陈安
%A 周龙骧
%J 软件学报
%D 2002
%I 
%X 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.
%K clustering
%K grid
%K incremental algorithm<br>聚类:网格
%K 增量算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=2367B239FFAC7D2E&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=CA4FD0336C81A37A&sid=CA4FD0336C81A37A&eid=DF92D298D3FF1E6E&journal_id=1000-9825&journal_name=软件学报&referenced_num=25&reference_num=5