CNN-RBM Integrated Deep Learning Design for Categorizing Attack in an Intrusion Detection System
Bibliographic record
Abstract
Currently, network attacks and intrusions are increasing due to expansions in computer networks. The most critical issue these days in modern cyber networks are network attacks. Intrusion prevention systems are designed to enhance security along with the firewalls and other intrusion prevention systems. Each and every network regardless of its size is exposed to network attacks. An Intrusion Detection System (IDS) is an essential security tool for categorizing malicious attacks in networks. Presently, Machine Learning (ML) and Deep Learning (DL) models are applied for developing a competent IDS and in numerous domains. Automated detection of malicious attacks in a timely manner is the purpose of IDS. Advanced cyber security solutions are required for continuous detection of malicious threats. Hence, investigators are generating an effective IDS for this research problem due to complex malicious attacks. In this article, an integrated DL model comprising of Convolutional Neural Network (CNN) with Restricted Boltzmann Machine (RBM) are applied to generate a fusion IDS to predict and classify malicious attacks. In the proposed Integrated Convolutional Restricted Boltzmann Machine Intrusion Detection System (ICRBM_IDS), the CNN executes convolution to hold local features and RBM captures the temporal features to enhance the performance of Intrusion Detection and Prediction. The ability of the ICRBM_IDS model is assessed based on the ID data present widely. The experiments were conducted on CSE-CIC-DS2018 dataset which is the result of collaborative project between Communications security Establishment (CSE) and the Canadian Institute of Cybersecurity (CIC) that is currently used and realistic. The simulation results of the proposed ICRBM_IDS outperform the present ID methods by attaining a high accuracy rate by detecting malicious attacks.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 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".