Experimental comparison of feature subset selection using GA and ACO algorithm

Citations

WEB OF SCIENCE

7
Citations

SCOPUS

13

초록

Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be classified. Exhaustive evaluation of possible feature subsets is usually infeasible in practice because of the large amount of computational effort required. Bio-inspired algorithms offer an attractive approach to find near-optimal solutions to such optimization problems. This paper presents an approach to feature subset selection using bio-inspired algorithms. Our experiments with several benchmark real-world pattern classification problems demonstrate the feasibility of this approach to feature subset selection in the automated design of neural networks for pattern classification and knowledge discovery.

제목
Experimental comparison of feature subset selection using GA and ACO algorithm
저자
Lee, KeunjoonJoo, JinuYang, JihoonHonavar, Vasant
발행일
2006
유형
Article; Proceedings Paper
저널명
Lecture Notes in Computer Science
4093
페이지
465 ~ 472