簡化決策樹 的英文怎麼說

中文拼音 [jiǎnhuàjuécèshù]
簡化決策樹 英文
reduced decision tree
  • 簡 : Ⅰ形容詞（簡單） simple; simplified; brief Ⅱ動詞1 （使簡單; 簡化） simplify 2 [書面語] （選擇人才...
  • 決 : Ⅰ動詞1 （作出主張; 決定） decide; determine 2 （執行死刑; 殺死） execute a person 3 （裂開; 斷開...
  • 策 : Ⅰ名詞1 （通「冊」 古代寫字用的竹片或木片） bamboo or wooden slips used for writing on in ancient ...
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 簡化 : simplify; facilitate; idealization; dilution; simplification; reducing; simplifying; [自動化] red...
  1. It includes two aspects in content : one is the best choice for plane disposal of pipeline, and its methods follows as decision - making plot, simple trapeziform and optimizing trunkform etc ; the other one is optimizing pipe parameter when the plane disposal of pipeline has been fixed, and the methods of which are linear programming, unlinear programming, dynamic optimizing, direct optimizing, hereditary arithmetic and so on

    污水管網優化設計包括兩個方面的內容：一是管線平面布置的優化選擇；其方法有：決策圖法，簡約梯度法，優化樹法等。二是在管線平面布置已定情況下進行管道參數的優化；其方法有：線性規劃法，非線性規劃法，動態優化法，遺傳演算法，直接優化法等。
  2. Secondly, the thesis puts forward that conditional probability of attribute to positive example can be used to compare the information which attribute provides so as to construct decision tree and to get classify rules. and a demonstration shows that the algorithm simplifies the decision tree ' s building process efficiently

    其次，提出了利用屬性對正例的影響度來比較屬性對分類提供的信息量，進而選擇分類屬性構造決策樹的條件概率決策樹演算法，同時實例計算說明該演算法有效地簡化了決策樹的生成過程。
  3. The empirical result illustrates that we can simplify the single rule and reduce the number of rules through the gmm method. we can also solve the noisy problem in the practical application effectively

    實驗結果表明，採用gmm模型簡化決策樹規則，既能簡化單個規則，又能減少規則的總數量，更能排除數據中噪音的干擾，提高規則的分類精度。
  4. To be dealed agaist extended data, this thesis has improved on and come true arithmetic of time sequence model, and amended conventional decision tree arithmetic, introduced the decision tree arithmetic for extended data, namely threshold value control approach. according to threshold value and concept hierarchy, threshold value control approach can set up the concise and statistic classification tree. at the same time, based on the theory of the concept lattice, this thesis introduces the arithmetic of mining association rules based on quantified concept lattice reduced by uncertainty coefficient

    針對泛化后的數據，本文改進並實現時間序列模式發現演算法；修改了傳統的決策樹演算法，提出了一種適合於泛化數據的決策樹構造演算法：閾值控製法，閾值控製法通過閾值和概念層次的控制，可以建立簡潔明了、具有統計意義的分類樹；在概念格理論基礎上提出了基於不確定系數法挖掘關聯規則的演算法。
  5. The decision tree had a lot of algorithms, this paper focus on the optimization of fast classification in the face of n - value attribute of id3 algorithm which had parameters of user ' s interest. on the basis of avoiding the weak relevant attribute of n - value covered the worth strong relevant attribute, simplify complexity of the original algorithm and code cost through the mathematics tool, thus raise the speed of operation while using this algorithm, and lower costs in thrift as much as possible, to raise the efficiency

    決策樹學習有很多演算法，本文著重研究了對引入用戶興趣度參數的id3演算法在面對多值屬性時的快速分類的優化，在避免了多值弱相關屬性覆蓋少值強相關屬性的基礎上，通過數學工具簡化原演算法的復雜度和編碼代價，從而提高使用該演算法時的運算速度，盡量多的節約計算時間，從而達到降低成本的，提高效率的目的。
分享友人
分享到 Line

分享到臉書