Feature Selection for Network Intrusion Detection
Charles Westphal, Stephen Hailes, Mirco Musolesi
Abstract
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 available at https://github.com/c-s-westphal/FSNID.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 636d11ba-052d-40ed-8d62-46ab1f218ce2Cited by top-tier papers1
Ask how each one uses itBuilds on7
- The Many Shapley Values for Model ExplanationMukund Sundararajan, Amir NajmiICML 2020 · 799 citations
- Understanding Global Feature Contributions With Additive Importance MeasuresIan Covert, Scott M. Lundberg, Su-In LeeNeurIPS 2020 · 476 citations
- Problems with Shapley-value-based explanations as feature importance measuresI. Elizabeth Kumar, Suresh Venkatasubramanian, Carlos Scheidegger, Sorelle A. FriedlerICML 2020 · 458 citations
- Asymmetric Shapley values: incorporating causal knowledge into model-agnostic explainabilityChristopher Frye, Colin Rowat, Ilya FeigeNeurIPS 2020 · 246 citations
- Learning to Maximize Mutual Information for Dynamic Feature SelectionIan Connick Covert, Wei Qiu, Mingyu Lu, Nayoon Kim et al.ICML 2023 · 67 citations
Related papers
- CND-IDS: Continual Novelty Detection for Intrusion Detection SystemsSean Fuhrman, Onat Güngör, Tajana RosingDAC 2025 · 9 citations
- SketchFeature: High-Quality Per-Flow Feature Extractor Towards Security-Aware Data PlaneSian Kim, Seyed Mohammad Mehdi Mirnajafizadeh, Bara Kim, Rhongho Jang et al.NDSS 2025
- RIDS: Towards Advanced IDS via RNN Model and Programmable Switches Co-Designed ApproachesZiming Zhao, Zhaoxuan Li, Zhuoxue Song, Fan Zhang et al.INFOCOM 2024 · 21 citations
- xNIDS: Explaining Deep Learning-based Network Intrusion Detection Systems for Active Intrusion ResponsesFeng Wei, Hongda Li, Ziming Zhao, Hongxin HuUSENIX Security 2023
- Let Your Features Tell The Differences: Understanding Graph Convolution By Feature SplittingYilun Zheng, Xiang Li, Sitao Luan, Xiaojiang Peng et al.ICLR 2025
