MICQ-IPSO: An effective two-stage hybrid feature selection algorithm for high-dimensional data DOI

Xinqian Li,

Jia Ren

Neurocomputing, Journal Year: 2022, Volume and Issue: 501, P. 328 - 342

Published: June 14, 2022

Language: Английский

Evolving cybersecurity frontiers: A comprehensive survey on concept drift and feature dynamics aware machine and deep learning in intrusion detection systems DOI Creative Commons
Methaq A. Shyaa, Noor Farizah Ibrahim, Zurinahni Zainol

et al.

Engineering Applications of Artificial Intelligence, Journal Year: 2024, Volume and Issue: 137, P. 109143 - 109143

Published: Aug. 22, 2024

Language: Английский

Citations

10

Minimizing the searching time of multiple targets in uncertain environments with multiple UAVs DOI Creative Commons
Sara Pérez-Carabaza, Eva Besada-Portas, José Antonio López Orozco

et al.

Applied Soft Computing, Journal Year: 2024, Volume and Issue: 155, P. 111471 - 111471

Published: March 6, 2024

The focus of this paper is the use Unmanned Aerial Vehicles (UAVs) for searching multiple targets under uncertain conditions in minimal possible time. problem, known as Minimum Time Search (MTS), belongs to Probabilistic (PS) field and addresses critical missions, such search & rescue, military surveillance. These operations, characterized by complex environments, demand efficient UAV trajectory optimization. multi-target version PS introduces additional challenges, due their higher complexity need wisely distribute UAV's efforts among targets. In order tackle under-explored aspect MTS, we optimize time find all with new Ant Colony Optimization (ACO)-based planner. This novel optimization criterion formulated using Bayes' theory, considering probability models (initial belief motion model) sensor likelihood. Our work contributes significantly (i) developing an objective function tailored (ii) proposing ACO-based planner designed effectively handle complexities moving targets, (iii) introducing a constructive heuristic that used planner, specifically MTS problem. efficacy our approach demonstrated through comprehensive analysis validation across various scenarios, showing superior performance over existing methods problems.

Language: Английский

Citations

9

LSFSR: Local label correlation-based sparse multilabel feature selection with feature redundancy DOI
Lin Sun, Yuxuan Ma, Weiping Ding

et al.

Information Sciences, Journal Year: 2024, Volume and Issue: 667, P. 120501 - 120501

Published: March 20, 2024

Language: Английский

Citations

9

A high-dimensional feature selection algorithm via fast dimensionality reduction and multi-objective differential evolution DOI
Xuezhi Yue, Yihang Liao, Hu Peng

et al.

Swarm and Evolutionary Computation, Journal Year: 2025, Volume and Issue: 94, P. 101899 - 101899

Published: March 4, 2025

Language: Английский

Citations

1

Adaptive patch selection to improve Vision Transformers through Reinforcement Learning DOI Creative Commons
Francesco Cauteruccio, Michele Marchetti,

Davide Traini

et al.

Applied Intelligence, Journal Year: 2025, Volume and Issue: 55(7)

Published: April 1, 2025

Language: Английский

Citations

1

Robust sparse and low-redundancy multi-label feature selection with dynamic local and global structure preservation DOI
Yonghao Li, Liang Hu, Wanfu Gao

et al.

Pattern Recognition, Journal Year: 2022, Volume and Issue: 134, P. 109120 - 109120

Published: Oct. 23, 2022

Language: Английский

Citations

36

Location and path planning for urban emergency rescue by a hybrid clustering and ant colony algorithm approach DOI
Bing Yang, Lunwen Wu, Jian Xiong

et al.

Applied Soft Computing, Journal Year: 2023, Volume and Issue: 147, P. 110783 - 110783

Published: Aug. 26, 2023

Language: Английский

Citations

21

Feature subset selection in structural health monitoring data using an advanced binary slime mould algorithm DOI Creative Commons
Ramin Ghiasi, Abdollah Malekjafarian

Journal of Structural Integrity and Maintenance, Journal Year: 2023, Volume and Issue: 8(4), P. 209 - 225

Published: July 6, 2023

Feature Selection (FS) is an important step in data-driven structural health monitoring approaches. In this paper, Advanced version of the Binary Slime Mould Algorithm (ABSMA) introduced for feature subset selection to improve performance damage classification techniques. Two operators mutation and crossover are embedded algorithm, overcome stagnation situation involved (BSMA). The proposed ABSMA then a new SHM framework which consists three main steps. first step, time domain responses collected pre-processed extract statistical features. second order extracted features reduced using optimization algorithm find minimal salient by removing irrelevant, redundant data. Finally, optimized vectors used as inputs Neural Network (NN) based models. Benchmark datasets timber bridge model three-story frame structure employed validate algorithm. results show that provides better convergence rate compared other commonly binary algorithms.

Language: Английский

Citations

20

Dynamic feature selection model for adaptive cross site scripting attack detection using developed multi-agent deep Q learning model DOI Creative Commons
Isam Kareem Thajeel,

Khairulmizam Samsudin,

Shaiful Jahari Hashim

et al.

Journal of King Saud University - Computer and Information Sciences, Journal Year: 2023, Volume and Issue: 35(6), P. 101490 - 101490

Published: Jan. 23, 2023

Web applications' popularity has raised attention in various service domains, which increased the concern about cyber-attacks. One of these most serious and frequent web application attacks is a Cross-site scripting attack (XSS). It causes grievous harm to victims. Existing security methods against XSS fail due evolving nature attacks. aspect feature drift changes relevancy degradation performance. Unfortunately, dynamic awareness occurrence missing. Thus, this study attempts fill gap by proposing drift-aware algorithm for detecting evolved The proposed approach selection based on deep Q-network multi-agent (DQN-MAFS) framework. Each agent associated with one responsible selecting or deselecting its feature. DQN-MAFS provides sub-model reward distribution over agents, named as fair FARD-DFS. This framework capable supporting real-time, updates adjustment embedded knowledge long new labelled data arrives. been evaluated using four real datasets length sizes. evaluation process was conducted compared state-of-the-art works. obtained results show superiority our FARD-DFS benchmarks terms majority metrics. improvement percentages mean accuracy F1-measure ranged from 1.01% 12.1% 0.55% 6.88%, respectively, comparison benchmarks. can be deployed an autonomous detection system without need any offline retraining model detect attack.

Language: Английский

Citations

19

Multi-objective binary grey wolf optimization for feature selection based on guided mutation strategy DOI
Xiaobo Li, Qiyong Fu, Qi Li

et al.

Applied Soft Computing, Journal Year: 2023, Volume and Issue: 145, P. 110558 - 110558

Published: June 19, 2023

Language: Английский

Citations

19