Bibliographic record
Abstract
Geolocation is the foundation of almost all technology that deals with spatial data, from the GPS-based navigation software in a vehicle to the built-in tracking system on a mobile device.At its core, geolocation is simply the process of determining or approximating the geographical position of an object.However, the type of geolocation we are interested in is slightly more specific; it is the process of locating a single image solely based on its internal information.Until recently, it has been extremely difficult-if not impossible-to do this reliably.These techniques are often applied by intelligence agencies, in which specialized analysts use geolocation to track down wanted individuals by investigating details in the images they appear in.Even then, it is by no means straightforward to check these images against endless amounts of map data and satellite imagery, let alone pinpoint an exact location.However, with the increasingly powerful capabilities of artificial intelligence and machine learning, we are starting to see a shift in the applications and techniques used in geolocation.In this article, we aim to determine the most effective way to teach a computer how to match images to their respective locations on a map.
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.011 | 0.053 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.011 | 0.008 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.004 | 0.005 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.010 | 0.005 |
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".