Investigating novel machine learning based intrusion detection models for NSL-KDD data sets
Bibliographic record
Abstract
This study investigates the application of the Mutual Information (MI) feature selection technique to improve the accuracy of Machine Learning (ML) models on NSL-KDD datasets, building upon prior research. Six ML models, namely Decision Tree (DT), Logistic Regression (LR), K-Nearest Neighbor (KNN), Random Forest (RF), Naive Bayes (NB), and Support Vector Machine (SVM) with different kernels (1st, 2nd, and 3rd), are implemented for classification purposes. The proposed DT model in this study shows higher accuracy than the DT model proposed in the original paper by Ingre et al. for Intrusion Detection System (IDS). Additionally, a multi-class classification model for NSL-KDD datasets is developed, considering both normalized and non-normalized features. Interestingly, it is observed that the models trained without normalized features achieve higher accuracies compared to those trained with normalized features. Moreover, the study enhances the classification performance of the DT-based IDS using the Correlation based Feature Selection (CFS) technique for feature selection. The proposed IDS is evaluated both before and after feature selection for multi-class classification (normal and various attack types) and binary classification (normal and abnormal data).
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.003 | 0.006 |
| 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.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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 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".