Novel self-adjusted particle swarm optimization algorithm for feature selection
From MaRDI portal
Publication:2047517
DOI10.1007/s00607-020-00891-wzbMath1481.68043OpenAlexW3122730073MaRDI QIDQ2047517
Xuewen Xia, Zuohua Ding, Bo Wei, Yanrong Huang, Mingfeng Jiang, Xu An Wang
Publication date: 20 August 2021
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-020-00891-w
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Cites Work
- Unnamed Item
- Theoretical comparison between the Gini Index and Information Gain criteria
- Feature subset selection in large dimensionality domains
- Feature selection with dynamic mutual information
- Wrappers for feature subset selection
- Maximum relevance minimum common redundancy feature selection for nonlinear data
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- FS\(_-\)SFS: a novel feature selection method for support vector machines
- A note on genetic algorithms for large-scale feature selection
This page was built for publication: Novel self-adjusted particle swarm optimization algorithm for feature selection