Efficient regionalization techniques for socio‐economic geographical units using minimum spanning trees 论文

2006International Journal of Geographical Information Systems引用 413
Data Management and AlgorithmsSmart Parking Systems ResearchData Mining Algorithms and Applications

详细信息

发表期刊/会议
International Journal of Geographical Information Systems
发表日期
2006-06-23
发表年份
2006

关键词

Data Management and AlgorithmsSmart Parking Systems ResearchData Mining Algorithms and Applications

摘要

Regionalization is a classification procedure applied to spatial objects with an areal representation, which groups them into homogeneous contiguous regions. This paper presents an efficient method for regionalization. The first step creates a connectivity graph that captures the neighbourhood relationship between the spatial objects. The cost of each edge in the graph is inversely proportional to the similarity between the regions it joins. We summarize the neighbourhood structure by a minimum spanning tree (MST), which is a connected tree with no circuits. We partition the MST by successive removal of edges that link dissimilar regions. The result is the division of the spatial objects into connected regions that have maximum internal homogeneity. Since the MST partitioning problem is NP‐hard, we propose a heuristic to speed up the tree partitioning significantly. Our results show that our proposed method combines performance and quality, and it is a good alternative to other regionalization methods found in the literature.