tree n. 特里〔姓氏〕。 n. 1.樹〔主要指喬木,也可指較大的灌木〕。 ★玫瑰可以稱為 bush, 也可以稱為 tree. 2.木料,木材;木構(gòu)件;〔古語〕絞首臺;〔the tree〕(釘死耶穌的)十字架;鞋楦。 3.樹形(物),世系圖,家系 (=family tree);【數(shù)學(xué)】樹(形);【化學(xué)】樹狀晶體。 a banana tree 香蕉樹。 an axle-tree 心棒,軸料。 a boot-tree 靴楦[型]。 a saddle-tree 鞍架。 at the top of the tree 在最高地位。 tree of Buddha 菩提樹。 tree of heaven 臭椿。 tree of knowledge (of good and evil) 【圣經(jīng)】知道善惡的樹,智慧之樹。 tree of life 生命之樹,生命力的源泉【植物;植物學(xué)】金鐘柏。 up a tree 〔口語〕進(jìn)退兩難,不知所措。 vt. 趕(獵獸等)上樹躲避;〔口語〕使處于困境;窮追;把鞋型插入(鞋內(nèi))。
It introduces the architecture of the switch , hol , delay control , vlan and spanning - tree algorithm , and crossbar backplane and store - and - forward technology 介紹了線頭阻塞、時延控制、虛擬局域網(wǎng)和生成樹算法等概念以及交換機的交換矩陣和共享存儲器等關(guān)鍵技術(shù)。
2 . a lazy decision - tree algorithm that comes from the idea of lazy classification based on model is researched on the base of the research of the traditional decision - tree 結(jié)合對決策樹方法的研究,重點研究并實現(xiàn)了一個“懶散的基于模型的分類”思想的…懶散的決策樹算法” 。
After strict test and running , using decision tree algorithm of data mining helped the enterprise makes objective decision in the analyse of the relation between appearance and reason of product fault 經(jīng)過運行測試證明:將決策樹算法應(yīng)用到系統(tǒng)中,可以為產(chǎn)品故障現(xiàn)象到故障原因的分析提供比較客觀的決策支持。
The minimum travel - time tree algorithm is one of the main methods to trace rays , which is based on huygens ' and fermat ' s principles and can be applied to complex geological model 摘要最小旅行時樹法是目前主要射線追蹤方法之一,該方法以惠更斯原理和費馬原理為基礎(chǔ),具有適應(yīng)復(fù)雜地質(zhì)模型的優(yōu)點,缺點是速度較慢。
Trusted third party is introduced into this system to make it capable of tracing e - cash and the withdrawer . currently the divisible e - cash system uses binary tree algorithm or ( n , k ) payment algorithm 現(xiàn)有的可分電子現(xiàn)金系統(tǒng)使用二叉樹算法或( n , k )支付問題算法,存在算法復(fù)雜,傳輸數(shù)據(jù)量大,效率低等問題。
Combining the orientation of searching the route and the decisive position of links and nodes , this paper proposes an orientated tree algorithm of efficient paths by simulating the tree ' s growing 文章將交通路網(wǎng)中節(jié)點位置的確定性與交通出行中路徑選取的有向性相結(jié)合,模擬樹的生長,提出了一種有效路徑的定向樹搜索算法。
At the same time , after successful absorbent of the factor of misclassification cost into splitting principle of decision tree algorithm , the classification model gets a high improvement in accuracy and adaptation 同時,在傳統(tǒng)的決策樹算法的分裂準(zhǔn)則中成功引入了誤分代價的因素,從而提高了分類模型的準(zhǔn)確性和適用性。
In this dissertation , the decision tree algorithm is improved to adapt to the emergence of new classes . it can better make use of the old tree to build the new decision tree . therefore , 文章改進(jìn)了決策樹算法,提出了一種基于增類的決策樹生成算法,它可以很好的利用原始的決策樹模型生成新的決策樹,大大地提高了系統(tǒng)在有新的攻擊出現(xiàn)時的更新效率。
The reduction request knowledge of background and meet with standard of data mining . decisive tree algorithm of id3 is used to prove the validity of feature reduction and to generate intrusion detection rules 粗糙集約簡具有扎實數(shù)學(xué)理論基礎(chǔ),不需要背景知識,符合數(shù)據(jù)挖掘的要求。用id3決策樹算法去印證約簡的有效性和檢測的時間效率并生成檢測規(guī)則。
You can use multiple algorithms within one solution to perform separate tasks , for example by using a regression tree algorithm to obtain financial forecasting information , and a rule - based algorithm to perform a market basket analysis 可以在一個解決方案中使用多個算法來執(zhí)行不同的任務(wù),例如,使用回歸樹算法來獲取財務(wù)預(yù)測信息,使用基于規(guī)則的算法來執(zhí)行市場籃分析。