frequent subtree
基本解释
- [计算机科学技术]频繁子树
英汉例句
- So what is the most frequent subtree sum value?
如果存在多个次数一样的子树和，则全部返回。
bookshadow.com - Given the root of a tree, you are asked to find the most frequent subtree sum.
给定一棵二叉树，求其最频繁子树和。
bookshadow.com - A frequent embedded subtree mining algorithm based on discrete interval, called DIFTM algorithm, was presented by using discrete interval to construct project database.
针对频繁嵌入式子树挖掘，利用离散区间来构造投影库，给出一种基于离散区间的频繁嵌入式子树挖掘算法。
双语例句
词组短语
- frequent Induced subtree 频繁Induced子树
- Frequent embedded subtree 频繁嵌入式子树
- closed frequent induced subtree 闭合频繁Induced子树
- the maximal frequent induced subtree 最大频繁induced子树
- frequent subtree mining 频繁子树挖掘
短语
专业释义
- 频繁子树
Frequent substructure explore the intrinsic characteristics of the data and are relatively stable to database updates. Discriminative, frequent subtree_based indexing can improve dramatically the performance of subtree search.
频繁子结构能揭示数据的内在特性,对于数据库修改也很稳定,用有判别力的频繁子树为树数据库构造索引,能显著地提高子树查询的性能。