Clustering with obstacles for Geographical Data Mining
MetadataShow full item record
Clustering algorithms typically use the Euclidean distance. However, spatial proximity is dependent on obstacles, caused by related information in other layers of the spatial database. We present a clustering algorithm suitable for large spatial databases with obstacles. The algorithm is free of user-supplied arguments and incorporates global and local variations. The algorithm detects clusters in complex scenarios and successfully supports association analysis between layers. All this occurs within O(n log n+[s+t] log n) expected time, where n is the number of points, s is the number of line segments that determine the obstacles and t is the number of Delaunay edges intersecting the obstacles.
ISPRS Journal of Photogrammetry and Remote Sensing
© 2004 Elsevier. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.