(MXML-2-03) Decision Trees - ID3 - C4.5, IGR, Pruning, Coding Practice

Uploaded by

RunningMan Haha

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

34 views3 pages

(MXML-2-03) Decision Trees - ID3 - C4.5, IGR, Pruning, Coding Practice

Uploaded by

RunningMan Haha

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

You are on page 1/ 3

1.

Introduction

 This video is about ID3 and C4.5 decision tree method.

2. Information Gain Ratio

 Information has its problem when the number of categories increases.

 So Information Gain Ratio is used instead to compensate for that.
3. Pruning based on confidence intervals

 If the upper bound value after splitting is greater than the upper bound value before
splitting, it is better prune the tree / not split the tree.

 If the upper bound value after splitting is lower than the upper bound value before
splitting, it is better not to prune the tree / split the tree.
4. Python Code Example

 Prune = True means that pruning is allowed.

Machine Learning Unit-3.2
No ratings yet
Machine Learning Unit-3.2
61 pages
C4.5 Algorithm
100% (1)
C4.5 Algorithm
31 pages
ML Unit 3 New
100% (1)
ML Unit 3 New
24 pages
DWDM UNIT-IV Classification and Prediction
100% (1)
DWDM UNIT-IV Classification and Prediction
70 pages
Decision Tree
No ratings yet
Decision Tree
68 pages
Lecture4 Supervised Segmentation For Students
No ratings yet
Lecture4 Supervised Segmentation For Students
44 pages
STA555 Data Mining: Decision Trees
No ratings yet
STA555 Data Mining: Decision Trees
40 pages
Storey DecisionTrees
No ratings yet
Storey DecisionTrees
38 pages
MI - Unit 4
No ratings yet
MI - Unit 4
79 pages
ML Unit 3
No ratings yet
ML Unit 3
22 pages
Machine Learning Unit4
No ratings yet
Machine Learning Unit4
8 pages
Lec4 Tree v2.4 1
No ratings yet
Lec4 Tree v2.4 1
54 pages
Model Engineering
No ratings yet
Model Engineering
7 pages
Unit 7
No ratings yet
Unit 7
67 pages
Mod06 Decisions Trees
No ratings yet
Mod06 Decisions Trees
49 pages
Business Data Mining Week 10 A
No ratings yet
Business Data Mining Week 10 A
28 pages
Decision Trees MIT 15.097 Course Notes
No ratings yet
Decision Trees MIT 15.097 Course Notes
17 pages
Decision Tree
No ratings yet
Decision Tree
13 pages
A Comparative Analysis of Methods For Pruning Decision Trees
No ratings yet
A Comparative Analysis of Methods For Pruning Decision Trees
16 pages
Decision Trees
No ratings yet
Decision Trees
19 pages
Decision Lists and Trees
No ratings yet
Decision Lists and Trees
29 pages
MLT UNIT-3 Notes
No ratings yet
MLT UNIT-3 Notes
35 pages
ID3 Decision Tree Algorithm
No ratings yet
ID3 Decision Tree Algorithm
18 pages
Decision Trees
No ratings yet
Decision Trees
45 pages
Session 5b Classification by Decision Tree Induction
No ratings yet
Session 5b Classification by Decision Tree Induction
42 pages
UNIT-3 Machine Learning
No ratings yet
UNIT-3 Machine Learning
43 pages
Decision Tree
No ratings yet
Decision Tree
20 pages
Data Mining Notes Unit 4
No ratings yet
Data Mining Notes Unit 4
30 pages
AI&Ml-module 4 (Complete)
No ratings yet
AI&Ml-module 4 (Complete)
124 pages
UNIT-3 Machine Learning
No ratings yet
UNIT-3 Machine Learning
40 pages
Unit IV Decision Trees
No ratings yet
Unit IV Decision Trees
37 pages
ML-Lec-07-Decision Tree Overfitting
No ratings yet
ML-Lec-07-Decision Tree Overfitting
25 pages
Unit-3 Alt
No ratings yet
Unit-3 Alt
24 pages
Lecture 17 18
No ratings yet
Lecture 17 18
52 pages
Decision Tree For Classification (ID3 Information Gain Entropy)
No ratings yet
Decision Tree For Classification (ID3 Information Gain Entropy)
3 pages
MLT 3 UNIT-Part-1
No ratings yet
MLT 3 UNIT-Part-1
28 pages
Unit 4 Da
No ratings yet
Unit 4 Da
23 pages
AI&Ml-module 4 (Part 1)
No ratings yet
AI&Ml-module 4 (Part 1)
85 pages
ML Unit3
No ratings yet
ML Unit3
24 pages
ML Assignment-2: Unit 3
No ratings yet
ML Assignment-2: Unit 3
21 pages
Decision Tree
No ratings yet
Decision Tree
15 pages
On The Complexity of Learning Decision Trees
No ratings yet
On The Complexity of Learning Decision Trees
4 pages
Decision Trees
No ratings yet
Decision Trees
37 pages
Classification and Prediction
No ratings yet
Classification and Prediction
81 pages
FALLSEM2024-25 BCSE209L TH VL2024250101598 2024-08-05 Reference-Material-I
No ratings yet
FALLSEM2024-25 BCSE209L TH VL2024250101598 2024-08-05 Reference-Material-I
31 pages
Unit-5 Decision Trees & Ensembles Methods
No ratings yet
Unit-5 Decision Trees & Ensembles Methods
11 pages
U4 ML Updated
No ratings yet
U4 ML Updated
32 pages
Unit2 C4.5
No ratings yet
Unit2 C4.5
7 pages
Decision Trees
No ratings yet
Decision Trees
11 pages
Data Mining: Practical Machine Learning Tools and Techniques
No ratings yet
Data Mining: Practical Machine Learning Tools and Techniques
57 pages
Decision Tree 2
No ratings yet
Decision Tree 2
20 pages
T6 Decision Tree
No ratings yet
T6 Decision Tree
38 pages
Business Data Mining WEEK-10 LAQ
No ratings yet
Business Data Mining WEEK-10 LAQ
4 pages
C45 Algorithm
No ratings yet
C45 Algorithm
3 pages
10.1 Decision Tree
No ratings yet
10.1 Decision Tree
17 pages
Classification Using Decision Trees
No ratings yet
Classification Using Decision Trees
43 pages
DataMining-Handouts1 5
No ratings yet
DataMining-Handouts1 5
8 pages
C4.5 and CHAID Algorithm: Pavan J Joshi 2010MCS2095 Special Topics in Database Systems
No ratings yet
C4.5 and CHAID Algorithm: Pavan J Joshi 2010MCS2095 Special Topics in Database Systems
30 pages
Decision Tree Method in Financial Analysis of Listed Logistics Companies
No ratings yet
Decision Tree Method in Financial Analysis of Listed Logistics Companies
6 pages

(MXML-2-03) Decision Trees - ID3 - C4.5, IGR, Pruning, Coding Practice

Uploaded by

(MXML-2-03) Decision Trees - ID3 - C4.5, IGR, Pruning, Coding Practice

Uploaded by

1.

 This video is about ID3 and C4.5 decision tree method.

2. Information Gain Ratio

 Information has its problem when the number of categories increases.

 Prune = True means that pruning is allowed.

You might also like