Based on rough logic, theorems is presented, whether attribute reduction and minimal decision algorithm change or not when a new instance is added to the universe.

以粗糙逻辑为基础，首先给出了在新实例加入论域后判断约简变化与否以及判断原极小决策算法中决策规则变化与否的判定依据。

youdao

An example shows this algorithm can achieve the minimal relative reduction of incomplete decision table.

通过实例说明，该算法能得到不完备决策表的最小相对约简。

youdao

Then, according to the features of the generalized information table, the algorithms of acquiring minimal attribute reduction, attribute value reduction and minimum decision algorithm are put forward.

首先介绍了决策表、广义信息表的构造及特点，然后给出了求决策表的最小属性约简及最小决策算法的计算方法。

youdao

Then, according to the features of the generalized information table, the algorithms of acquiring minimal attribute reduction, attribute value reduction and minimum decision algorithm are put forward.

首先介绍了决策表、广义信息表的构造及特点，然后给出了求决策表的最小属性约简及最小决策算法的计算方法。

youdao