.png){kind=icon}
.png){kind=icon}
Return
Feature subset selection in large dimensionality domains
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2009.06.009.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Searching for an optimal feature subset from a high dimensional feature space is known to be an NP-complete problem. We present a hybrid algorithm, SAGA, for this task. SAGA combines the ability to avoid being trapped in a local minimum of simulated annealing with the very high rate of convergence of the crossover operator of genetic algorithms, the strong local search ability of greedy algorithms and the high computational efficiency of generalized regression neural networks. We compare the performance over time of SAGA and well-known algorithms on synthetic and real datasets. The results show that SAGA outperforms existing algorithms. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Curse of dimensionality
Feature subset selection
High dimensionality
Dimensionality reduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.