frequent subtree

基本解釋

• [計(jì)算機(jī)科學(xué)技術(shù)]頻繁子樹

英漢例句

雙語(yǔ)例句

• So what is the most frequent subtree sum value?
  如果存在多個(gè)次數(shù)一樣的子樹和，則全部返回。
  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.
  針對(duì)頻繁嵌入式子樹挖掘，利用離散區(qū)間來(lái)構(gòu)造投影庫(kù)，給出一種基于離散區(qū)間的頻繁嵌入式子樹挖掘算法。

• frequent subtree更多例句

詞組短語(yǔ)

短語(yǔ)

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

• frequent subtree更多詞組

專業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 頻繁子樹

  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.
  頻繁子結(jié)構(gòu)能揭示數(shù)據(jù)的內(nèi)在特性,對(duì)于數(shù)據(jù)庫(kù)修改也很穩(wěn)定,用有判別力的頻繁子樹為樹數(shù)據(jù)庫(kù)構(gòu)造索引,能顯著地提高子樹查詢的性能。