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.
- [dss-id3] - ID3 method based on a specific examples,
- [decision-trees] - decision tree lisp code decisio n tree l
- [Theclassicalid3] - id3 the most comprehensive source Decisi
- [general] - ID3 decision tree procedures, including
- [tree] - Data Mining in the decision tree algorit
- [DecisionTree-id3] - Data Mining Decision Tree Algorithm
- [aa] - algorithm of decision tree
- [J48cv] - based on decision tree cross-validation
File list (Check if you may need any files):
Class1.cs
Download