Applications of Approximate Reducts to the Feature Selection Problem
In this paper we overview two feature rankings methods that utilize basic notions from the rough set theory, such as the idea of the decision reducts. We also propose a new algorithm, called Rough Attribute Ranker. In our approach, the usefulness of features is measured by their impact on quality of the reducts that contain them. We experimentally compare the reduct-based methods with several classic attribute rankers using synthetic, as well as real-life high dimensional datasets.
Keywordsattribute filtering feature selection approximate reducts
Unable to display preview. Download preview PDF.
- 3.John, G.H., Kohavi, R., Pfleger, K.: Irrelevant Features and the Subset Selection Problem. In: International Conference on Machine Learning, pp. 121–129 (1994)Google Scholar
- 8.Ślęzak, D.: Rough sets and functional dependencies in data: Foundations of association reducts. In: Gavrilova, M., Tan, C., Wang, Y., Chan, K. (eds.) Transactions on Computational Science V. LNCS, vol. 5540, pp. 182–205. Springer, Heidelberg (2009)Google Scholar
- 10.Janusz, A.: Utilization of dynamic reducts to improve performance of the rule-based similarity model for highly-dimensional data. In: Proceedings of the WI/IAT Workshops. IEEE Computer Society, Los Alamitos (2010)Google Scholar