Consistency-based search in feature selection

作者:

摘要

Feature selection is an effective technique in dealing with dimensionality reduction. For classification, it is used to find an “optimal” subset of relevant features such that the overall accuracy of classification is increased while the data size is reduced and the comprehensibility is improved. Feature selection methods contain two important aspects: evaluation of a candidate feature subset and search through the feature space. Existing algorithms adopt various measures to evaluate the goodness of feature subsets. This work focuses on inconsistency measure according to which a feature subset is inconsistent if there exist at least two instances with same feature values but with different class labels. We compare inconsistency measure with other measures and study different search strategies such as exhaustive, complete, heuristic and random search, that can be applied to this measure. We conduct an empirical study to examine the pros and cons of these search methods, give some guidelines on choosing a search method, and compare the classifier error rates before and after feature selection.

论文关键词:Classification,Feature selection,Evaluation measures,Search strategies,Random search,Branch and bound

论文评审过程:Received 7 March 2002, Revised 27 March 2003, Available online 28 June 2003.

论文官网地址:https://doi.org/10.1016/S0004-3702(03)00079-1