Feature Selection for Network Intrusion Detection
Not on the map. Why?
Abstract (arXiv)
Network Intrusion Detection (NID) remains a key area of research within the information security community, while also being relevant to Machine Learning (ML) practitioners. The latter generally aim to detect attacks using network features, which have been extracted from raw network data typically using dimensionality reduction methods, such as principal component analysis (PCA). However, PCA is not able to assess the relevance of features for the task at hand. Consequently, the features available are of varying quality, with some being entirely non-informative. From this, two major drawbacks arise. Firstly, trained and deployed models have to process large amounts of unnecessary data, therefore draining potentially costly resources. Secondly, the noise caused by the presence of irrelevant features can, in some cases, impede a model's ability to detect an attack. In order to deal with these challenges, we present Feature Selection for Network Intrusion Detection (FSNID) a novel information-theoretic method that facilitates the exclusion of non-informative features when detecting network intrusions. The proposed method is based on function approximation using a neural network, which enables a version of our approach that incorporates a recurrent layer. Consequently, this version uniquely enables the integration of temporal dependencies. Through an extensive set of experiments, we demonstrate that the proposed method selects a significantly reduced feature set, while maintaining NID performance. Code will be made available upon publication.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 14 of its 74 references that are in the map. First posted on arXiv 18 Nov 2024.
Builds on
14 of 74 references.
References · 14
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2019On Variational Bounds of Mutual Informationcited by 559
- 2018Learning to Explain: An Information-Theoretic Perspective on Model Interpretationcited by 248
- 2020Problems with Shapley-value-based explanations as feature importance measurescited by 200
- 2019Feature relevance quantification in explainable AI: A causal problemcited by 167
- 2019Asymmetric Shapley values: incorporating causal knowledge into model-agnostic explainabilitycited by 114
- 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 56
- 2013Correlation and variable importance in random forestscited by 41
- 2021A Rigorous Information-Theoretic Definition of Redundancy and Relevancy in Feature Selection Based on (Partial) Information Decompositioncited by 26
- 2018A Novel Hierarchical Intrusion Detection System based on Decision Tree and Rules-based Modelscited by 9
- 2016Variational Information Maximization for Feature Selectioncited by 7
- 2022Ultra-marginal Feature Importance: Learning from Data with Causal Guaranteescited by 6
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025An explainable Recursive Feature Elimination to detect Advanced Persistent Threats using Random Forest classifiercited by 1
- 2026nCMD: Benign-Anchored Feature Selection for Imbalanced Network Intrusion Detectioncited by 0
- 2026BARS: Benign-Anchored Ranking and Selection for False Alarm Reduction in Network Intrusion Detectioncited by 0
- 2026BARS: Benign-Anchored Ranking and Selection for False Alarm Reduction in Network Intrusion Detection14 Jul 2026
- 2026nCMD: Benign-Anchored Feature Selection for Imbalanced Network Intrusion Detection7 Jun 2026
- 2025An explainable Recursive Feature Elimination to detect Advanced Persistent Threats using Random Forest classifier12 Nov 2025