2022
DOI: 10.1088/1742-6596/2347/1/012001
|View full text |Cite
|
Sign up to set email alerts
|

Research on intrusion detection method based on 1D-ICNN-BiGRU

Abstract: Intrusion detection is one of the effective ways to secure the network. Based the unbalanced network traffic data between different attacks, the intrusion detection algorithm turns out to be low intrusion detection accuracy and low identification rate of minority attacks. To solve the problems, an improved intrusion detection model combined with one-dimensional convolutional neural network and bidirectional gated recurrent unit(1D-ICNN-BiGRU) is proposed. First, the dataset is balanced by the SMOTE-Tomek algor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…This synthesizes new plausible examples in the minority class, but the new samples generated by SMOTE also have some limitations. 49 , 50 The newly generated samples have distinct boundary limitations. The Tomek Links algorithm was combined to achieve data balance 50 to avoid this problem caused by oversampling.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…This synthesizes new plausible examples in the minority class, but the new samples generated by SMOTE also have some limitations. 49 , 50 The newly generated samples have distinct boundary limitations. The Tomek Links algorithm was combined to achieve data balance 50 to avoid this problem caused by oversampling.…”
Section: Methodsmentioning
confidence: 99%
“… 49 , 50 The newly generated samples have distinct boundary limitations. The Tomek Links algorithm was combined to achieve data balance 50 to avoid this problem caused by oversampling. The Tomek Links algorithm is an under-sampling algorithm for identifying pairs of nearest neighbors in a dataset that have different classes.…”
Section: Methodsmentioning
confidence: 99%
“…The average of the features across timesteps is used in the paper [ 15 ], and their maximum value is reported in [ 16 ]. The final alternative involves merging features over time, though this approach may result in a proliferation of inputs to the subsequent layer and contribute to overfitting in the model [ 17 ].…”
Section: Introductionmentioning
confidence: 99%