1) constrained sub-tree
被约束子树
1.
Because in process of mining only generate constrained sub-trees consisting of three small arrays,which is pseudo tree structure based on the originally unidirectional FP-tree,the flaw is avoided in former algorithms which need to generate lots of condi.
该算法在挖掘过程中只生成被约束子树,而它是一种虚拟的树结构,在原有的单向FP-tree基础上用三个很小的数组来表示,因而避免了以往算法需递归构造条件FP-tree来计算频繁闭项集的弊端,极大地降低了内存空间和时间开销,提高了挖掘效率。
2) constrained sub-tree
约束子树
1.
The improved FP-tree structure is adopted and the global frequent itemsets are mined by transmitting constrained sub-tree.
该算法主要采用改进了的FP树结构,通过传送被约束子树来挖掘全局频繁项目集,并充分利用快速分布式挖掘算法建立的各局部FP树,只对新增加了的全局频繁项目修改相应的改进FP树,挖掘其对应的被约束子树,同时利用已挖掘的全局频繁项目集对原全局频繁项目对应的被约束子树进行有效修剪。
3) In-tree constraint
入树约束
4) Constraint Tree
约束树
1.
A Syllabification Algorithm Based on Constraint Tree in English Speech Synthesis;
英语语音合成中基于约束树的音节切分算法
5) tree-order
树序约束
1.
A comparison of restricted and unrestricted estimators in estimating linear functions of scale parameters from three Gamma distributions under the tree-order restriction;
三个Gamma分布尺度参数的线性函数在无约束和树序约束下估计量的比较
6) Tree-restricted
树约束
1.
Single Machine Scheduling with Tree-restricted and Linear Processing;
线性加工时间的树约束单机排序问题
补充资料：被褡子
同‘背搭子’。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条