片语

discernibility matrix差别矩阵

distinguishability[光] 分辨率；可区别性

Discernibility Relation区分关系

resolution factor分辨率

discernibility region差别区域

discernibility matrixes辨识矩阵

Discernibility matrices差别矩阵

Discernibility quality区分精度

discernibility set差别集

discernibility function分辨函数

discernibility property分辨特性

英汉例句

• a novel method of attribute reduction in formal context lattices is proposed by employing the discernibility attribute set of the basic units of extents.

  利用外延基本元构造了一种新的可辨识属性矩阵，并由此提供了形式背景属性约简的一种新的判定方法。

• in this paper, application about discernibility matrix arithmetic and horafa arithmetic based on the rough set theory is introduced.

  简要介绍了粗糙集理论中区分矩阵算法和horafa算法在知识约简中的应用。

• by the research of data mining rough set reduct, the author propounded a data dividing thought based on the discernibility ability of index.

  通过对数据挖掘粗糙集约简算法的研究，提出一种基于区分能力指数的信息系统数据划分思想。

• the key fault attributes is definition by reduction information based on discernibility matrix.

  采用区分矩阵对信息进行约简，确定关键故障征兆；

• in order to overcome the problem, a new method of data discretization based on candidate cuts discernibility matrix is presented.

  针对这一问题，提出了一种基于候选断点区分矩阵的数据离散化算法。

• heuristic knowledge reduction approach based on discernibility matrix and strong compressible set is proposed.

  提出了基于区分矩阵与强等价集的启发式知识约简方法。

• an extracting rules algorithm based on class feature matrix is presented, which has made use of the characteristic of discernibility matrix.

  充分考虑了可辨识矩阵的特性，提出一种基于类别特征矩阵的决策规则提取算法。

• aiming at the problem of equivalent conversion from conjunctive normal form to disjunctive normal form, an effective algorithm was proposed to construct reduction tree based on discernibility matrix.

  针对差别矩阵求约简过程中合取范式向析取范式等价转换的难题，提出一种基于差别矩阵构造约简树的有效方法。

• it proposes two data reduction models based on discernibility matrix and data analysis separately, improves the discernibility matrix algorithm and made the comparison between the two models.

  提出了基于分辨矩阵和数据分析的两种数据约简模型，并对分辨矩阵算法做了改进，最后对这两种模型进行了比较。

• both of attribute weight frequency and strong compressible set are used to simplify discernibility matrix so that computing complexity is decreased and reduction efficiency is increased.

  同时利用属性加权频率和强等价集概念化简区分矩阵，既减小了计算复杂度又提高了约简效率。

• the space-time performance of this method was superior to discernibility matrix′s.

  研究表明，依赖度法的时空性能比分辨矩阵法更加优越。

• an algorithm of compute core is provided. an example illustrates that the elements of discernibility matrix in this algorithm reduce and the efficiency of computing core is improved.

  在此基础上给出一个求核算法，通过实例证明，由于减少了差别矩阵中的元素，因此算法的求核效率得到较大提高。

• to choose comprehensive evaluation method among many methods, this paper provides discernibility matrix model of multi comprehensive evaluation methods.

  并且，为了解决多种综合评价方法的选择问题，建立了多种综合评价方法选择的分辨矩阵模型。

• in this paper, a construction method of discernibility matrix for both consistent information systems and inconsistent information systems is presented.

  提出了一种适于相容和不相容两种形式信息系统差别矩阵的统一构造方法，证明了用该差别矩阵求核的正确性。

• subsequently, to heuristically measure the relative importance of candidate cuts, relevant metrics are studied based on 「cut discernibility matrix」.

  其次，论文研究了通过「断点分辨矩阵」来度量候选断点重要性的启发式方式。

• compared with discernibility matrix algorithm, this algorithm greatly reduces running time and memory space.

  相对于区分矩阵算法，该算法在时间和存储空间花费上都有较大的改善和提高。

• it corresponds approximately to freud's superego and is the ground for discernibility and difference.

  它大约相当于弗洛伊德「超我」的概念，而且是区分和分化的前提。

• 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.

  在定义的基础上，给出了基于二进制区分矩阵的求核算法、相对属性约简算法及值约简算法。

• secondly, we investigate the method of discernibility matrix and function.

  其次，我们对差别矩阵差别函数的方法进行了研究。

• the judgment theorem and discernibility matrix with respect to consistent ordered assignment set is obtained.

  通过定义分配序区分矩阵给出求分配序约简的区分矩阵法。

• the data processing time-consumed by discernibility of matrix is predicted, and the feasibility of data mining experiment is forecasted.

  推算可预知分辨矩阵法处理数据所消耗的时间，对数据挖掘实验的可行性进行预测。

• secondly, it introduces an improved algorithm which revises the discernibility relation of similarity sets on the basis of the discernibility matrix of distribution reduction.

  接着对分布约简的可辨识矩阵中等价类的区分关系进行改进，提出一种新的近似约简算法。

• in the improved algorithm in this paper, using frequency as the heuristic information of attributes selection, getting frequency of attributes from the filtered discernibility matrix.

  论文的改进算法以属性的频率作为选择属性的启发信息，由过滤差别矩阵得到属性的频率。

• both of attribute weight frequency and strong compressible set are used to simplify discernibility matrix so that computing complexity is decreased and reduction efficiency is.

  同时利用属性加权频率和强等价集概念化简区分矩阵，既减小了计算复杂度又提高了约简效率。

• the paper puts forward a method of discretization of continuous properties based on discernibility matrix and revises the discrete result by average mutual information.

  本文基于可辨识矩阵提出一种连续属性离散化的方法，并利用平均互信息量对离散化结果进行修正。

• at the second part of the thesis, an algorithm of attribute reduction based on binary discernibility matrix is presented.

  其次提出了一种基于二进制差别矩阵的属性约简算法；