1) secondary core attribute
次核属性
2) attribute hierarchy
属性层次
1.
This paper proposes rule state concept and applies it to analyze several categories of rule conflict caused by attribute hierarchy.
文中利用规则状态思想描述分析了属性层次操作关联带来的多种冲突类型,在资源语义树策略索引基础上利用状态相关性给出规则冲突检测算法;利用状态覆盖思想分析造成规则冗余的原因,给出在不同规则评估合并算法下的冗余判定定理。
3) core attribute
核属性
1.
Distributed calculation methods for core attributes of decision table;
一种分布式的决策表核属性计算方法
2.
The degree of subdivision of the decision attribute value directly influences upon the approximation quality of rules,accuracy of approximation classification,core attributes and information entropy in decision systems based on rough set theory.
对基于粗糙集的决策系统,从理论上分析了决策数据细化的程度对规则近似质量、近似分类精度、核属性和信息熵的影响。
3.
The problem of calculating the core attributes of a decision table is studied.
针对决策表属性的计算问题,对前人的一些理论观点进行讨论,并提出了基于向量的求核算法,分析了该方法下核属性计算的时空复杂度,并与辨识矩阵等方法进行了比较。
4) attribute core
属性核
1.
Algorithm of computing attribute core based on divide and conquer method;
基于分治法的属性核计算方法
2.
The determination of attribute core may be significantly contributory to attribute reduction.
属性核的确定对于求属性约简具有重要的意义,利用协调信息系统中条件属性的划分相对于决策属性划分的概率分布为单点分布的性质,提出一种新的求核算法。
3.
Since the attribute core is the intersection of all the reducts,many current reduction algorithm of the attributes originate from it,in which one has to make use of the heuristic information(the quantity of relative information,the relative significance) to add the more important attributes to the attribute core step by step until work out a reduct of the original information system.
在粗糙集理论中对信息系统的属性集进行约简是一个重要的课题,属性核是所有约简的交集,从而现行的许多属性约简算法,都是以属性核为起点,利用启发式信息(如相对信息量,相对重要性等)逐步对属性核中添加相对最重要的属性,直到得到原信息系统的一个约简为止,论文提出了一种新的计算属性核的算法,该算法避免了传统算法中重复计算等价矩阵交运算次数多的缺点,降低了常规算法的时间复杂度。
5) attribute core
核属性
1.
The attribute core of a decision table is often the start point and key of many decision information system reduction procedures based on rough set theory.
决策表是Rough集理论的处理对象,其核属性的计算往往是信息约简过程的出发点和关键。
6) core attributes
核属性
1.
On this basis,an improved attribute reduction algorithm based on binary discernibility matrix,which uses the core attributes as the initial reduction sets and the attribute frequency as the heuristic information,is presented,and one of the op.
在此基础上,以核属性为初始约简集,以属性频率为启发式信息,提出了一种改进的基于二进制可分辨矩阵的属性约简算法,其最终可以获得一个最优约简,并且算法时间复杂度和空间复杂度分别为max{O(|C||U|),O(|C|2|U’|2)}和O(|C||U’|2)。
补充资料：核爆炸次声波探测(见核爆炸探测)
核爆炸次声波探测(见核爆炸探测)
nuclear explosion infrasound detection
hebaozha eishengbo tanee核爆炸次声波探测(nueleaf。xplosi。。infrasound deteetion)见核爆炸探坝lJ。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条