A two-population evolutionary algorithm for feature extraction: Combining filter and wrapper

IEEE Congress on Evolutionary Computation(2011)

引用 1|浏览17
暂无评分
摘要
Extracting good features is critical to the performance of learning algorithms such as classifiers. Feature extraction selects and transforms original features to find information hidden in data. Due to the huge search space of selection and transformation of features, exhaustive search is computationally prohibitive and randomized search such as evolutionary algorithms (EA) are often used. In our prior work on evolutionary-based feature extraction, an individual, which represents a set of features, is evaluated by estimating the accuracy of a classifier when the individual's feature set is used for learning. Although incorporating a learning algorithm during evaluation, which is called the wrapper approach, generally performs better than evaluating an individual simply by the statistical properties of data, which is called the filter appproach, our EA based on a wrapper approach suffers from overfitting, so that a slight enhancement of fitness in training can dramatically reduce the classification accuracy for unseen testing data. To cope with this problem, this paper proposes a two-population EA for feature extraction (TEAFE) that combines filter and wrapper approaches, and shows the promising preliminary results.
更多
查看译文
关键词
evolutionary computation,learning (artificial intelligence),filter appproach,data testing,wrapper approach,filter,search problems,data encapsulation,feature extraction,hidden information,wrapper,filtering theory,classification accuracy,classification,search space,randomized search,learning algorithm,two population evolutionary algorithm,island model,classification algorithms,evolutionary computing,learning artificial intelligence,random search,evolutionary algorithm,accuracy,correlation,exhaustive search
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要