An optimized hybrid methodology for short‐term traffic forecasting in telecommunication networks
Bibliographic record
Abstract
Abstract With the rapid development of telecommunication networks, the predictability of network traffic is of significant interest in network analysis and optimization, bandwidth allocation, and load balancing adjustment. Consequently, in recent years, significant research attention has been paid to forecasting telecommunication network traffic. Telecommunication traffic forecasting problems can be considered a time‐series problem, wherein periodic historical data is fed as the input to a model. Time‐series forecasting approaches are broadly categorized as statistical machine learning (ML) methods and their combinations. Statistical approaches forecast linear characteristics of time‐series data, unable to capture nonlinear and complex patterns. ML‐based approaches can model nonlinear characteristics of data. In recent years, hybrid approaches combining statistical and ML‐based approaches have been widely used to model linear and nonlinear data characteristics. However, the performance of these approaches highly depends on feature selection techniques and hyper‐parameter tuning of ML methods. A novel hybrid method is proposed for short‐term traffic forecasting based on feature selection and hyperparameter optimization to address this problem. It combines statistical and ML methods to model linear and nonlinear components of data. First, a novel feature selection technique, modified mutual information based on a linear combination of targets, is proposed to find the candidate input variables. Next, a combination of vector auto regressive moving average (VARMA), long short‐term memory (LSTM), and multilayer perceptron (MLP), called VARMA‐LSTM‐MLP forecaster, is suggested to forecast short‐term traffic. A hybrid metaheuristic algorithm, composed of firefly and BAT, is employed to find the optimal set of hyper‐parameter values. The proposed method is assessed by a real‐world dataset containing Tehran city's daily telecommunication data in IRAN. The evaluation results demonstrate that the proposed method outperforms the existing methods in terms of mean squared error and mean absolute error.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".