Research Of Attribute Reduction Algorithm Based On Rough Set Theory

In this paper the attribute reduction algorithms is researched. An efficient genetic reduction algorithm based on rough set theory is proposed; the shortest reduction of information system can be calculated speedly by using the algorithm. Then, Another attribute reduction algorithm based on partition is proposed by dividing original system into subsystems, the relation of original system and subsytems are analyzed, then completeness of the algorithm is proved. Finally, A smallest reduction construction experiment is conducted and the results show that the two algorithms are efficient in practice.