Information-based algorithm for reduction of knowledge
Miao Duoqian, Jue Wang · 2002
In Rough Set (RS) theory, it has been proved that finding the minimal reduct of an information system is an NP-complete problem. Because of this, it is hard to obtain the set of the most concise rules by existing algorithm in RS for reduction of knowledge. In this paper, an information-based algorithm for reduction of knowledge is proposed, and its time complexity is analyzed. Through an example, we show that the proposed algorithm is effective for dealing with relatively large-scale databases.