Modeling Urban Land Use Changes Using Support Vector Machines
Bibliographic record
Abstract
Abstract Support Vector Machines (SVM) is a machine learning (ML) algorithm commonly applied to the classification of remotely sensing data and more recently for modeling land use changes. However, in most geospatial applications the current literature does not elaborate on specifications of the SVM method with respect to data sampling, attribute selection and optimal parameters choices. Therefore the main objective of this study is to present and investigate the SVM technique for modeling urban land use change. The SVM model building procedure is presented together with the detailed evaluation of the output results with respect to the choice of datasets, attributes and the change of SVM parameters. Geospatial datasets containing nine land use classes and spatial attributes for the Municipality of Zemun, Republic of Serbia were used for years 2001, 2003, 2007 and 2011. The Correlation‐based Feature Subset method, kappa coefficient, Area Under Receiver Operating Characteristic Curve (AUC) and kappa simulation were used to perform the model evaluation and compare the model outputs with the real land use datasets. The obtained results indicate that the SVM‐based models perform better when implementing balanced data sampling, reduced data sets to informative subsets of attributes and properly identify the optimal learning parameters.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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".