.png){kind=icon}
.png){kind=icon}
Return
Binary Anarchic Society Optimization for Feature Selection
.png){kind=icon}
OA
AI
Ü
E
M
DOI：10.59277/ROMJIST.2023.3-4.08.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Datasets comprise a collection of features; however, not all of these features may be necessary. Feature selection is the process of identifying the most relevant features while eliminating redundant or irrelevant ones. To be effective, feature selection should improve classification performance while reducing the number of features. Existing algorithms can be adapted and modified into feature selectors. In this study, we introduce the implementation of the Anarchic Society Optimization algorithm, a human-inspired algorithm, as a feature selector. This is the first study that utilizes the binary version of the algorithm for feature selection. The proposed Binary Anarchic Society Algorithm is evaluated on nine datasets and compared to three known algorithms: Binary Genetic Algorithm, Binary Particle Swarm Optimization, and Binary Gray Wolf Optimization. Additionally, four traditional feature selection techniques (Info Gain, Gain Ratio, Chi-square, and ReliefF) are incorporated for performance comparison. Our experiments highlight the competitive nature of the proposed method, suggesting its potential as a valuable addition to existing feature selection techniques.
Keywords:
artificial intelligence
anarchic society optimization
feature selection
meta-heuristic
swarm intelligence algorithms
Journal
R
IF:
3.9
Papers:
26
Citations:
442
Organization
No organization information available
Cited Papers