主要用于求解决策表中的相对属性约简。
后面又提到了基于信息熵的相对属性约简算法。
And then a relative attribute reduction algorithm is mentioned based on information entropy.
在定义的基础上，给出了基于二进制区分矩阵的求核算法、相对属性约简算法及值约简算法。
Based on the definitions, the core finding algorithm, the relative attribute reduction algorithm and value reduction of information decision system are presented based on binary discernibility matrix.
通过粗糙规则集的不确定性量度，应用遗传算法求取相对属性约简，然后根据所给阈值导出粗糙规则集，并对阈值对规则集的影响进行了事后分析。
With uncertain measurement of rough rules set, relative attribute reduction is obtained by applying GA, and then rough rules set is deduced under the threshold values.
以原始条件属性集为起点并结合算子，通过向属性核的递减式逼近，得到属性的最小相对约简。
Acquiring optimal relative reduction by descending approach to core of attribute from original set of conditional attribute and combining with operator.
提出了一种基于决策属性支持度的属性相对约简算法。
A kind of attribute relative reduction for decision attribute support degree was proposed.
提出了一种基于模糊决策属性依赖度的属性相对约简算法。
A kind of attribute relative reduction for fuzzy decision attribute dependent degree is proposed.
利用概念格的属性约简方法，进行了属性的约简处理，得出用于故障诊断的核心属性、相对必要属性和不必要属性。
The data are reduced using the concept lattice attribute reduction method, and thus the core attributes, relative necessary attributes and unnecessary attributes for fault diagnosis are obtained.
特别的，得到了决策属性只取两个决策值的决策表，其广义决策约简同相对约简是等价的。
In particular, a decision table in which the decision attribute has only two values is obtained, and its generalized reduction and relative reduction are equivalent.
该算法不仅为相对约简格的构造提供了一种方法，还解决了在已构造好相对约简格的前提下，增加属性所带来的更新问题。
It provides an approach for building relative reduced concept lattice and resolves the problem of lattice update caused by appending new attributes into an existing context of the lattice.
该算法不仅为相对约简格的构造提供了一种方法，还解决了在已构造好相对约简格的前提下，增加属性所带来的更新问题。
It provides an approach for building relative reduced concept lattice and resolves the problem of lattice update caused by appending new attributes into an existing context of the lattice.
应用推荐