Heterogeneous Ensemble Feature Selection for Network Intrusion Detection System

被引:5
|
作者
Damtew, Yeshalem Gezahegn [1 ,2 ]
Chen, Hongmei [1 ]
Yuan, Zhong [1 ]
机构
[1] Southwest Jiaotong Univ, Sch Comp & Artificial Intelligence, Chengdu 611756, Peoples R China
[2] Debre Berhan Univ, Coll Comp Sci, Debre Berhan 445, Ethiopia
关键词
Feature selection; Machine learning; Network intrusion detection system; MUTUAL INFORMATION; ALGORITHM;
D O I
10.1007/s44196-022-00174-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Intrusion detection systems get more attention to secure the computers and network systems. Researchers propose different network intrusion detection systems using machine learning techniques. However, the massive amount of data that contain irrelevant and redundant features is still challenging the intrusion detection systems. The redundancy and irrelevance of features may slow the processing time and decrease prediction performance. This paper proposes a Heterogeneous Ensemble Feature Selection (HEFS) method to select the relevant features while achieving better attack detection performance. The proposed method fuses the output feature subsets of five filter feature selection methods, using a union combination method, to obtain an ensemble features subset. HEFS method uses merit-based evaluation to avoid the internal redundancy of the obtained ensemble features subset and acquire the final optimal features. We evaluate the HEFS method with random forest, J48, random tree, and REP tree. In a multi-class NSL-KDD dataset, the experimental results show that the proposed method achieves better prediction performance than the specific feature selection methods and other frameworks.
引用
收藏
页数:25
相关论文
共 50 条
  • [1] Heterogeneous Ensemble Feature Selection for Network Intrusion Detection System
    Yeshalem Gezahegn Damtew
    Hongmei Chen
    Zhong Yuan
    International Journal of Computational Intelligence Systems, 16
  • [2] Bootstrap-based homogeneous ensemble feature selection for network intrusion detection system
    Damtew, Yeshalem Gezahegn
    Chen, Hongmei
    Din, Burhan Mohi Yu
    DEVELOPMENTS OF ARTIFICIAL INTELLIGENCE TECHNOLOGIES IN COMPUTATION AND ROBOTICS, 2020, 12 : 27 - 34
  • [3] An optimized ensemble model with advanced feature selection for network intrusion detection
    Ahmed, Afaq
    Asim, Muhammad
    Ullah, Irshad
    Zainulabidin
    Ateya, Abdelhamied A.
    PeerJ Computer Science, 2024, 10 : 1 - 32
  • [4] Majority Voting and Feature Selection Based Network Intrusion Detection System
    Patil, Dharmaraj R.
    Pattewar, Tareek M.
    EAI ENDORSED TRANSACTIONS ON SCALABLE INFORMATION SYSTEMS, 2022, 9 (06):
  • [5] Building an efficient intrusion detection system based on feature selection and ensemble classifier
    Zhou, Yuyang
    Cheng, Guang
    Jiang, Shanqing
    Dai, Mian
    COMPUTER NETWORKS, 2020, 174
  • [6] An optimized adaptive ensemble model with feature selection for network intrusion detection
    Yang, Zhongjun
    Liu, Zhi
    Zong, Xuejun
    Wang, Guogang
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2023, 35 (04)
  • [7] Ensemble Learning for Network Intrusion Detection Based on Correlation and Embedded Feature Selection Techniques
    Nassreddine, Ghalia
    Nassereddine, Mohamad
    Al-Khatib, Obada
    COMPUTERS, 2025, 14 (03)
  • [8] A Multiclass Network Intrusion Detection System Using Stacking Ensemble Technique with Hybrid Feature Selection
    Badiger, Veena S.
    Shyam, Gopal K.
    JOURNAL OF ADVANCES IN INFORMATION TECHNOLOGY, 2025, 16 (03) : 342 - 356
  • [9] An Intrusion Detection System Using Unsupervised Feature Selection
    Suman, Chanchal
    Tripathy, Somanath
    Saha, Sriparna
    PROCEEDINGS OF THE 2019 IEEE REGION 10 CONFERENCE (TENCON 2019): TECHNOLOGY, KNOWLEDGE, AND SOCIETY, 2019, : 19 - 24
  • [10] Hybrid ensemble techniques used for classifier and feature selection in intrusion detection systems
    Kharwar, Ankit
    Thakor, Devendra
    INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS, 2022, 28 (04) : 389 - 413