The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Efficient regionalization techniques for socio‐economic geographical units using minimum spanning trees
Open accessAbstract
Abstract 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. Keywords: RegionalizationConstrained clusteringGraph partitioningOptimizationZone designCensus data analysis Acknowledgements Renato Assunção's research is partially supported by CNPq (grant 305567/2004‐7). Marcos Neves' research has been supported by EMBRAPA. Gilberto Camara's work is partially funded by CNPq (grants PQ‐300557/19996‐5 and 550250/2005‐0) and FAPESP (grant 04/11012‐0). Corina Freitas' research has been partially supported by CNPq (grant 305546/2003‐1).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Data Structures and Algorithms
(2003) · Series on software engineering and knowledge engineering · doi:10.1142/9789812791245 · Cited by 2,117
Data Structures and Algorithms
Wirth, N. (1984) · Scientific American · doi:10.1038/scientificamerican0984-60 · Cited by 1,418
Multilevel Algorithms for Multi-Constraint Graph Partitioning
Karypis, G., & Kumar, V. (1998) · doi:10.5555/509058.509086 · Cited by 342
Algorithms for Reengineering 1991 Census Geography
Openshaw, S., & Rao, L. (1995) · Environment and Planning A: Economy and Space · doi:10.1068/a270425 · Cited by 303
Geographical Information and Planning
(1999) · Advances in spatial science · doi:10.1007/978-3-662-03954-0 · Cited by 138
Graphs, Networks and Algorithms
Jungnickel, D. (1999) · Algorithms and computation in mathematics · doi:10.1007/978-3-662-03822-2 · Cited by 136
Optimizing census geography: the separation of collection and output geographies
MARTIN, D. J. (1998) · International Journal of Geographical Information Systems · doi:10.1080/136588198241590 · Cited by 101
Designing your own geographies
Alvanides, S., Openshaw, S., & Rees, P. (2002) · Northumbria Research Link (Northumbria University) · doi:10.25405/ncl.34200735 · Cited by 15
Cited by
Gao, S., Janowicz, K., & Couclelis, H. (2017) · Transactions in GIS · doi:10.1111/tgis.12289 · Cited by 468
Communities and Emerging Semantics in Semantic Link Network: Discovery and Learning
Zhuge, H. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.141 · Cited by 259
Tilmon, S., Nyenhuis, S., Solomonides, A., Barbarioli, B., Bhargava, A., Birz, S., Bouzein, K., Cardenas, C., Carlson, B., Cohen, E., et al. (2023) · Journal of Clinical and Translational Science · doi:10.1017/cts.2023.670 · Cited by 10
Metadata
- Authors
- AssunÇão, R. M., Neves, M. C., Câmara, G., & Da Costa Freitas, C.
- Venue
- International Journal of Geographical Information Science
- Publisher
- Informa UK Limited
- Published
- 2006-08
- Volume
- 20
- Issue
- 7
- Pages
- 797-811
- ISSN
- 0269-3798 (ISSN-L)
- 1365-8816
- 1362-3087
- OpenAlex
- W2136347018
- Cited by
- 436
- References
- 8
- FWCI
- 13.54
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient regionalization techniques for socio‐economic geographical units using minimum spanning trees. https://app.cochat.ai/papers/10.1080/13658810600665111
- The paper
- AssunÇão, R. M., Neves, M. C., Câmara, G., & Da Costa Freitas, C. (2006). Efficient regionalization techniques for socio‐economic geographical units using minimum spanning trees. International Journal of Geographical Information Science. https://doi.org/10.1080/13658810600665111
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.