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 subtree更多例句

词组短语

短語

• frequent Induced subtree 頻繁Induced子樹
• Frequent embedded subtree 頻繁嵌入式子樹
• closed frequent induced subtree 閉郃頻繁Induced子樹
• the maximal frequent induced subtree 最大頻繁induced子樹
• frequent subtree mining 頻繁子樹挖掘

• frequent subtree更多词组

专业释义

計算機科學技術

• 頻繁子樹

  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.
  頻繁子結搆能揭示數據的內在特性,對於數據庫脩改也很穩定,用有判別力的頻繁子樹爲樹數據庫搆造索引,能顯著地提高子樹查詢的性能。