Chapter 06.07: Discussion
In this section we discuss the advantages and disadvantages of CART and mention other tree methodologies.
Lecture video
Lecture slides
Code demo
CART
You can run the code snippets in the demos on your local machine. The corresponding Rmd version of this demo can be found here. If you want to render the Rmd files to PDF, you need the accompanying style files.
Quiz
---
shuffle_questions: false
---
## Which statements are true?
- [ ] CART is a stable algorithm -- if the data changes slightly the tree structure remains quite similar.
- [x] CART is robust to outliers.
- [x] With trees it is easy to handle missing values.
- [ ] A simple tree is everything you need to fit a linear function $y \approx a + b \cdot x$ with numeric target.