IDEAS home Printed from https://ideas.repec.org/a/abq/ijist1/v7y2025i2p916-925.html

Hybrid Intrusion Detection System Based on Optimal Feature Selection and Evolutionary Algorithm for Wired Networks

Author

Listed:
  • Husnain Babar,Muhammad Imran,Anees Tariq

    (Department of Robotics and Artificial Intelligence, SZABISTUniversity,Islamabad, Pakistan)

Abstract

The field of cybersecurity encounters ongoing difficulties in identifying and preventing attacks in networks, and the pervasive threat of cyberattacks demands continual advancements in intrusion detection systems (IDS) to safeguard network integrity. Traditional intrusion detection systems face the challenge of class imbalance. Addressing the formidable challenges posed by class imbalance and high-dimensional data, this research proposes a novel hybrid IDS approach. Leveraging (ACO), the algorithm navigates complex datasets to identify salient features, effectively mitigating the complexities associated with high-dimensional data. Subsequently, a Weighted Stacking Classifier amalgamates the strengths of Random Forest, AdaBoost, and Gradient Boosting classifiers, fortifying the system’s ability to handle class imbalance robustly. By strategically enhancing the importance of base classifiers with favourable training outcomes and diminishing the influence of those yielding inferior results, the hybrid IDS endeavors to optimize classification efficacy. The experimentation, conducted exclusively on the dataset named NSL-KDD, demonstrates the efficacy of the proposed model, yielding remarkable results. With a 90.13% Accuracy, 88.87% precision, 91.23% Recall, and 87.33% F1-score, the hybrid IDS exhibits superior performance in detecting malicious activity. The findings underscore the viability of the proposed hybrid IDS as a potent tool in the ongoing battle against cyber threats, positioning it for real-world deployment across diverse networks.

Suggested Citation

  • Husnain Babar,Muhammad Imran,Anees Tariq, 2025. "Hybrid Intrusion Detection System Based on Optimal Feature Selection and Evolutionary Algorithm for Wired Networks," International Journal of Innovations in Science & Technology, 50sea, vol. 7(2), pages 916-925, May.
  • Handle: RePEc:abq:ijist1:v:7:y:2025:i:2:p:916-925
    as

    Download full text from publisher

    File URL: https://journal.50sea.com/index.php/IJIST/article/view/1374/1906
    Download Restriction: no

    File URL: https://journal.50sea.com/index.php/IJIST/article/view/1374
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:abq:ijist1:v:7:y:2025:i:2:p:916-925. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Iqra Nazeer (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.