Automated Hyperparameter Tuning and Ensemble Machine Learning Approach for Network Traffic Classification
Bibliographic record
Abstract
Network traffic analysis and forecasting have become indispensable to dynamically allocate bandwidth, congestion control, security, and planning in today’s complex, heterogeneous, and traffic-intensive networks. This study focuses on leveraging and optimizing machine learning techniques to perform network traffic analysis and classification for decision-making. The study initiated with a thorough exploration of machine learning algorithms. Various algorithms, including Logistic Regression, SVM, KNN, Decision Trees, Random Forests, Extra Trees, Bagging, and AdaBoost, are applied for multi-class classification in network traffic analysis. To improve accuracy, we first employed automated hyperparameter tuning for each of the algorithms. After that we implemented the ensemble method with unanimous voting. In terms of unanimous voting, increasing the number of algorithms with certain criteria correlates with a decrease in false positives and false negatives. The results of our approach clearly improve the accuracy of the network traffic classification over fundamental machine learning models for better management of complex heterogeneous 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.
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.001 | 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".