1) minimum attribute reduction
最小属性约简
1.
By analyzing the characteristics of incomplete information system and the definition of similar relation, and constructing the related matrix of incomplete information system, the minimum attribute reduction problem was related to the minimum set covering problem.
深入分析了不完备信息系统的特点以及相似关系的定义,通过构造不完备信息系统的相关矩阵,把不完备信息系统的最小属性约简问题与最小集合覆盖问题联系起来,将不完备信息系统的最小属性约简问题转化为最小集合覆盖问题,给出了基于集合覆盖的不完备信息系统最小属性约简算法。
2) minimal attribute reduction
最小属性约简
1.
Based on that,a minimal attribute reduction algorithm based on the knowledge granulation was proposed.
针对目前决策表属性约简的计算问题,研究了粗糙集理论中差别矩阵,讨论了知识粒度与信息量、类别特征矩阵之间的关系,利用知识粒度最大的属性生成较小的类别特征矩阵,设计了新的启发式规则来快速缩小搜索空间和最小化属性选择,提出了一个基于知识粒度的最小属性约简算法,并用一个实例证明了算法的正确性。
3) minimal reduction
最小约简
1.
Through improving and extending the process of computing core,the minimal reduction algorithm based on attribute frequency heuristic information are put forward.
对分辨矩阵求核过程进行改进与扩展,给出了一种以属性频度作为启发式信息计算最小约简快速完备方法。
2.
Attribute reduction is the most important research field in rough set, but the time complexity of computing all reductions and minimal reduction is exponential.
属性约简是粗糙集理论重要研究内容之一,然而求取所有约简与最小约简的时间复杂度为指数级,在大量或海量数据分析时,算法的可行性将面临巨大挑战。
4) minimum reduction
最小约简
1.
A method is given for sovling the problem of minimum reduction by using GA (genetic algorithm),based on rough sets and the extended matrix theory.
基于粗集理论和扩张矩阵理论 ,提出了一种利用遗传算法求解最小约简的方法。
5) attribute reduction
属性约简
1.
A attribute reduction algorithm based on attribute dependence;
一种基于属性依赖的属性约简算法
2.
An efficient attribute reduction algorithm by modificatory discernibility matrix;
基于修正差别矩阵的高效属性约简算法
3.
An attribute reduction algorithm of rough set based on discernable matrix;
粗糙集属性约简的完备算法
6) Reduction of Attributes
属性约简
1.
A Study of Reduction of Attributes and Set Covering Problem;
关于属性约简和集合覆盖问题的探讨
2.
An Algorithm to Choose the Reduction of Attributes in Decision Analysis;
决策分析中属性约简的择优算法
3.
With the discernibility degree as heuristic information,a heuristic algorithm based on discernibility degree for reduction of attributes is presented,and the time complexity of this algorithm is analyzed.
属性约简是粗糙集理论研究中的核心内容之一,现已证明寻找最小约简是NP-hard问题。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条