摘要
聚类方法是空间数据挖掘的主要方法之一。针对聚类时障碍的约束,文章在用多边形有效地模拟约束条件和对多边形模型约简的基础上,提出了基于障碍约束的DBCluOC算法,并对算法进行了简要的分析。
Clustering spatial data is a well-know problem that has been extensively studied.When facing Obstacles constraints,this paper introduces a new approach to model these obstacles using polygons and devises a density-based clustering algorithm,DBCluOC,which can detect clusters of arbitrary and achieve effective clusters.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第31期186-187,204,共3页
Computer Engineering and Applications
关键词
空间数据
障碍
聚类
可见
Spatial data,Obstacles,Clustering,Visibility
