Stefany Michelle Perachimba Panezo

Mrs. Stefany Michelle Perachimba Panezo

orcid

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 July 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
Byron Wladimir Oviedo BayasByron Wladimir Oviedo Bayas
Byron Wladimir Oviedo Bayas
SPStefany Michelle Perachimba Panezo
Stefany Michelle Perachimba Panezo
JGJorge Humberto Guanin-Fajardo
Jorge Humberto Guanin-Fajardo
SSStalin Daniel Carreño Sandoya
Stalin Daniel Carreño Sandoya
The classification of malicious network-traffic is critical to cybersecurity. However, to the best of our knowledge, no previous studies have performed a comparative analysis of supervised algorithms for classifying malicious traffic, specifically within the network environment of UTEQ, an academic setting with distinctive traffic patterns and security policies. This study compared the performance of four supervised machine learning algorithms (K-Nearest Neighbors, Decision Tree, SVM-RBF, and SVM-Polynomial) using the CRISP-DM methodology. The dataset consisted of 1182 records with 30 variables from Hillstone Networks firewall logs at UTEQ, representing three categories: Normal (74.3%), Botnet_Activity (16.4%), and Other_Malware (9.3%). Preprocessing techniques included SMOTE balancing and Relief-based feature selection (reducing the variables to eight). The area under the curve (AUC) was used as a primary discriminant metric under two complementary one-vs-rest aggregation schemes. Using a support-weighted AUC, K-Nearest Neighbors (k = 7) obtained the highest value (AUC = 0.6147), followed by SVM-Polynomial (0.5846), Decision Tree (0.5724), and SVM-RBF (0.5784), with SVM-RBF obtaining the highest accuracy on the unified eight-feature test set (73.8%). Using a macro-averaged AUC, SVM-Polynomial obtained the highest value (0.6166), closely followed by KNN (0.6133). All AUC values fell within a narrow range (0.57–0.62). A class-wise analysis showed that no single model provides strong discrimination for all traffic classes, and that algorithm selection for operational deployment should be guided by the specific class of interest rather than by a single aggregate metric.

26 May 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
Byron Wladimir Oviedo BayasByron Wladimir Oviedo Bayas
Byron Wladimir Oviedo Bayas
SPStefany Michelle Perachimba Panezo
Stefany Michelle Perachimba Panezo
JGJorge Humberto Guanin-Fajardo
Jorge Humberto Guanin-Fajardo
SSStalin Daniel Carreño Sandoya
Stalin Daniel Carreño Sandoya
The classification of malicious network traffic is critical to cybersecurity. However, to the best of our knowledge, no previous studies have performed a comparative analysis of supervised algorithms for classifying malicious traffic specifically within the net-work environment of UTEQ, an academic setting with distinctive traffic patterns and security policies. For this reason, this study compared the performance of four super-vised machine learning algorithms (K-Nearest Neighbors, Decision Tree, SVM-RBF, and SVM-Polynomial) using the CRISP-DM methodology. The dataset consisted of 1,182 records with 30 variables from Hillstone Networks firewall logs at UTEQ, repre-senting three categories: Normal (74.3%), Botnet_Activity (16.4%), and Oth-er_Malware (9.3%). Preprocessing techniques were applied, including SMOTE balanc-ing and feature selection using Relief (reducing the variables to 8). The area under the curve was used as the primary discriminant metric; K-Nearest Neighbors (K=7) achieved the best performance with AUC=0.6147, outperforming Decision Tree (0.5724), SVM-RBF (0.5654), and SVM-Polynomial (0.5846), although SVM-RBF ob-tained higher accuracy (76.34%). The importance analysis revealed that dest_port was the dominant predictor (55%), explained by the concentration of legitimate traffic on standard ports (0–1023) versus threats on high ports (>49152). The results demon-strated that KNN offers the best probabilistic discriminative power for network traffic classification, establishing its superiority over more complex parametric algorithms in cybersecurity contexts where confidence in predictions is critical for reducing false positives.