Decision Trees from large Databases: SLIQ

More documents

Recommendations

Info

Decision Tree - Disadvantages • Not robust against noise • Tendency to overfit • Unstable Sawade/Landwehr/Prasse/Scheffer, Maschinelles Lernen 76
Summary of Decision Trees • Classification: Prediction of discrete values. Discrete attributes: ID3. Continuous attributes: C4.5. Scalable to large databases: SLIQ, SPRINT. • Regression: Prediction of continuous values. Regression trees: constant value predicted at each leaf. Model trees: a linear model is contained in each leaf. Sawade/Landwehr/Prasse/Scheffer, Maschinelles Lernen 77
Page 1 and 2: Decision Trees from large Databases
Page 3 and 4: Compare: Information Gain vs. Gini
Page 5 and 6: SLIQ (1st Substep) • Pre-sorting
Page 7 and 8: SLIQ: Example Sawade/Landwehr/Prass
Page 9 and 10: SLIQ (2nd Substep) • Evaluation o
Page 11 and 12: SLIQ - Algorithm 1. Start Pre-sorti
Page 13 and 14: SLIQ: Example Sawade/Landwehr/Prass
Page 15 and 16: SLIQ- Pruning • Minimum Descripti
Page 17 and 18: Pruning - MDL Example II • Which
Page 19 and 20: Regression Trees • ID3, C4.5, SLI
Page 21 and 22: Regression Trees • Goal: small qu
Page 23 and 24: Linear Regression • Regression tr
Page 25 and 26: Model Trees • Decision trees but
Page 27 and 28: Model Trees: Creation of new Test N
Page 29 and 30: Attributes with Costs • Example:
Page 31 and 32: Bootstrapping - Example x = 3.12 0
Page 33 and 34: Random Forests • Repeat: Draw ra
Page 35: Decision Tree - Advantages • Easy

Decision Trees from large Databases: SLIQ

Create successful ePaper yourself

Delete template?

Save as template?