A Further Study On Simplification Of Decision Tables

Rough-set-based-method to simplify a decision table is of great importance. In this paper, firstly, a deep discussion on the method is made, and an algorithm for computing all reducts of every decision rule in a decision table is proposed and performed. Secondly, three optimal problems of the minimal algorithms of a decision table are investigated and their NP-hard nature is proved, and three heuristic algorithms for the three optimal problems are presented and performed. Thirdly, an investigation to probabilistic characters of the minimal algorithms is made.