reduct造句
例句与造句
- discernibility system can be used to unify the problems of computing reduct set in information system and computing relative reduct set in decision table
区分系统的缩减集计算统一了粗糙集合理论中信息系统的缩减集的计算问题和决策表的相对缩减集的计算问题 - discernibility system can be used to unify the problems of computing reduct set in information system and computing relative reduct set in decision table
区分系统的缩减集计算统一了粗糙集合理论中信息系统的缩减集的计算问题和决策表的相对缩减集的计算问题 - at last an entropy based attribute reduct algorithm is proposed . it is used to the attribute reduct of iris and hsv database, and the ideal results can be achieved
并提出一种基于熵测量的属性简约算法，将其用于iris数据库和hsv数据库的属性简约，得到了理想的结果。 - at last an entropy based attribute reduct algorithm is proposed . it is used to the attribute reduct of iris and hsv database, and the ideal results can be achieved
并提出一种基于熵测量的属性简约算法，将其用于iris数据库和hsv数据库的属性简约，得到了理想的结果。 - firstly a reduct is derived for each class of data, and then for each class a discernibility matrix and a merger matrix are constructed and rules for this class are extracted based on the two matrices
首先获得每类数据的属性约简；然后为每类数据构造一个分辨矩阵和一个合并矩阵,通过两个矩阵的交互作用逐类抽取规则。 - It's difficult to find reduct in a sentence. 用reduct造句挺难的
- the indiscernibility lattice corresponding to indiscernibility context can be used to computing the reduct set of any subset of attributes in information system, and thus can serve as a framework for discovering
而不可区分背景所对应的不可区分格则可以用于信息系统中任意属性子集的缩减集计算，于是它可以用作一个框架结构来发现关系数据中所成立的函数依赖关系 - one view of finding a personalized solution of reduct in an information system is grounded on the viewpoint that attribute order can serve as a kind of semantic representation of user requirements
由于该算法对reduct完备且其输出对给定的属性序唯一，因此，可以看作是由属性序集合到reduct集合的一个映射。由于不同的属性序可以对应相同的reduct，这个映射不是一一的。 - through the study in the data reduction, this paper presents a new reduction algorithm named horafa-svdm and an incremental algorithm of the heuristic optimal reduct finding algorithm of the frequencies function named horafa ? a
本文通过在数据约简方面的研究，提出了对利用属性频率函数的启发式约简算法的改进算法??horafa?svdm算法，以及这个算法的增量版本??horafa?ia算法。 - the theses define the significance of attribute based on the dependence of attribute, act it as heuristic information, and picture the structure of algorithm, realize it by visual basic . the validity of this reduct algorithm is proved by test system
在属性依赖性的基础上，定义了属性重要性，以此作为算法的启发式信息，并对算法的结构进行描述，用visualbasic语言加以实现，实例验证了这种算法的有效性。 - the second attribute theorem describes the relationship between the set of attribute orders and the set of reducts, and can be used to transform the problem of searching solutions to meet user requirements into the problem of modifying reduct based on a given attribute order
次属性定理不仅描述了属性序集合与reduct集合之间的关系，而且可以用于把搜索满足用户需求解的问题转化为基于给定属性序直接修正reduct的问题。 - in this thesis, we research some problems based on rough set theory in the information system . our working is shown as follows : 1 ) propose the algorithm and improved algorithm of minimal reduct . 2 ) give the minimal cost reduct algorithm
根据粗糙集基本理论中的约简的概念，给出了一种寻求最小约简的算法，然后通过对此算法的进一步研究，找到了该算法的不足，并提出相应的改进策略，给出了最小约简改进算法，最后对上述两种算法作出了比较；2 - in this thesis, we research some problems based on rough set theory in the information system . our working is shown as follows : 1 ) propose the algorithm and improved algorithm of minimal reduct . 2 ) give the minimal cost reduct algorithm
根据粗糙集基本理论中的约简的概念，给出了一种寻求最小约简的算法，然后通过对此算法的进一步研究，找到了该算法的不足，并提出相应的改进策略，给出了最小约简改进算法，最后对上述两种算法作出了比较；2 - the relativities, not only between the selecting attributes and selected ones, but also among the unselected attributes, should be considered . this strategy is helpful to compute the minimal reduct . fourthly, the decision rules are classified into three parts : one-one, one-multi and multi-one
本文对其原因进行分析，并提出一种局部回溯的策略，不但考虑了所选属性和已入选属性集之间的相关性，而且对未入选属性集之间的相关性也加以考虑。 - first a decision table is constructed by collecting original mib data from networks, then from the point of view of attribute significance and attribute frequency, we propose a heuristic rough set reduct algorithm using significance and frequency . based on attribute core and user preference attribute set, the algorithm not only makes use of advantage of these two algorithm, but also the universality of core, and user background knowledge, domain experience
在深入的研究基于粗集的数据挖掘算法的基础上，从属性的重要性和频度两个角度出发得出了一种结合二者的启发式约简算法，该算法以核和用户偏好属性集为约简的基础，再结合二者优点的同时不仅利用了核的广泛性，而且又能有效的利用用户的背景知识或领域知识和经验。 - 3 ) give the reduct algorithm and improved algorithm based on discernibility matrices . 4 ) give the algorithm of rules . 5 ) in this thesis, by using rs theory in the synthesis of combinational logic function, we can get minimal expression of logic function; if by using rs theory in the rough control of boiler, we can get rough control rules
对于前人提出的差别矩阵和差别函数的概念和定义，将其应用于信息系统中，用差别函数得到了最小约简，然后，通过研究差别矩阵和差别函数的构造过程，提出了对差别矩阵降阶和消元的策略，实例证明是有效的，起到了化简差别矩阵和差别函数的目的；4
