Variable precision reduction (VPR) and positive region reduction (PRR) are common definitions in attribute reduction. The compacted decision table is an extension of a decision table. In this paper, we propose another extension, called the weighted decision table. In both types of decision tables, VPR is defined, and the corresponding discernibility matrices for the PRR are proposed. Then, algorithms for obtaining the PRR from the discernibility matrices are presented. In both types of decision tables, the relationship between VPR and PRR is established by comparing the corresponding discernibility matrices. If the precision of the VPR meets the given conditions, then the PRR algorithms can be used to obtain the results after modifying some decision values in the decision tables. An analysis of the modification process of the decision values and the compression process of decision tables is used to propose a new algorithm for VPR in decision tables that ensures credibility. The effectiveness of the proposed algorithm was evaluated by an experimental comparison with existing VPR algorithms.
INDEX TERMSVariable precision reduction, positive region reduction, decision table, compacted decision table, weighted decision table.