2008
DOI: 10.1109/tsmcc.2008.923876
|View full text |Cite
|
Sign up to set email alerts
|

Random-Forests-Based Network Intrusion Detection Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
81
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 415 publications
(81 citation statements)
references
References 17 publications
0
81
0
Order By: Relevance
“…Therefore, we suggest providing network-based data sets in standard packet-based or flow-based formats as they are captured in real network environments. Simultaneously, many anomaly-based approaches (e.g., [91] or [92]) achieve high detection rates in data sets from the category other which is an indicator that the calculated attributes are promising for intrusion detection. Therefore, we recommend publishing both, the network-based data sets in a standard format and the scripts for transforming the data sets to other formats.…”
Section: Observations and Recommendationsmentioning
confidence: 99%
“…Therefore, we suggest providing network-based data sets in standard packet-based or flow-based formats as they are captured in real network environments. Simultaneously, many anomaly-based approaches (e.g., [91] or [92]) achieve high detection rates in data sets from the category other which is an indicator that the calculated attributes are promising for intrusion detection. Therefore, we recommend publishing both, the network-based data sets in a standard format and the scripts for transforming the data sets to other formats.…”
Section: Observations and Recommendationsmentioning
confidence: 99%
“…However, the scheme has to take its time complexity and space complexity into account in WSNs because of the small memory space and the limited energy of sensor nodes. The scheme in [14] uses the DCA E-DBSCAN [18] and random forest algorithm [19] to detect network attacks of WSN. In the scheme, the data set organized by data from CHs to a SN is clustered by E-DBSCAN in SN.…”
Section: Schemes Against Selective Forwarding Attackmentioning
confidence: 99%
“…These are commonly referred to as attack patterns, attack graphs or attack taxonomy depending upon the scenario in question. The definition of an attack graph by [7] and [8] are collection of scenarios that detail how a malicious agent can compromise the integrity of a targeted system. It represents prior knowledge about a given network in terms of vulnerabilities, exploits and connectivity.…”
Section: Related Workmentioning
confidence: 99%