On Scalability of Rough Set Methods

Abstract

This paper presents some recent results of the research on the scalability of rough set based classification methods. The proposed solution is based on the close relationship between reduct calculation problem in rough set theory and association rule generation problem. This is a continuation of our previous results (see, e.g. [10] [11]). In this paper, the set of decision rules satisfying the test object is generated directly from the training data set. To make it scalable, we adopted the idea of the FP-growth algorithm for frequent item-sets [7], [6]. The experimental results on some benchmark data sets are showing the ability of the proposed solution to process a growing data sets. © Springer-Verlag Berlin Heidelberg 2010.