Redistricting using constrained polygonal clustering

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Redistricting is the process of dividing a geographic area consisting of spatial units-often represented as spatial polygons-into smaller districts that satisfy some properties. It can therefore be formulated as a set partitioning problem where the objective is to cluster the set of spatial polygons into groups such that a value function is maximized [1]. Widely used algorithms developed for point-based data sets are not readily applicable because polygons introduce the concepts of spatial contiguity and other topological properties that cannot be captured by representing polygons as points. Furthermore, when clustering polygons, constraints such as spatial contiguity and unit distributedness should be strategically addressed. Toward this, we have developed the Constrained Polygonal Spatial Clustering (CPSC) algorithm based on the A* search algorithm that integrates cluster-level and instance-level constraints as heuristic functions. Using these heuristics, CPSC identifies the initial seeds, determines the best cluster to grow, and selects the best polygon to be added to the best cluster. We have devised two extensions of CPSC-CPSC* and CPSC*-PS-for problems where constraints can be soft or relaxed. Finally, we compare our algorithm with graph partitioning, simulated annealing, and genetic algorithm-based approaches in two applications- congressional redistricting and school districting.

Original languageEnglish (US)
Article number5936062
Pages (from-to)2065-2079
Number of pages15
JournalIEEE Transactions on Knowledge and Data Engineering
Volume24
Issue number11
DOIs
StatePublished - Oct 5 2012

Fingerprint

Simulated annealing
Clustering algorithms
Genetic algorithms

Keywords

  • Spatial clustering
  • constraint-based processing
  • data mining
  • polygonal clustering
  • spatial databases and GIS

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Redistricting using constrained polygonal clustering. / Joshi, Deepti; Soh, Leen-Kiat; Samal, Ashok K.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 24, No. 11, 5936062, 05.10.2012, p. 2065-2079.

Research output: Contribution to journalArticle

@article{9563c10acc0b4ca799044da7a8d76947,
title = "Redistricting using constrained polygonal clustering",
abstract = "Redistricting is the process of dividing a geographic area consisting of spatial units-often represented as spatial polygons-into smaller districts that satisfy some properties. It can therefore be formulated as a set partitioning problem where the objective is to cluster the set of spatial polygons into groups such that a value function is maximized [1]. Widely used algorithms developed for point-based data sets are not readily applicable because polygons introduce the concepts of spatial contiguity and other topological properties that cannot be captured by representing polygons as points. Furthermore, when clustering polygons, constraints such as spatial contiguity and unit distributedness should be strategically addressed. Toward this, we have developed the Constrained Polygonal Spatial Clustering (CPSC) algorithm based on the A* search algorithm that integrates cluster-level and instance-level constraints as heuristic functions. Using these heuristics, CPSC identifies the initial seeds, determines the best cluster to grow, and selects the best polygon to be added to the best cluster. We have devised two extensions of CPSC-CPSC* and CPSC*-PS-for problems where constraints can be soft or relaxed. Finally, we compare our algorithm with graph partitioning, simulated annealing, and genetic algorithm-based approaches in two applications- congressional redistricting and school districting.",
keywords = "Spatial clustering, constraint-based processing, data mining, polygonal clustering, spatial databases and GIS",
author = "Deepti Joshi and Leen-Kiat Soh and Samal, {Ashok K}",
year = "2012",
month = "10",
day = "5",
doi = "10.1109/TKDE.2011.140",
language = "English (US)",
volume = "24",
pages = "2065--2079",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "11",

}

TY - JOUR

T1 - Redistricting using constrained polygonal clustering

AU - Joshi, Deepti

AU - Soh, Leen-Kiat

AU - Samal, Ashok K

PY - 2012/10/5

Y1 - 2012/10/5

N2 - Redistricting is the process of dividing a geographic area consisting of spatial units-often represented as spatial polygons-into smaller districts that satisfy some properties. It can therefore be formulated as a set partitioning problem where the objective is to cluster the set of spatial polygons into groups such that a value function is maximized [1]. Widely used algorithms developed for point-based data sets are not readily applicable because polygons introduce the concepts of spatial contiguity and other topological properties that cannot be captured by representing polygons as points. Furthermore, when clustering polygons, constraints such as spatial contiguity and unit distributedness should be strategically addressed. Toward this, we have developed the Constrained Polygonal Spatial Clustering (CPSC) algorithm based on the A* search algorithm that integrates cluster-level and instance-level constraints as heuristic functions. Using these heuristics, CPSC identifies the initial seeds, determines the best cluster to grow, and selects the best polygon to be added to the best cluster. We have devised two extensions of CPSC-CPSC* and CPSC*-PS-for problems where constraints can be soft or relaxed. Finally, we compare our algorithm with graph partitioning, simulated annealing, and genetic algorithm-based approaches in two applications- congressional redistricting and school districting.

AB - Redistricting is the process of dividing a geographic area consisting of spatial units-often represented as spatial polygons-into smaller districts that satisfy some properties. It can therefore be formulated as a set partitioning problem where the objective is to cluster the set of spatial polygons into groups such that a value function is maximized [1]. Widely used algorithms developed for point-based data sets are not readily applicable because polygons introduce the concepts of spatial contiguity and other topological properties that cannot be captured by representing polygons as points. Furthermore, when clustering polygons, constraints such as spatial contiguity and unit distributedness should be strategically addressed. Toward this, we have developed the Constrained Polygonal Spatial Clustering (CPSC) algorithm based on the A* search algorithm that integrates cluster-level and instance-level constraints as heuristic functions. Using these heuristics, CPSC identifies the initial seeds, determines the best cluster to grow, and selects the best polygon to be added to the best cluster. We have devised two extensions of CPSC-CPSC* and CPSC*-PS-for problems where constraints can be soft or relaxed. Finally, we compare our algorithm with graph partitioning, simulated annealing, and genetic algorithm-based approaches in two applications- congressional redistricting and school districting.

KW - Spatial clustering

KW - constraint-based processing

KW - data mining

KW - polygonal clustering

KW - spatial databases and GIS

UR - http://www.scopus.com/inward/record.url?scp=84866922877&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866922877&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2011.140

DO - 10.1109/TKDE.2011.140

M3 - Article

VL - 24

SP - 2065

EP - 2079

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 11

M1 - 5936062

ER -