Elevation-Aware Map Matching Model Leveraging Transfer Learning in Sparse Data Conditions
Bibliographic record
Abstract
Map matching is a pivotal component of intelligent urban transportation, offering foundational data for technologies such as path planning, traffic analysis, and trajectory analysis. Diverging from conventional rule-based and topological map matching algorithms, we approach the map matching task from a data-driven perspective, presenting an Elevation-Aware Map Matching Model under conditions of sparse data. This paper initiates from the vehicular standpoint, constructing an Elevation-Aware Unit utilizing imagery and sensor data to acquire elevation information for diverse urban roads. Subsequently, this unit is integrated into the map matching model, enhancing the model’s resilience to noise. Concurrently, employing a Fine-tuning transfer learning approach, we formulate a cross-domain map matching model to maximize the reduction of model development costs. The model undergoes testing on real-world datasets, employing four metrics for evaluation. The results indicate the superiority of this map matching model over existing counterparts, particularly in intricate urban road scenarios where the model exhibits outstanding performance. Additionally, we validate the effectiveness of the Elevation-Aware Unit, underscoring the significance of height information for map matching models.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 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.003 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".