DocumentCode :
2304389
Title :
Efficiency comparison of simulated annealing algorithm and Genetic Algorithm in Feature Selection
Author :
Wan, Chang
Author_Institution :
Sch. of Inf. Sci. & Technol., SUN YAT-SEN Univ., Guangzhou, China
Volume :
5
fYear :
2010
fDate :
10-12 Aug. 2010
Firstpage :
2330
Lastpage :
2333
Abstract :
As of 1997, when a special issue on relevance including several papers on feature selection was published, few domains explored used more than 40 features.The situation has changed considerably in the past few years and, in this special issue, most papers explore domains with hundreds to tens of thousands of variables or features: new techniques are proposed to address these challenging tasks involving many irrelevant and redundant features. Feature selection has been proved to be important in improving the accuracy of classification. Genetic Algorithm is common used in a variety of situation and has been showed to have good result. But it cannot be ignored that it often takes much time when applying the Genetic Algorithm to the data sets with instances. In this study, we show that Simulated Annealing Algorithm is potentially to be more efficient than Genetic Algorithm in Feature Selection.
Keywords :
data mining; genetic algorithms; pattern classification; simulated annealing; classification; data mining; feature selection; genetic algorithm; simulated annealing algorithm; Accuracy; Annealing; Benchmark testing; Buildings; Data models; Simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation (ICNC), 2010 Sixth International Conference on
Conference_Location :
Yantai, Shandong
Print_ISBN :
978-1-4244-5958-2
Type :
conf
DOI :
10.1109/ICNC.2010.5584158
Filename :
5584158
Link To Document :
بازگشت