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

  title={Efficient regionalization techniques for socio‐economic geographical units using minimum spanning trees},
  author={Renato Martins Assunç{\~a}o and Marcos Corr{\^e}a Neves and Gilberto C{\^a}mara and Corina da Costa Freitas},
  journal={International Journal of Geographical Information Science},
  pages={797 - 811}
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… 

A framework for spatial regionalization composed of novel clustering‐based algorithms under spatial contiguity constraints

The results showed that the framework presented leads to a faster way of executing regionalization tasks in the experimental analysis, allowing us to observe a significant gain of AHR and RegK‐Means over AZP in execution time, while showing better or similar results in other metrics, such as figure of merit.

Graph Regionalization with Clustering and Partitioning: An Application for Daily Commuting Flows in Albania

The paper presents an original application of the recently proposed spatial data mining method named GraphRECAP on daily commuting flows using 2011 Albanian census data. Its aim is to identify

Regionalization with dynamically constrained agglomerative clustering and partitioning (REDCAP)

This research proposes and evaluates a family of six hierarchical regionalization methods based on three agglomerative clustering approaches, including the single linkage, average linkage (ALK), and the complete linkage (CLK), each of which is constrained with spatial contiguity in two different ways.

Graph Partitioning-Based Clustering for the Planning of Distribution Network Topology using Spatial- Temporal Load Forecasting

Planning the expansion and the new topology of distribution networks requires knowing the location and characterization of the load as well as its future growth. Spatial load forecasting is a key

An Extended Minimum Spanning Tree method for characterizing local urban patterns

This study presents a simple and novel graph-theoretic approach, Extended Minimum Spanning Tree (EMST), to describe and characterize local building patterns at building-unit level for large urban areas and demonstrates that the EMST is an effective data structure for understanding localBuilding patterns from both geographic and perceptual perspectives.

Efficient Algorithms for Regionalization : an Approach Based on Graph Partition

This paper proposes new approaches based on the GRASP and Evolutionary algorithms for the resolution of a specific regionalization problem. This problem can be mapped on a capacity and connectivity

Supervised Spatial Regionalization using the Karhunen-Loève Expansion and Minimum Spanning Trees

The article presents a methodology for supervised regionalization of data on a spatial domain. Defining a spatial process at multiple scales leads to the famous ecological fallacy problem. Here, we

A Generative Spatial Clustering Model for Random Data through Spanning Trees

This work presents a new probabilistic regionalization algorithm that allows spatially varying random variables as features and is able to better accommodate the natural variation of the data and to diminish the effect of outliers, producing better results than state-of-art approaches.

Zone design of specific sizes using adaptive additively weighted Voronoi diagrams

A new method based on a discrete version of the adaptive additively weighted Voronoi diagram that makes it possible to partition a two-dimensional space into zones of specific sizes, taking both the position and the weight of each seed into account.



A geographical solution to scale and aggregation problems in region-building, partitioning and spatial modelling

A geographical solution to the scale and aggregation problems frequently encountered in studies of spatially aggregated data is described and a heuristic procedure is described which may solve this problem and it is demonstrated by reference to an empirical study.

Zone design for planning and policy analysis

The geographical information systems (GIS) revolution, the widespread availability of digital map data and the ability to attach accurate locational references to address databases via Address Point

Fast approximate graph partitioning algorithms

This work presents a new and simple O(log n)-approximation algorithm for minimum capacity $\rho$-separators which is based on spreading metrics yielding an O( logs n) approximation factor both for b-balanced cuts and k-balanced partitions.

Multilevel Algorithms for Multi-Constraint Graph Partitioning

This work focuses on developing new types of heuristics for coarsening, initial partitioning, and refinement that are capable of successfully handling multiple constraints that underlay many existing and emerging large-scale scientific simulations.

Optimizing Census Geography: The Separation of Collection and Output Geographies

A four-stage model of modern census geography development is presented, culminating in a current prototype for the separation of purpose-designed data collection and output geographies.

Designing and implementing software for spatial statistical analysis in a GIS environment

The paper describes the statistical analyses which SAGE can perform and details on how it performs them together with some illustrative examples and identifies the needs of software packages if they are to enable users to implement effective spatial statistical analysis.

Extending the automated zoning procedure to reconcile incompatible zoning systems

The automated zoning procedure (AZP) proposed by Openshaw (1977) is reviewed and extended to permit its application to the intersection of two zonal systems, and a population stress statistic is proposed which may be used in the extended AZP algorithm in order to maximise the match between twoZonal geographies.

Algorithms for Reengineering 1991 Census Geography

Three algorithms are described that can be used for designing zoning systems for use with 1991 Census data and an Arc/Info implementation is briefly outlined and case studies presented.

Graphs, Networks, and Algorithms

This book presents a meta-analsis of the network simplex algorithm and a section on the five color theorem, which states that the color theorem can be rewritten as a graph representation of a network.