Regionalization of Youth and Adolescent Weight Metrics for the Continental United States Using Contiguity-Constrained Clustering and Partitioning
Bibliographic record
Abstract
Contemporary spatial data collection techniques, analyses, and presentations have created new opportunities for public health analyses that sometimes render existing administrative and statistical boundaries unsuitable. This article presents an applied algorithm, regionalization with dynamically constrained agglomerative clustering and partitioning (REDCAP), to create regions other than pre-defined regions. The regions created in the study were based on the weight of youth in the continental United States. The REDCAP algorithm incorporates a spatial contiguity restriction to create regions with the same characteristics and value. The regions created overcome the existing challenge in cartography in which administrative and statistical regions are often used in presenting results. The study generated 10- and 25-class regions that reflected high and low obesity prevalence among US youth without using existing county and state boundaries. The results revealed new insights about regions comprising counties identified as having high obesity prevalence. Some of the counties identified in the established regions interestingly have not been recorded as at risk for high obesity prevalence in previous studies. A crucial advantage of the approach is that it minimizes the bias contained in existing administrative and statistical regions, a challenge in cartography. Furthermore, the approach effectively creates regions based on a specific theme and objective function.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.006 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.005 | 0.004 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".