An Effective Intrusion Detection Classifier Using Long Short-Term Memory with Gradient Descent Optimization
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Intrusion Detection System (IDS) is one of the important issues in network security. IDSs are built to detect both known and unknown malicious attacks. Several machine learning algorithms are used widely in IDS such as neural network, SVM, KNN etc. However, these algorithms have still some limitations such as high false positive and false alarm rate. In this paper, our contribution is to build a classifier of IDS following deep learning approach. We find the most suitable optimizer among six optimizes for Long Short-Term Memory Recurrent Neural Network (LSTM RNN) model applied in IDS. Through our experiments, we found that LSTM RNN model with Nadam optimizer outperforms to previous works. We demonstrate our approach is really efficiency to intrusion detection with accuracy is 97.54%, detection rate is 98.95%, and false alarm rate is reasonable with 9.98%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
ADADELTA: An Adaptive Learning Rate Method
Zeiler, M. D. (2012) · arXiv · doi:10.48550/arxiv.1212.5701 · Cited by 5,322
Identifying and attacking the saddle point problem in high-dimensional non-convex optimization
Dauphin, Y., Pascanu, R., Gulcehre, C., Cho, K., Ganguli, S., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1406.2572 · Cited by 827 · cited 1×
“[10] argue that the difficulty arises in fact not from local minimal but from saddle points.”
Background
Cited by
Machine Learning and Deep Learning Methods for Cybersecurity
Xin, Y., Kong, L., Liu, Z., Chen, Y., Li, Y., Zhu, H., Gao, M., Hou, H., & Wang, C. (2018) · IEEE Access · doi:10.1109/access.2018.2836950 · Cited by 1,228
A Survey on Machine Learning Techniques for Cyber Security in the Last Decade
Shaukat, K., Luo, S., Varadharajan, V., Hameed, I. A., & Xu, M. (2020) · IEEE Access · doi:10.1109/access.2020.3041951 · Cited by 530
A bidirectional LSTM deep learning approach for intrusion detection
Imrana, Y., Xiang, Y., Ali, L., & Abdul-Rauf, Z. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115524 · Cited by 432
Kasongo, S. M. (2023) · Computer Communications · doi:10.1016/j.comcom.2022.12.010 · Cited by 410
Deep learning methods in network intrusion detection: A survey and an objective comparison
Gamage, S., & Samarabandu, J. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102767 · Cited by 382
Metadata
- Authors
- Le, T.-T.-H., Kim, J., & Kim, H.
- Venue
- 2017 International Conference on Platform Technology and Service (PlatCon)
- Publisher
- IEEE
- Published
- 2017-02
- Pages
- 1-6
- OpenAlex
- W2598811698
- Cited by
- 138
- References
- 4
- FWCI
- 12.71
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.