CSDL Home IEEE Transactions on Knowledge & Data Engineering 1997 vol.9 Issue No.05 - September-October
Issue No.05 - September-October (1997 vol.9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.634751
<p><b>Abstract</b>—Deriving classification rules or decision trees from examples is an important problem. When there are too many features, discarding weak features before the derivation process is highly desirable. When there are numeric features, they need to be discretized for the rule generation. We present a new approach to these problems. Traditional techniques make use of feature merits based on either the information theoretic, or the statistical correlation between each feature and the class. We instead assign merits to features by finding each feature's "obligation" to the class discrimination in the context of other features. The merits are then used to rank the features, select a feature subset, and discretize the numeric variables. Experience with benchmark example sets demonstrates that the new approach is a powerful alternative to the traditional methods. This paper concludes by posing some new technical issues that arise from this approach.</p>
Feature analysis, classification modeling, discretization, feature merit, feature selection.
Se June Hong, "Use of Contextual Information for Feature Ranking and Discretization", IEEE Transactions on Knowledge & Data Engineering, vol.9, no. 5, pp. 718-730, September-October 1997, doi:10.1109/69.634751