Investigating the Effect of Fixing the Subset Length using Ant Colony Optimization Algorithms for Feature Subset Selection Problems

被引:2
|
作者
Abd-Alsabour, Nadia [1 ]
Randall, Marcus [2 ]
Lewis, Andrew [3 ]
机构
[1] Cairo Univ, Cairo, Egypt
[2] Bond Univ, Robina, Qld, Australia
[3] Griffith Univ, Nathan, Qld, Australia
关键词
ACO; feature selection; subset problems;
D O I
10.1109/PDCAT.2012.84
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:733 / 738
页数:6
相关论文
共 50 条