Name
Abstract | ||
|---|---|---|
The traditional point-based clustering algorithms when applied to geospatial polygons may produce clusters that are spatially disjoint due to their inability to consider various types of spatial relationships between polygons. In this paper, we propose to represent geospatial polygons as sets of spatial and non-spatial attributes. By representing a polygon as a set of spatial and non-spatial attributes we are able to take into account all the properties of a polygon (such as structural, topological and directional) that were ignored while using point-based representation of polygons, and that aid in the formation of high quality clusters. Based on this framework we propose a dissimilarity function that can be plugged into common state-of-the-art spatial clustering algorithms. The result is clusters of polygons that are more compact in terms of cluster validity and spatial contiguity. We show the effectiveness and robustness of our approach by applying our dissimilarity function on the traditional k-means clustering algorithm and testing it on a watershed dataset. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1653771.1653825 | GIS |
Keywords | Field | DocType |
point-based representation,dissimilarity function,cluster validity,traditional point-based clustering algorithm,spatial contiguity,spatial relationship,common state-of-the-art spatial,geospatial polygon,non-spatial attribute,traditional k-means,k means clustering,clustering,spatial relationships,polygons | Data mining,Fuzzy clustering,Computer science,Artificial intelligence,Cluster analysis,Spatial database,Single-linkage clustering,Geospatial analysis,k-medians clustering,Polygon,Correlation clustering,Pattern recognition,Machine learning | Conference |
Citations | PageRank | References |
13 | 0.71 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deepti Joshi | 1 | 62 | 5.55 |
| A Samal | 2 | 1033 | 213.54 |
| Leen-kiat Soh | 3 | 592 | 81.43 |