2016 · 44 citations · 16 references
ComputingComputer EngineeringComputer ScienceComputer SecurityMachine LearningNetwork SecurityClassificationComputer IntrusionDecision TreesDenial-of-service AttacksEnsemble MethodsIntrusion DetectionAttack DetectionClassification AlgorithmsComparative Performance EvaluationIntrusion Detection Evaluation MetricsNearest-neighbor ClassificationNetwork Intrusion DetectionNetwork ResourcesRandom Forest Classification
The ability of an intrusion detection system (IDS) to accurately detect potential attacks is crucial in protecting network resources and data from the attack's destructive effects. Among many techniques available for incorporation into IDS to improve its accuracy, classification algorithms have been demonstrated to produce impressive and efficient results in detecting IPv4-based attacks but have not yet been investigated in IPv6-based attacks. This paper aims to present the result of a comparative analysis on the performance of three classifier algorithms, namely, decision tree, random forest, and k-nearest neighbor (k-NN), to detect an IPv6-based attack, specifically ICMPv6-based DoS flooding. The experimental results showed that there is no single best algorithm that outperforms others in all measured metrics. k-NN has the lowest false-positive outcome while RF has the lowest false-negative (missed attacks) percentage.
16
Leo Breiman · Machine Learning · 2001 · 126.2K citations · Full text
J. R. Quinlan · Machine Learning · 1986 · 12.4K citations · Full text
Understanding interobserver agreement: the kappa statistic.
Anthony J. Viera, Joanne M. Garrett · PubMed · 2005 · 7.1K citations
A detailed analysis of the KDD CUP 99 data set
Mahbod Tavallaee, Ebrahim Bagheri, Wei Lu et al. · 2009 · 4.8K citations · Full text