A Novel Short-term Vehicle Location Prediction using Temporal Graph Neural Networks
Bibliographic record
Abstract
Location prediction is essential for location-based applications such as route recommendation systems, resource allocation optimization in congested areas, congestion avoidance, traffic management, just to mention a few. Knowing approximate vehicle locations can enhance our ability to better manage and prepare the existing mobile edge computing resources in a Vehicular ad hoc network. In this paper, we focus on a graph neural network model to estimate vehicle locations in a timely manner. We first model the vehicle locations based on events that happen between different regions of an area and the car itself. Leveraging our event-based model, we introduce Temporal Location Prediction (TLP) to capture essential features from each node, edges, and neighboring nodes to achieve timely location prediction. Afterwards, instead of using GPS coordinates as input, we demonstrate a new data structure to feed Bidirectional LSTM (BiLSTM) and LSTM for vehicle location prediction in different time intervals. Thus, our main contribution is a network model that utilizes a Temporal Graph neural network for dynamic location prediction. We explain the advantages and disadvantages of each model and how we can improve them. Our experiments on a real dataset show that our model (TLP) outperforms LSTM and BiLSTM in short-term prediction, considering the same scenario and conditions.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".