Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Variable Precision Rough Sets with Asymmetric Bounds
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Input feature selection for classification problems
IEEE Transactions on Neural Networks
Feature subset selection wrapper based on mutual information and rough sets
Expert Systems with Applications: An International Journal
Self-taught dimensionality reduction on the high-dimensional small-sized data
Pattern Recognition
Hi-index | 0.00 |
Mutual Information (MI) is a good selector of relevance between input and output feature and have been used as a measure for ranking features in several feature selection methods. Theses methods cannot estimate optimal feature subsets by themselves, but depend on user defined performance. In this paper, we propose estimation of optimal feature subsets by using rough sets to determine candidate feature subset which receives from MI feature selector. The experiment shows that we can correct nonlinear problems and problems in situation of two or more combined features are dominant features, maintain an improve classification accuracy.