Botnet Detection Mechanism Using Graph Neural Network
Bibliographic record
Abstract
Botnet Detection Mechanism Based On Graph Neural Network Aleksander Maksimoski, 2023. Master of Applied Science Computer Networks Toronto Metropolitan University, Toronto, Ontario, Canada. A botnet is a group of computers that are infected by malware, which can be utilized to wreak havoc on other computers. In the literature, various techniques have been proposed to detect the presence of botnets in networks and systems. Nowadays, Intrusion Detection Systems and Intrusion Prevention Systems are capable of defending against botnets that create volumetric and fast-paced traffic. However, these systems are not well suited to address prevalent real-time, long-term, and stealth attacks. This thesis proposes a Graph Neural Network (GNN)-based method for detecting botnet activity based on supervised learning. This work is the first-ever application of the Activity and Event Network framework to build a GNN model for botnet detection purposes. The proposed model is evaluated using five different labeled datasets, yielding preliminary promising results in terms of botnet prediction, using precision, recall, F1-score, and accuracy as performance metrics.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".