.png){kind=icon}
Return
A density-based spatial clustering algorithm considering both spatial proximity and attribute similarity
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cageo.2011.12.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Geometrical properties and attributes are two important characteristics of a spatial object. In previous spatial clustering studies, these two characteristics were often neglected. This paper addresses the problem of how to accommodate geometrical properties and attributes in spatial clustering. A new density-based spatial clustering algorithm (DBSC) is developed by considering both spatial proximity and attribute similarity. Delaunay triangulation with edge length constraints is first employed for modeling the spatial proximity relationships among spatial objects. A modified density-based clustering strategy is then designed and used to identify spatial clusters. Objects in the same cluster detected by the DBSC algorithm are proximal in a spatial domain and similar in an attribute domain. In addition, the algorithm is able to detect clusters of arbitrary shapes and non-homogeneous densities in the presence of noise. The effectiveness and practicability of the DBSC algorithm are validated using both simulated and real spatial datasets. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Spatial clustering
Spatial proximity
Attribute similarity
Delaunay triangulation
Density-based clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.4
Papers:
5.0K
Citations:
1.5W
Organization
Cited Papers
ShareSave
A graph-theoretical clustering method based on two rounds of minimum spanning trees.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSaveShareSaveShareSave
View more