Analysis on Classification Performance of Rough Set Based Reducts
Feature subset selection and data reduction is a fundamental and most explored area in machine learning and data mining. Rough set theory has been witnessed great success in attribute reduction. A series of reduction algorithms were constructed for all kinds of applications based on rough set models. There is usually more than one reduct for some real world data sets. It is not very clear which one or which subset of the reducts should be selected for learning. Neither experimental comparison nor theoretic analysis was reported so far. In this paper, we will review the proposed attribute reduction algorithms and reduction selection strategies. Then a series of numeric experiments are presented. The results show that, statistically speaking, the classification systems trained with the reduct with the least features get the best generalization power in terms of single classifiers. Furthermore, Good performance is observed from combining the classifiers constructed with multiple reducts compared with Bagging and random subspace ensembles.
KeywordsClassification Performance Decision Table Feature Subset Selection Random Subspace Ensemble System
Unable to display preview. Download preview PDF.
- 1.Kim, D., Bang, S.Y.: A handwritten numeral character classification using tolerant rough set. IEEE transactions on PAMI 22, 923–937 (2000)Google Scholar
- 8.Dubois, D., Prade, H.: Putting fuzzy sets and rough sets together. In: Slowiniski, R. (ed.) Intelligent Decision support, pp. 203–232. Kluwer Academic, Dordrecht (1992)Google Scholar
- 17.Skowron, R., Rauszer, C.: The discernibility matrices and functions in information systems. Intelligent ecision Support: Handbook of Applications and Advances of Rough Set Theory, 331–362 (1991)Google Scholar
- 21.Bazan, J.G., Skowron, A., Synak, P.: Dynamic reducts as a tool for extracting laws from decision tables. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 346–355. Springer, Heidelberg (1994)Google Scholar
- 22.Wroblewski, J.: Finding minimal reducts using genetic algorithms. In: Proc. Second International Joint Conference on Information Sciences, September 1995, pp. 186–189 (1995)Google Scholar
- 23.Jensen, R., Shen, Q.: Fuzzy-rough sets for descriptive dimensionality reduction. In: FUZZ-IEEE 2002, vol. 1(12–17), pp. 29–34 (2002)Google Scholar
- 30.Hu, X.: knowledge discovery in database: an attribute-oriented rough set method. Ph.D. Thesis. University of Regina (1995)Google Scholar
- 31.Slezak, D.: Approximate decision reducts. Ph.D. Thesis. Warsaw University (2001)Google Scholar
- 35.Skowron, R., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent decision support—Handbook of applications and advances of the rough sets theory, pp. 331–362 (1991)Google Scholar
- 36.Hu, X.: Using rough set theory and database operations to construct a good ensemble of classifiers for data mining applications. In: ICDM., pp. 233–240 (2001)Google Scholar