摘要
为了降低计算代价,在CLIQUE算法的基础上引入了便利网格和障碍网格等概念,提出了便利体和障碍物下基于网格的聚类算法(GBSCFO)。GBSCFO首先利用CLIQUE算法生成微簇,然后在微簇的粒度上计算障碍距离。通过理论分析和实验验证,GBSCFO具有较好的时间复杂度和聚类效果。
In order to reduce the cost, the paper gave the concepts of definitions such as obstacle grid and facilitate grid, and proposed grid-based spatial clustering in the presence of facilitators and obstacles（GBSCFO） based on CLIQUE algorithm. The algorithm first generated the micro-clusters based on CLIQUE and computed the obstructed distance between the micro-clusters. Compared with the existing similar algorithms on the aspects of theory analysis and experiment, this algorithm has preferable time complexity and clustering results on the same data objects.
出处
《计算机应用研究》
CSCD
北大核心
2010年第1期117-119,共3页
Application Research of Computers
关键词
空间
聚类
网格
障碍物
便利体
微簇
spatial
clustering
grid
obstacles
facilitators
micro-cluster
