Abstract
The issue of studying the effect of fixing the length of the selected feature subsets using ant colony optimization (ACO) has not yet been studied. This paper addresses this concern by demonstrating four points that are: 1) determining the optimal feature subset, 2) determining the length of the subsets in ACO for subset selection problems, 3) different stopping criteria when solving feature selection by ACO, and 4) experiments on an ACO algorithm for feature selection problems using artificial and real-world datasets in two cases fixing and not fixing the length of the selected feature subsets with the use of a support vector machine (SVM) classifier. The results showed that not fixing the length of the selected feature subsets is better than fixing the length of the selected feature subsets in terms of the classifier accuracy in seven datasets out of ten.
Original language | English |
---|---|
Title of host publication | Proceedings - 13th International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2012 |
Place of Publication | United States |
Publisher | Wiley-IEEE Press |
Pages | 733-738 |
Number of pages | 6 |
ISBN (Print) | 9780769548791 |
DOIs | |
Publication status | Published - 2012 |
Event | 13th International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2012 - Beijing, Beijing, China Duration: 14 Dec 2012 → 16 Dec 2012 |
Conference
Conference | 13th International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2012 |
---|---|
Country/Territory | China |
City | Beijing |
Period | 14/12/12 → 16/12/12 |