# "artificial "c4.5 ai algorithm algorithm" algorithms c4.5 comp422 compsci computing data_mining datamining decision decision_tree entropy ewv gini id3 intelligence" learning machine_learning ml research sciences trees tug unreviewed wp

My tags:

From Wikipedia, the free encyclopedia

This article includes a list of references or external links, but its sources remain unclear because it lacks inline citations. Please improve this article by introducing more precise citations where appropriate. (July 2008)

C4.5 is an algorithm used to generate a decision tree developed by Ross Quinlan. C4.5 is an extension of Quinlan's earlier ID3 algorithm. The decision trees generated by C4.5 can be used for classification, and for this reason, C4.5 is often referred to as a statistical classifier.

Contents 1 Algorithm 2 Improvements from ID3 algorithm 3 Improvements in C5.0/See5 algorithm 4 See also 5 References 6 External links

[edit] Algorithm

C4.5 builds decision trees from a set of training data in the same way as ID3, using the concept of information entropy. The training data is a set S = s₁,s₂,... of already classified samples. Each sample s_i = x₁,x₂,... is a vector where x₁,x₂,... represent attributes or features of the sample. The training data is augmented with a vector C = c₁,c₂,... where c₁,c₂,... represent the class to which each sample belongs.

At each node of the tree, C4.5 chooses one attribute of the data that most effectively splits its set of samples into subsets enriched in one class or the other. Its criterion is the normalized information gain (difference in entropy) that results from choosing an attribute for splitting the data. The attribute with the highest normalized information gain is chosen to make the decision. The C4.5 algorithm then recurses on the smaller sublists.

This algorithm has a few base cases.

• All the samples in the list belong to the same class. When this happens, it simply creates a leaf node for the decision tree saying to choose that class.
• None of the features provide any information gain. In this case, C4.5 creates a decision node higher up the tree using the expected value of the class.
• Instance of previously-unseen class encountered. Again, C4.5 creates a decision node higher up the tree using the expected value.

In pseudocode the algorithm is:

1. Check for base cases
2. For each attribute a
   1. Find the normalized information gain from splitting on a
3. Let a_best be the attribute with the highest normalized information gain
4. Create a decision node that splits on a_best
5. Recurse on the sublists obtained by splitting on a_best, and add those nodes as children of node

[edit] Improvements from ID3 algorithm

C4.5 made a number of improvements to ID3. Some of these are:

• Handling both continuous and discrete attributes - In order to handle continuous attributes, C4.5 creates a threshold and then splits the list into those whose attribute value is above the threshold and those that are less than or equal to it. [Quinlan, 96]
• Handling training data with missing attribute values - C4.5 allows attribute values to be marked as ? for missing. Missing attribute values are simply not used in gain and entropy calculations.
• Handling attributes with differing costs.
• Pruning trees after creation - C4.5 goes back through the tree once it's been created and attempts to remove branches that do not help by replacing them with leaf nodes.

[edit] Improvements in C5.0/See5 algorithm

Quinlan went on to create C5.0 and See5 (C5.0 for Unix/Linux, See5 for Windows) which he markets commercially. C5.0 offers a number of improvements on C4.5. Some of these are^[1]:

• Speed - C5.0 is significantly faster than C4.5 (several orders of magnitude)
• Memory usage - C5.0 is more memory efficient than C4.5
• Smaller decision trees - C5.0 gets similar results to C4.5 with considerably smaller decision trees.
• Support for boosting - Boosting improves the trees and gives them more accuracy.
• Weighting - C5.0 allows you to weight different attributes and misclassification types.
• Winnowing - C5.0 automatically winnows the data to help reduce noise.

C5.0/See5 is a commercial and closed-source product, although free source code is available for interpreting and using the decision trees and rule sets it outputs.

[edit] See also

• ID3 algorithm

[edit] References

• Quinlan, J. R. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, 1993.
• J. R. Quinlan. Improved use of continuous attributes in c4.5. Journal of Artificial Intelligence Research, 4:77-90, 1996.

1. ^ Is See5/C5.0 Better Than C4.5?

[edit] External links

• Original implementation on Ross Quinlan's homepage: http://www.rulequest.com/Personal/