2014 Fourth International Conference on Digital Information and Communication Technology and Its Applications (DICTAP) 2014
DOI: 10.1109/dictap.2014.6821663
|View full text |Cite
|
Sign up to set email alerts
|

An evaluation of data mining classification models for network intrusion detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(17 citation statements)
references
References 12 publications
0
17
0
Order By: Relevance
“…Sweep, portsweep (So-In et al, 2014) the Iranian atomic program (Nourian & Madnick, 2018). Attacks that could target ICSs could be state-sponsored or they might be launched by the competitors, internals attackers with a malicious target, or even hacktivists.…”
Section: Probementioning
confidence: 99%
“…Sweep, portsweep (So-In et al, 2014) the Iranian atomic program (Nourian & Madnick, 2018). Attacks that could target ICSs could be state-sponsored or they might be launched by the competitors, internals attackers with a malicious target, or even hacktivists.…”
Section: Probementioning
confidence: 99%
“…The J48 decision tree algorithm is based on Quinlan's C4.5 algorithm and makes decisions based on a tree-like graph structure [31]. Decision Trees is said to perform better on well-defined problems and has been previously successful in classifying botnet traffic with low false positives [32], [28]. Random Forest [33] which is classed as belonging to decision tree approaches, is also used.…”
Section: B Experiments and Resultsmentioning
confidence: 99%
“…The value of plus/minus 2 seconds is used to determine if a cell is close to the next as it is a fair interval to account for separate activities while making room for network lags especially in the case of chat protocols that could have constant cells. For example, [10,11,12,13,20,21,22,23,30,31,32,33] become [11.5, 21.5, 31.5]; the cells with timestamps 10, 11, 12 and 13 were clustered as a unique cell with timestamp 11.5 and a unique cell count of 4. Cell aggregation is done to group events together and ease the extraction of features.…”
Section: Cell Aggregation Grouping and Time Segregationmentioning
confidence: 99%
“…KNN is used to carry out the classification considering k-sub-datasets, each of them having alike characteristics putting in Euclidean Distance to figure out the group. IBK is one of most straightforward k-Nearest-Neighbor classifiers [11]. These paper results show that when it comes to the detection accuracy, testing time, and falsepositive rate the knn is the most performing classifier among all others [10].…”
Section: Related Workmentioning
confidence: 99%