But it is a NP-Hard problem to get the minimal attribute reduction.
但求取任意问题的最小属性集是一个NP难问题。
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.
首先介绍了决策表、广义信息表的构造及特点，然后给出了求决策表的最小属性约简及最小决策算法的计算方法。
Through improving and extending the process of computing core, the minimal reduction algorithm based on attribute frequency heuristic information are put forward.
对分辨矩阵求核过程进行改进与扩展，给出了一种以属性频度作为启发式信息计算最小约简快速完备方法。
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.
以粗糙逻辑为基础，首先给出了在新实例加入论域后判断约简变化与否以及判断原极小决策算法中决策规则变化与否的判定依据。
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.
以粗糙逻辑为基础，首先给出了在新实例加入论域后判断约简变化与否以及判断原极小决策算法中决策规则变化与否的判定依据。
应用推荐