Welcome![Sign In][Sign Up]
Location:
Search - decision tree induction

Search list

[OtherInductionofDecisionTrees

Description: 模式识别中多类分类问题决策树间接Induction of Decision Trees-Pattern Recognition in many types of decision tree classification of indirect Induction of Decision Trees
Platform: | Size: 896000 | Author: john | Hits:

[Mathimatics-Numerical algorithmsID3

Description: The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of classified examples a decision tree is induced, biased by the information gain measure, which heuristically leads to small trees. The examples are given in attribute-value representation. The set of possible classes is finite. Only tests, that split the set of instances of the underlying example languages depending on the value of a single attribute are supported.
Platform: | Size: 4096 | Author: Minh | Hits:

[OtherDecisionTreeBasedOnHiberarchyDecomposition

Description: 传统的决策树能较好地解决分类问题,但当类的个数增多时,所产生的单一决策树就会变得复杂,同时概括能力降低。 该文采用基于层次分解的方法通过产生多层决策树来处理多类问题。 与传统的单一决策树比较, 基于层次分解的决策树在处理多类问题时有许多的优势。-induction learning,decision tree,id3 ,hiberarchy decomposition
Platform: | Size: 190464 | Author: 君君 | Hits:

[Industry researchFID3-Fuzzy-Induction-Decision-Tree

Description: FID3 Fuzzy Induction Decision Tr-FID3 Fuzzy Induction Decision Tree
Platform: | Size: 497664 | Author: Artz | Hits:

[SCM1-(3)

Description: a study on decision tree for induction motor diagnostic
Platform: | Size: 153600 | Author: alpha | Hits:

[CSharpID3-CSharp

Description: This my implementation of ID3 algorithm. The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of classified examples a decision tree is induced, biased by the information gain measure, which heuristically leads to small trees. The examples are given in attribute-value representation. The set of possible classes is finite. Only tests, that split the set of instances of the underlying example languages depending on the value of a single attribute are supported. -This is my implementation of ID3 algorithm. The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of classified examples a decision tree is induced, biased by the information gain measure, which heuristically leads to small trees. The examples are given in attribute-value representation. The set of possible classes is finite. Only tests, that split the set of instances of the underlying example languages depending on the value of a single attribute are supported.
Platform: | Size: 62464 | Author: Putra | Hits:

[OtherClassification-and-Prediction

Description: What is classification? What is prediction? Issues regarding classification and prediction Classification by decision tree induction Bayesian classification Rule-based classification Classification by back propagation
Platform: | Size: 530432 | Author: vicky | Hits:

[DataMiningTreeGrowthForIris

Description: 数据挖掘十大算法之一,决策树归纳算法,用于iris.data数据,能够实际运行-Data mining is one of ten algorithms, decision tree induction algorithm for iris.data data, can actually run
Platform: | Size: 4096 | Author: 何志强 | Hits:

CodeBus www.codebus.net