A Patch‐based Cellular Automaton for Simulating Land‐use Changes at Fine Spatial Resolution
Bibliographic record
Abstract
Abstract While cellular automata have become popular tools for modeling land‐use changes, there is a lack of studies reporting their application at very fine spatial resolutions (e.g. 5 m resolution). Traditional cell‐based CA do not generate reliable results at such resolutions because single cells might only represent components of land‐use entities (i.e. houses or parks in urban residential areas), while recently proposed entity‐based CA models usually ignore the internal heterogeneity of the entities. This article describes a patch‐based CA model designed to deal with this problem by integrating cell and object concepts. A patch is defined as a collection of adjacent cells that might have different attributes, but that represent a single land‐use entity. In this model, a transition probability map was calculated at each cell location for each land‐use transition using a weight of evidence method; then, land‐use changes were simulated by employing a patch‐based procedure based on the probability maps. This CA model, along with a traditional cell‐based model were tested in the eastern part of the Elbow River watershed in southern Alberta, Canada, an area that is under considerable pressure for land development due to its proximity to the fast growing city of Calgary. The simulation results for the two models were compared to historical data using visual comparison, Ksimulation indices, and landscape metrics. The results reveal that the patch‐based CA model generates more compact and realistic land‐use patterns than the traditional cell‐based CA. The Ksimulation values indicate that the land‐use maps obtained with the patch‐based CA are in higher agreement with the historical data than those created by the cell‐based model, particularly regarding the location of change. The landscape metrics reveal that the patch‐based model is able to adequately capture the land‐use dynamics as observed in the historical data, while the cell‐based CA is not able to provide a similar interpretation. The patch‐based approach proposed in this study appears to be a simple and valuable solution to take into account the internal heterogeneity of land‐use classes at fine spatial resolutions and simulate their transitions over time.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".