Incremental feature selection

被引:186
作者
Liu, HA [1 ]
Setiono, R [1 ]
机构
[1] Natl Univ Singapore, Dept Informat Syst & Comp Sci, Singapore 119260, Singapore
关键词
pattern recognition; machine learning; feature selection; dimensionality reduction;
D O I
10.1023/A:1008363719778
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection is a problem of finding relevant features. When the number of features of a dataset is large and its number of patterns is huge, an effective method of feature selection can help in dimensionality reduction. An incremental probabilistic algorithm is designed and implemented as an alternative to the exhaustive and heuristic approaches. Theoretical analysis is given to support the idea of the probabilistic algorithm in finding an optimal or near-optimal subset of features. Experimental results suggest that (1) the probabilistic algorithm is effective in obtaining optimal/suboptimal feature subsets; (2) its incremental version expedites feature selection further when the number of patterns is large and can scale up without sacrificing the quality of selected features.
引用
收藏
页码:217 / 230
页数:14
相关论文
共 30 条