An incremental rule extracting algorithm based on Pawlak reduction

Although the rough set theory first introduced by Z. Pawlak in 1982, is a kind of very useful mathematical tools to deal with vagueness, uncertainty, and imprecision information, it is relatively difficult to apply it to the analysis of incremental data sets. In this paper, a novel rule-extracting algorithm from incremental data sets based on the Pawlak reduction (also called independence reduction) is proposed. The main idea, description, analysis, and proof about this algorithm are discussed in details. Finally, an example is presented to illustrate the main characteristics of this new incremental algorithm.