Title of article
Consistency-based search in feature selection Original Research Article
Author/Authors
Manoranjan Dash، نويسنده , , Huan Liu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
22
From page
155
To page
176
Abstract
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.
Keywords
Evaluation measures , Search strategies , Random search , Feature selection , classification , Branch and Bound
Journal title
Artificial Intelligence
Serial Year
2003
Journal title
Artificial Intelligence
Record number
1207314
Link To Document