Redistricting using heuristic-based polygonal clustering

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too complex for an automated system to be developed that can produce unbiased plans. In this paper we present a novel method for redistricting a geographic area using a heuristic-based approach for polygonal spatial clustering. While clustering geospatial polygons several complex issues need to be addressed - such as: removing order dependency, clustering all polygons assuming no outliers, and strategically utilizing domain knowledge to guide the clustering process. In order to address these special needs, we have developed the Constrained Polygonal Spatial Clustering (CPSC) algorithm that holistically integrates domain knowledge in the form of cluster-level and instance-level constraints and uses heuristic functions to grow clusters. In order to illustrate the usefulness of our algorithm we have applied it to the problem of formation of unbiased congressional districts. Furthermore, we compare and contrast our algorithm with two other approaches proposed in the literature for redistricting, namely - graph partitioning and simulated annealing.

Original languageEnglish (US)
Title of host publicationICDM 2009 - The 9th IEEE International Conference on Data Mining
Pages830-835
Number of pages6
DOIs
StatePublished - Dec 1 2009
Event9th IEEE International Conference on Data Mining, ICDM 2009 - Miami, FL, United States
Duration: Dec 6 2009Dec 9 2009

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
ISSN (Print)1550-4786

Conference

Conference9th IEEE International Conference on Data Mining, ICDM 2009
CountryUnited States
CityMiami, FL
Period12/6/0912/9/09

Fingerprint

Simulated annealing
Clustering algorithms

Keywords

  • District formation
  • Polygon
  • Polygonal clustering
  • Redistricitng
  • Spatial data mining

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Joshi, D., Soh, L-K., & Samal, A. K. (2009). Redistricting using heuristic-based polygonal clustering. In ICDM 2009 - The 9th IEEE International Conference on Data Mining (pp. 830-835). [5360319] (Proceedings - IEEE International Conference on Data Mining, ICDM). https://doi.org/10.1109/ICDM.2009.126

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

ICDM 2009 - The 9th IEEE International Conference on Data Mining. 2009. p. 830-835 5360319 (Proceedings - IEEE International Conference on Data Mining, ICDM).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Joshi, D, Soh, L-K & Samal, AK 2009, Redistricting using heuristic-based polygonal clustering. in ICDM 2009 - The 9th IEEE International Conference on Data Mining., 5360319, Proceedings - IEEE International Conference on Data Mining, ICDM, pp. 830-835, 9th IEEE International Conference on Data Mining, ICDM 2009, Miami, FL, United States, 12/6/09. https://doi.org/10.1109/ICDM.2009.126
Joshi D, Soh L-K, Samal AK. Redistricting using heuristic-based polygonal clustering. In ICDM 2009 - The 9th IEEE International Conference on Data Mining. 2009. p. 830-835. 5360319. (Proceedings - IEEE International Conference on Data Mining, ICDM). https://doi.org/10.1109/ICDM.2009.126
Joshi, Deepti ; Soh, Leen-Kiat ; Samal, Ashok K. / Redistricting using heuristic-based polygonal clustering. ICDM 2009 - The 9th IEEE International Conference on Data Mining. 2009. pp. 830-835 (Proceedings - IEEE International Conference on Data Mining, ICDM).
@inproceedings{e6bdfc00dc9f469d91493de70646a5b8,
title = "Redistricting using heuristic-based polygonal clustering",
abstract = "Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too complex for an automated system to be developed that can produce unbiased plans. In this paper we present a novel method for redistricting a geographic area using a heuristic-based approach for polygonal spatial clustering. While clustering geospatial polygons several complex issues need to be addressed - such as: removing order dependency, clustering all polygons assuming no outliers, and strategically utilizing domain knowledge to guide the clustering process. In order to address these special needs, we have developed the Constrained Polygonal Spatial Clustering (CPSC) algorithm that holistically integrates domain knowledge in the form of cluster-level and instance-level constraints and uses heuristic functions to grow clusters. In order to illustrate the usefulness of our algorithm we have applied it to the problem of formation of unbiased congressional districts. Furthermore, we compare and contrast our algorithm with two other approaches proposed in the literature for redistricting, namely - graph partitioning and simulated annealing.",
keywords = "District formation, Polygon, Polygonal clustering, Redistricitng, Spatial data mining",
author = "Deepti Joshi and Leen-Kiat Soh and Samal, {Ashok K}",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/ICDM.2009.126",
language = "English (US)",
isbn = "9780769538952",
series = "Proceedings - IEEE International Conference on Data Mining, ICDM",
pages = "830--835",
booktitle = "ICDM 2009 - The 9th IEEE International Conference on Data Mining",

}

TY - GEN

T1 - Redistricting using heuristic-based polygonal clustering

AU - Joshi, Deepti

AU - Soh, Leen-Kiat

AU - Samal, Ashok K

PY - 2009/12/1

Y1 - 2009/12/1

N2 - Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too complex for an automated system to be developed that can produce unbiased plans. In this paper we present a novel method for redistricting a geographic area using a heuristic-based approach for polygonal spatial clustering. While clustering geospatial polygons several complex issues need to be addressed - such as: removing order dependency, clustering all polygons assuming no outliers, and strategically utilizing domain knowledge to guide the clustering process. In order to address these special needs, we have developed the Constrained Polygonal Spatial Clustering (CPSC) algorithm that holistically integrates domain knowledge in the form of cluster-level and instance-level constraints and uses heuristic functions to grow clusters. In order to illustrate the usefulness of our algorithm we have applied it to the problem of formation of unbiased congressional districts. Furthermore, we compare and contrast our algorithm with two other approaches proposed in the literature for redistricting, namely - graph partitioning and simulated annealing.

AB - Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too complex for an automated system to be developed that can produce unbiased plans. In this paper we present a novel method for redistricting a geographic area using a heuristic-based approach for polygonal spatial clustering. While clustering geospatial polygons several complex issues need to be addressed - such as: removing order dependency, clustering all polygons assuming no outliers, and strategically utilizing domain knowledge to guide the clustering process. In order to address these special needs, we have developed the Constrained Polygonal Spatial Clustering (CPSC) algorithm that holistically integrates domain knowledge in the form of cluster-level and instance-level constraints and uses heuristic functions to grow clusters. In order to illustrate the usefulness of our algorithm we have applied it to the problem of formation of unbiased congressional districts. Furthermore, we compare and contrast our algorithm with two other approaches proposed in the literature for redistricting, namely - graph partitioning and simulated annealing.

KW - District formation

KW - Polygon

KW - Polygonal clustering

KW - Redistricitng

KW - Spatial data mining

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

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

U2 - 10.1109/ICDM.2009.126

DO - 10.1109/ICDM.2009.126

M3 - Conference contribution

AN - SCOPUS:77951195718

SN - 9780769538952

T3 - Proceedings - IEEE International Conference on Data Mining, ICDM

SP - 830

EP - 835

BT - ICDM 2009 - The 9th IEEE International Conference on Data Mining

ER -