Evidence map›Paper›PMID 40134887›Full record

ArticlePeerJ. Computer science2025

Optimal intrusion detection for imbalanced data using Bagging method with deep neural network optimized by flower pollination algorithm.

Hussein Ridha Sayegh, Wang Dong, Bahaa Hussein Taher, Muhanad Mohammed Kadum, Ali Mansour Al-Madani

Abstract read
In one paragraph

Article in PeerJ. Computer science, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Hussein Ridha Sayegh *College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China.ORCID 0000-0002-3104-0414
Wang DongCollege of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China.
Bahaa Hussein TaherCollege of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China.
Muhanad Mohammed KadumSchool of Computer Science and Engineering, Central South University, Changsha, Hunan, China.
Ali Mansour Al-Madani *College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China.ORCID 0000-0001-8021-1673

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

As the number of connected devices and Internet of Things (IoT) devices grows, it is becoming more and more important to develop efficient security mechanisms to manage risks and vulnerabilities in IoT networks. Intrusion detection systems (IDSs) have been developed and implemented in IoT networks to discern between regular network traffic and potential malicious attacks. This article proposes a new IDS based on a hybrid method of metaheuristic and deep learning techniques, namely, the flower pollination algorithm (FPA) and deep neural network (DNN), with an ensemble learning paradigm. To handle the problem of imbalance class distribution in intrusion datasets, a roughly-balanced (RB) Bagging strategy is utilized, where DNN models trained by FPA on a cost-sensitive fitness function are used as base learners. The RB Bagging strategy derives multiple RB training subsets from the original dataset and proper class weights are incorporated into the fitness function to attain unbiased DNN models. The performance of our IDS is evaluated using four commonly utilized public datasets, NSL-KDD, UNSW NB-15, CIC-IDS-2017, and BoT-IoT, in terms of different metrics,

Indexed as

Bagging classifierClass weightsDeep neural network (DNN)Flower pollination algorithm (FPA)Imbalance class distributionInternet of Things (IoT)Intrusion detection system (IDS)

Identifiers

PMID40134887
PMCPMC11935772

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.