%0 Journal Article
%T Dynamic grids clustering algorithm based on overlapping partition<br>基于相交划分的动态网格聚类算法
%A QIU Bao-zhi
%A SONG Xiao-jun
%A <br>邱保志
%A 宋晓军
%J 计算机应用研究
%D 2009
%I 
%X In order to solve the problems that data input reliance and the clustering result was not efficient in overlapping grids partition technique, this paper proposed a dynamic grids clustering algorithm based on overlapping partition (DGBO). In DGBO, used overlapping grids partition technique and shifting grids technique for solving above problems. With the help of a density threshold, merge overlapping dense grids to form clusters. As the experimental results show that DGBO algorithm can discover clusters in noisy datasets containing clusters of arbitrary shapes and sizes effectively and efficiently.
%K clusters
%K algorithm
%K overlapping partition
%K shifting grids
%K dynamic grids<br>聚类
%K 算法
%K 相交划分
%K 移动网格
%K 动态网格
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=41342E5AE86850347A711167D77E012D&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=59906B3B2830C2C5&sid=DBB79E58457C559E&eid=010DAB2932C456FD&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=8