Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Feature subset selection in large dimensionality domains
Author(s): Gheyas, Iffat A
Smith, Leslie
Contact Email:
Keywords: feature subset selection
high dimensional datasets
Neural networks (Computing science)
Genetic algorithms
Issue Date: Jan-2010
Date Deposited: 1-Oct-2009
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.
DOI Link: 10.1016/j.patcog.2009.06.009
Rights: Published in Pattern Recognition by Elsevier.

Files in This Item:
File Description SizeFormat 
PR_3589_corrected.pdfFulltext - Accepted Version478.04 kBAdobe PDFView/Open

This item is protected by original copyright

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.