2019
DOI: 10.1007/s11277-019-06864-3
|View full text |Cite
|
Sign up to set email alerts
|

Feature Selection Ranking and Subset-Based Techniques with Different Classifiers for Intrusion Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…The NSL-KDD dataset was used in the above-mentioned study, but the authors suggest a hybrid method for more accurate results. In [13], the authors suggest a feature selection technique using filter and wrapper methods, but these are computationally expensive. Meanwhile, in [14], the authors propose three IDS on K-means clustering, a decision tree, and a hybrid of these methods to achieve a maximum detection rate of 70-93%.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The NSL-KDD dataset was used in the above-mentioned study, but the authors suggest a hybrid method for more accurate results. In [13], the authors suggest a feature selection technique using filter and wrapper methods, but these are computationally expensive. Meanwhile, in [14], the authors propose three IDS on K-means clustering, a decision tree, and a hybrid of these methods to achieve a maximum detection rate of 70-93%.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This feature selection is a rule-based algorithm that chooses the lowest error rate attributes as its one rule and then ranked them accordingly [59], [60]. It constructs rules and tests a single attribute at a time and branch for every value of that attribute [61].…”
Section: One-r (Or)mentioning
confidence: 99%