Rough-Set-Inspired Feature Subset Selection, Classifier Construction, and Rule Aggregation
We consider a rough-set-inspired framework for deriving feature subset ensembles from data. Each of feature subsets yields a single classifier, basically by generating its corresponding if-then decision rules from the training data. Feature subsets are extracted according to a simple randomized algorithm, following the filter (rather than wrapper or embedded) methodology. Classifier ensemble is built from single classifiers by defining aggregation laws on top of decision rules. We investigate whether rough-set-inspired methods can help in the steps of formulating feature subset optimization criteria, feature subset search heuristics, and the strategies of voting among classifiers. Comparing to our previous research, we pay a special attention to synchronization of the filter-based criteria for feature subset selection and extraction of rules basing on the obtained feature subsets. The overall framework is not supposed to produce the best-ever classification results, unless it is extended by some additional techniques known from the literature. Our major goal is to illustrate in a possibly simplistic way some general interactions between the above-mentioned criteria.
KeywordsFeature Subset Selection Classifier Ensembles Rough Sets
Unable to display preview. Download preview PDF.
- 1.Bazan, J.G., Nguyen, H.S., Nguyen, S.H., Synak, P., Wróblewski, J.: Rough Set Algorithms in Classification Problem. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) New Developments in Knowledge Discovery in Information Systems, pp. 49–88. Physica Verlag, Heidelberg (2000)Google Scholar
- 2.Frank, A., Asuncion, A.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2010)Google Scholar
- 4.Grzymała-Busse, J.W., Ziarko, W.: Data mining based on rough sets. In: Wang, J. (ed.) Data Mining Opportunities and Challenges, pp. 142–173. IGI Publishing (2003)Google Scholar
- 6.Liu, H., Motoda, H. (eds.): Computational Methods of Feature Selection. Chapman & Hall/CRC, Boca Raton (2008)Google Scholar
- 10.Ślęzak, D., Widz, S.: Evolutionary Inspired Optimization of Feature Subset Ensembles. In: Proc. of NaBIC, pp. 444–449 (2010)Google Scholar
- 12.Wróblewski, J.: Genetic Algorithms in Decomposition and Classification Problems. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, vol. 2, pp. 471–487. Physica-Verlag, Heidelberg (1998)Google Scholar