|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Feature subset selection in large dimensionality domains|
|Authors:||Gheyas, Iffat A|
|Keywords:||feature subset selection|
high dimensional datasets
|Citation:||Gheyas IA & Smith L (2010) Feature subset selection in large dimensionality domains, Pattern Recognition, 43 (1), pp. 5-13.|
|Abstract:||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.|
|Rights:||Published in Pattern Recognition by Elsevier.|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.