tree algorithm 中文意思是什麼

tree algorithm 解釋
樹演算法
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. Most of the spanning tree algorithm ( sta ) failures occur due to the excessive loss of bpdus causing the blocked ports to transition to forwarding mode

    大多的生成樹演算法（ sta ）失敗發生由於過多的丟失bpdu導致阻塞埠轉換為轉發模式。
  2. It introduces the architecture of the switch, hol, delay control, vlan and spanning - tree algorithm, and crossbar backplane and store - and - forward technology

    介紹了線頭阻塞、時延控制、虛擬局域網和生成樹演算法等概念以及交換機的交換矩陣和共享存儲器等關鍵技術。
  3. 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

    粗糙集約簡具有扎實數學理論基礎，不需要背景知識，符合數據挖掘的要求。用id3決策樹演算法去印證約簡的有效性和檢測的時間效率並生成檢測規則。
  4. Many different techniques have been proposed for classification, including statistical approaches, neural networks, decision tree algorithm and rough sets

    現有數據分類方法有統計方法、決策樹分類方法、神經網路方法、粗集法等。
  5. Application of decision tree algorithm in intelligent circuit breaker

    決策樹演算法在智能斷路器中的應用
  6. Minimum spanning tree algorithm based on extended double list storage structure

    基於擴展雙鏈式存儲結構的最小生成樹演算法
  7. It ' s a pity that although there are many papers and articles focused on data mining published every year, most of them deal with data mining concept and abstract algorithm theory, it is hardly to see their real implementation and application, in this context, when i was in my graduate exercitation in a company in beijing, which focus on developing supermarket software, i joined and completed an olap ( online analytical processing ) project, merchandise analysis and sale report system, which based on microsoft analysis service and microsoft sql server. i also design and implement three important algorithms : merchandise association rule algorithm based on multi - level merchandise category, supermarket member customer shopping frequent sequence generating algorithm, customer classification ( decision tree ) algorithm which based on information entropy and conditional probability tree, and they all achieve expected result

    本文作者在實習期間，參與並完成了基於微軟分析服務器的銷售分析與報表系統；並在公司即將開始的數據挖掘項目中，完成了多個重要演算法的設計和c + +程序實現：基於多層分類商品樹的商品關聯規則演算法，會員顧客的購物頻繁序列模式產生演算法；基於信息熵理論和條件概率樹的會員顧客分類（決策樹）演算法，並分別使用數據進行了測試，取得了較好的結果。
  8. First, this paper analyses the multivalue bios problem of decision tree algorithm experimentally and theoretically. second, this paper proposes a new decision tree algorithm, af algorithm, which avoids multivalue bios. third, we implement the af algorithm, and use it to classify patients in the field of iatrology

    本論文針對上述問題，主要作了如下工作:從實驗和理論兩個方面分析了決策樹演算法的多值偏向問題;提出了一種避免了多值偏向問題的決策樹演算法? ? af演算法;實現了af演算法，並把它應用到醫學領域中的病人分類問題中。
  9. Based on the analysis of above drawbacks, this paper proposes frequent access pattern tree algorithm ( fapt ). this algorithm includes two steps : access pattern tree method, through the pattern matching method it saves user ' s visit sequences with tree ; pruning method, it uses frequent degree to prune access pattern tree which is under the frequent degree

    在分析以上不足的基礎上，提出了頻繁訪問模式樹（ fapt ）演算法，該演算法包括以下兩個步驟:訪問模式樹的生成，通過模式匹配的方法將用戶訪問序列以樹形結構來存儲;修剪的策略，利用頻繁度對訪問模式樹進行修剪，修剪掉其中低於頻繁度的節點。
  10. 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

    摘要最小旅行時樹法是目前主要射線追蹤方法之一，該方法以惠更斯原理和費馬原理為基礎，具有適應復雜地質模型的優點，缺點是速度較慢。
  11. Aco - steiner : ant colony optimization based rectilinear steiner minimal tree algorithm

    Aco - steiner ：基於蟻群優化策略的最小直角steiner樹構造演算法
  12. ( 3 ) on the basis of the dimensioning principle of correctness, integrality, clearness and rationality, utilizing the modified spanning tree algorithm in graph theory to ascertain the non - functional dimensions, accomplish the dimensioning mode analysis of the part

    （ 3 ）根據尺寸標注所要求的正確性、完整性、清晰性及合理性等原則，用改進了的圖論中的生成樹演算法，確定出零件的非功能尺寸，完成零件尺寸標注模式的分析。
  13. In decision tree algorithm, the famous one is id3 algorithm, which was presented by quinlan in 1986. it is not a algorithm increasing by degrees, and it uses information entropy as a standard to select attribute, but the disadvantage of this algorithm is that it is easy to select those attributes whose values is more, while attributes whose values is more are not always the best

    在決策樹演算法中屬quinlan於1986年提出的id3演算法最有名，它是非遞增演算法，並且採用信息熵作為屬性選擇的標準，可是這個標準易偏向于值數較多的屬性，而屬性值較多的屬性卻不總是最優的屬性。
  14. Classification and regression trees processing part introduces growing algorithm of cart, pruning algorithm of cart and selecting best tree algorithm etc. on the basis of the concerned new model, the thesis presents in details the designing of multi - rules neural network based cart system for abnormal customers recognition

    在分類回歸樹部分，介紹了分類回歸樹的生長演算法、最小代價?復雜性剪枝演算法以及最優樹選擇等演算法。提出了系統設計之後，論文詳細介紹了該系統的開發，用以解決異動客戶的識別問題。
  15. When a switch is turned on, the spanning - tree algorithm is used to identify the root bridge

    當一個交換器被開機時，擴充樹演演算法會先去找根橋接器。
  16. 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

    可以在一個解決方案中使用多個演算法來執行不同的任務，例如，使用回歸樹演算法來獲取財務預測信息，使用基於規則的演算法來執行市場籃分析。
  17. In this dissertation, the research trends for the problem have been introduced ; the ‘ dim ’ and ‘ point ’ has been strictly defined in mathematics from machine vision and human vision ; the ideal clutter suppression system based on clutter predication and the realization and evaluation of evaluation index has been studied, in succession the clutter suppression technologies have been researched. firstly, the classic nonparametric algorithm has been analyzed in detail and systematically, for it ’ s weakness that it cannot remove the non - stationary clutter ideally, kalman filter algorithm for clutter suppression in 2d image signal has been built. secondly, fast adaptive kalman filter is presented based on fast wide - sense stationary areas partition algorithm : limited combination and division algorithm based on quarti - tree algorithm, new taxis filter route algorithm which can break through the limitation of the necessity of pixel neighborhood of 2d filter and laplace data model with two parameters which is perfectly suitable for the residual image of kalman clutter suppression

    首先分析了經典的非參數法，對於四種具有代表性的核，從前述的三個性能評價方面做了分析和對比，指出了其速度快的優點和對非平穩圖像適應性差的弱點，針對非參數法的弱點，重點研究了對非平穩圖像適應良好的卡爾曼雜波抑制技術:建立了非平穩圖像的類自回歸模型，在此基礎上建立了二維卡爾曼濾波基礎的兩個方程:狀態方程和測量方程;建立了非平穩圖像準平穩區域快速劃分演算法:基於四叉樹法的有限分裂合併演算法;二維空間的基於k排序的濾波路線演算法，突破了空域濾波路線上區域相鄰的限制;在這些研究的基礎上實現了快速卡爾曼估計，實驗驗證了該方法相對逐點卡爾曼估計可以提高運算速度三倍左右;雜波抑制結果表明傳統的高斯性檢驗並不適合卡爾曼估計后的殘余圖像，由此建立了殘余圖像的雙參數拉普拉斯模型，實驗表明其可以完好的吻合殘余圖像的概率密度曲線。
  18. 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

    文章將交通路網中節點位置的確定性與交通出行中路徑選取的有向性相結合，模擬樹的生長，提出了一種有效路徑的定向樹搜索演算法。
  19. 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

    同時，在傳統的決策樹演算法的分裂準則中成功引入了誤分代價的因素，從而提高了分類模型的準確性和適用性。
  20. 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

    現有的可分電子現金系統使用二叉樹演算法或（ n ， k ）支付問題演算法，存在演算法復雜，傳輸數據量大，效率低等問題。
分享友人
分享到 Line

分享到臉書