Name
Abstract | ||
|---|---|---|
The continuous development in network technologies causes a considerable hike in number of attacks and intrusions. Identification of these threats has become a critical part of security. To fulfill this task, the Intrusion Detection Systems (IDS) were created. Unfortunately, these tools have curse of dimensionality which tends to increase time complexity and decrease resource utilization. As a consequence, it is desirable that important features of network traffic must be analyzed. To obtain these features, previous work has employed a variant of Linear Discriminant Analysis (LDA) called Median Nearest Neighbors-LDA (Median NN-LDA). This approach finds the relevant features by working with network connections that are near to the median of every class. However, Median NN-LDA has an important drawback. It employs the class arithmetic mean vectors in the within and between scatter matrices formulation. As the arithmetic mean is sensitive to outliers, the approach will not produce optimal results. To deal with that, this paper introduces a new robust Median NN-LDA based on the generalized mean. Many experiments on KDDcup99 and NSL-KDD indicate the superiority of the approach over many LDA variants. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cose.2019.05.021 | Computers & Security |
Keywords | Field | DocType |
Linear discriminant analysis,Median NN-LDA,Generalized mean,Network anomaly detection,Feature extraction methods,NSL-KDD,KDDcup99 | Data mining,Matrix (mathematics),Computer science,Computer security,Arithmetic mean,Generalized mean,Outlier,Curse of dimensionality,Linear discriminant analysis,Time complexity,Intrusion detection system | Journal |
Volume | ISSN | Citations |
86 | 0167-4048 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zyad Elkhadir | 1 | 0 | 1.01 |
| Mohammed Benattou | 2 | 0 | 2.03 |