MétaCan
Menu
Back to cohort

Graph Neural Network-Based Internet Traffic Prediction in 6G Networks with Genetic Algorithm Hyperparameter Optimization

2025· article· en· W4413679804 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldSocial Sciences
TopicAdvanced Computing and Algorithms
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsHyperparameterComputer scienceArtificial neural networkArtificial intelligenceGenetic algorithmThe InternetMachine learningAlgorithm

Abstract

fetched live from OpenAlex

Accurate internet traffic prediction is a key challenge in managing next-generation networks such as 6G. This paper presents a novel approach based on Graph Neural Networks (GNNs) for predicting internet traffic in 6G networks. The proposed model integrates Graph Attention Networks (GAT) and Transformer architectures to learn spatial and temporal dependencies in traffic data. A K-Nearest Neighbors (KNN)-based graph construction method is utilized to represent spatial relationships between network cells. The model’s performance is enhanced by leveraging a Genetic Algorithm (GA) for hyperparameter optimization. Experimental results demonstrate the effectiveness of the proposed model in achieving superior prediction accuracy, as evidenced by improvements in RMSE, and MAE compared to baseline models. This work offers a scalable solution for traffic prediction in 6G networks.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.698
Threshold uncertainty score0.488

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.008
GPT teacher head0.246
Teacher spread0.239 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Computing and AlgorithmsFrench-language works237,207