Spatial Hierarchical Clustering in the Presence of Obstacle
带障碍的空间分级聚类算法

The problem of spatial clustering in the presence of obstacles has many practical applications. Many traditional clustering algorithms are performed without the presence of obstacles that exist in the real world, such as rivers, lakes and hills, but their presence may affect the result of clustering substantially. In this paper, a hierarchical clustering algorithm, called OBHIEC, is proposed, which can reduce the calculation of obstructed distance and is suitable for data set with varied distributing density. The experiment results show that OBHIEC is both effective and efficient.