C-FOCUS: A continuous extension of FOCUS
暂无分享,去创建一个
This paper deals with the problem of feature selection. Almuallim and Dieterich [1] developed the FOCUS algorithm which performs optimal feature selection on boolean domains. In this paper an extension of FOCUS is developed to deal with discrete and continuous features. The extension, C-FOCUS, is verified on an artificial geometric figure classification problem and a real world classification problem.
[1] Igor Kononenko,et al. Estimating Attributes: Analysis and Extensions of RELIEF , 1994, ECML.
[2] Thomas G. Dietterich,et al. Learning Boolean Concepts in the Presence of Many Irrelevant Features , 1994, Artif. Intell..
[3] Huan Liu,et al. Feature Selection for Classification , 1997, Intell. Data Anal..
[4] Ron Kohavi,et al. Irrelevant Features and the Subset Selection Problem , 1994, ICML.
[5] Ron Kohavi,et al. Wrappers for Feature Subset Selection , 1997, Artif. Intell..