.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Spatial clustering
Spatial proximity
Attribute similarity
Delaunay triangulation
Density-based clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.4
论文数:
5.0K
被引数:
1.5W
机构
引用论文
A graph-theoretical clustering method based on two rounds of minimum spanning trees.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏
查看更多内容