A Detection of Intrusions Based on Deep Learning
Bibliographic record
Abstract
The use of network intrusion detection systems is expanding as cloud computing becomes more widespread. Network intrusion detection systems (NIDS) are crucial to network security since network traffic is increasing and cyberattacks are being launched more frequently. Algorithms for detecting anomalies in intruder detection use either machine learning systems or pattern matching systems. Pattern-matching methods frequently produce false positive results, while AI/ML-based systems predict possible assaults by identifying connections between metrics, features, or collections of metrics, features. KNN, SVM, and other models are the most widely used, but they only apply to a few features, are not very accurate, and have a higher false positive rate. This proposal developed a deep learning model that combines the benefits of two-dimensional LSTMs and convolutional neural networks to learn the characteristics of spatial and temporal data. The study’s model was developed and evaluated using the freely available NSL-KDD dataset. The suggested model is very effective, having a low rate of false positives and a high rate of detection. Some sophisticated network intrusion detection systems use machine learning and deep learning models, and their performance is superior to that of the proposed model.
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.001 |
| 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".