Abstract:

A hierarchical reduction algorithm is proposed to reduce a huge information system. Based on detailed studies on the certain increment operator, a series of theorems are derived, which form a theoretic basis for the hierarchical reduction algorithm. The hierarchical reduction algorithms are then presented for both the information system with and without core attributes. Validity of the algorithms is shown with an example.

Key words:

core, hierarchical reduction, rough set, huge information system, certain increment operator