<![CDATA[The rapid escalation of Distributed Denial of Service (DDoS) attacks has posed significant threats to global cybersecurity. This research presents a comparative analysis of three supervised machine learning algorithms—K-Nearest Neighbor (KNN), Decision Tree (DT), and Random Forest (RF)—in detecting DDoS attacks using the CICIDS2017 dataset. While many studies focus on broader intrusion detection, this study concentrates specifically on binary classification between benign and DDoS traffic. The CICIDS2017 dataset was chosen for its comprehensive and realistic representation of modern network traffic. The methodology involved preprocessing, training, and evaluating the models in Orange Data Mining using 10-fold cross-validation. Evaluation metrics included Accuracy, Precision, Recall, F1-Score, AUC, and Matthews Correlation Coefficient (MCC). Empirical results show that the Random Forest algorithm outperformed both KNN and Decision Tree, achieving perfect scores across all metrics (1.000). These findings highlight the robustness of ensemble learning in intrusion detection. The results have practical implications for the development of more reliable, efficient, and automated Intrusion Detection Systems (IDS), especially in real-world scenarios prone to volumetric DDoS attacks. Future work should explore multiclass classification and real-time implementation.]]>
Copyrights © 2025
