A Bidirectional Trajectory Prediction Model for Users in Mobile Networks
Bibliographic record
Abstract
Future mobile networks are envisioned to have critical limitations in terms of latency, energy usage, capacity and network resources since these networks are expected to become extremely dense and complex. The rapid enormous advances in recent technologies such as Internet of Things (IoT) highlights the urgent need for network performance enhancement as well. To this end, self-organizing networks are a promising solution to push the network performance to the next level. These scalable networks can dynamically adapt to possible changes in the network. Smart mobility management, in particular mobility prediction, is a subsection of self-organizing functions which are mainly based on the machine learning techniques. In this paper, we propose to estimate user’s future trajectory using machine learning approaches for a better network management. We propose a novel bidirectional trajectory prediction model called BTPM to model the user mobility behavior. The proposed method exploits the potential benefits of bidirectional gated recurrent unit (GRU) for having an accurate prediction. Moreover, we introduce a data preprocessing phase to obtain better results with significantly lower execution time. The proposed approach takes full advantage of data analysis in both directions (backward and forward) in order to provide a long-term prediction and model user’s mobility even with complex patterns. Experimental results show that the proposed bidirectional approach significantly improves the performance of the mobility predictor in terms of model accuracy, robustness and execution time. It achieves a model error of 0.014 and decreases the execution time up to 97%.
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.001 | 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".