Reduction for decision table based on relative knowledge granularity

The knowledge granularity was mainly used for attribute reduction in information systems.In order to expand the knowledge granularity to the field of decision table,the relative knowledge granularity was defined based on knowledge granularity.The equivalence between the Pawlak algebraic representation and relative granularity representation was proved for a consistent decision table.Based on the definition of relative knowledge granularity,the attribute significance was defined,and two heuristic reduction algorithms for decision table were proposed.Theoretical analysis and the actual example study showed that the reduction algorithms were efficient and feasible.