Enhanced Network Traffic Classification Using Bayesian-Optimized Logistic Regression and Random Forest Algorithm

This study highlights the urgent need for effective real-time network security solutions in the face of increasing cyber threats. It examines the performance of a logistic regression model enhanced by Bayesian optimization for detecting TOR traffic using the UNB-CIC TOR-NonTOR datasets and a Bayesia...

Full description

Saved in:
Bibliographic Details
Main Authors: Manisankar Sannigrahi, R. Thandeeswaran
Format: Article
Language:English
Published: Wiley 2025-01-01
Series:Journal of Engineering
Online Access:http://dx.doi.org/10.1155/je/5430763
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This study highlights the urgent need for effective real-time network security solutions in the face of increasing cyber threats. It examines the performance of a logistic regression model enhanced by Bayesian optimization for detecting TOR traffic using the UNB-CIC TOR-NonTOR datasets and a Bayesian-optimized random forest model for the CIC-Darknet2020 dataset. The research evaluates four key machine learning algorithms: Random forest, logistic regression, support vector machine (SVM), and K-nearest neighbors (K-NN). Bayesian optimization is employed to systematically fine-tune the model’s hyperparameters, thereby improving accuracy and efficiency by concentrating on promising areas of the hyperparameter space and avoiding unnecessary evaluations. The findings indicate that the proposed models effectively detect TOR traffic with higher accuracy and fewer false positives, essential for real-time threat mitigation. Compared to other machine learning algorithms, the proposed models demonstrate superior performance in balancing accuracy, computational efficiency, and detection speed, making them ideal for real-time network security applications. This approach’s flexibility to adapt to various network conditions and datasets ensures consistent optimal performance as traffic patterns change.
ISSN:2314-4912