Implementation of Intrusion detection and prevention with Deep Learning in Cloud Computing
Bibliographic record
Abstract
An administrator is employed to identify network security breaches in their organizations by using a Network Intrusion Detection and Prevention System (NIDPS), which is presented in this paper that can detect and preventing a wide range of well-known network attacks. It is now more important than ever to recognize different cyber-attacks and network abnormalities that build an effective intrusion detection system plays a crucial role in today's security. NSL-KDD benchmark data set is extensively used in literature, although it was created over a decade ago and will not reflect current network traffic and low-footprint attacks. Canadian Institute of Cyber security introduced a new data set, the CICIDS2017 network data set, which solved the NSL-KDD problem. With our approach, we can apply a variety of machine learning techniques like linear regression, Random Forest and ID3. The efficient IDPS is indeed implemented and tested in a network environment utilizing several machine learning methods. A model that simulates an IDS-IPS system by predicting whether a stream of network data is malicious or benign is our objective. An Enhanced ID3 is proposed in this study to identify abnormalities in network activity and classify them. For benchmark purposes, we also develop an auto encoder network, PCA, and K-Means Clustering. On CICIDS2017, a standard dataset for network intrusion, we apply Self-Taught Learning (STL), which is a deep learning approach. To compare, we looked at things like memory, Recall, Accuracy, and Precision.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".