連枝集 的英文怎麼說
中文拼音 [liánzhījí]
連枝集
英文
chord set-
Firstly, some basic algorithms for inducing decision tree are discussed, including id3, which uses information gain to select a splitting attribute when partitioning a training set ; c4. 5, which can deal with numeric attributes ; cart, which uses gini rule in attribute selection and induces a binary tree ; public, which puts tree pruning in the tree building phase ; interactive method, which puts artificial intelligence and human - computer interaction into the procedure of decision tree induction ; as well as sliq and sprint which are scalable and can be easily parallelized. advantages and disadvantages of these algorithms are also presented
文中詳細闡述了幾種極具代表性的決策樹演算法：包括使用信息熵原理分割樣本集的id3演算法；可以處理連續屬性和屬性值空缺樣本的c4 . 5演算法；依據gini系數尋找最佳分割並生成二叉決策樹的cart演算法；將樹剪枝融入到建樹過程中的public演算法；在決策樹生成過程中加入人工智慧和人為干預的基於人機交互的決策樹生成方法；以及突破主存容量限制，具有良好的伸縮性和并行性的sliq和sprint演算法。According to some strategy, dcm divides frequent itemsets lk into three non - intersect subsets thus the generation of most candidates can be localized in each individual subset and some unnecessary interactions between subsets are avoided ; moreover, most of the cut - off actions are also localized in each subset and we do n ' t need to scan the whole set lk as before
這樣，大部分候選項目集的生成可以分別在這三個子集上進行，從而避免一些子集之間的連接；同時大部分的剪枝也可以分別局限在每個子集上單獨進行檢索，避免在整個l _ k搜索而耗費時間。
分享友人