From the course: Machine Learning and AI Foundations: Classification Modeling
Unlock the full course today
Join today to access over 24,700 courses taught by industry experts.
Decision Trees
From the course: Machine Learning and AI Foundations: Classification Modeling
Decision Trees
- [Instructor] Okay, decision trees. A big topic, also a popular topic because of all of the algorithms, decision trees are probably the most common. Why is it a complicated topic? Well, because decision trees are not one algorithm. There are many, and the way that they build, the execution is quite different for these different types. There are general principles though that we're able to explore that apply to all decision tree algorithms, but they truly are a family of techniques. They have a variety of missing data handling options, really quite different and different in interesting ways. However decision trees really are the exception to the rule. They do not use listwise deletion. They all have some alternative to that, either treating the missing data or setting the missing data side as if it was its own separate category. Also decision trees are a so-called greedy algorithm, meaning that as it's built, it's doing one variable at a time and will stop. If you've been listening…
Contents
-
-
-
-
-
Overview2m 10s
-
(Locked)
Discriminant with three categories5m 44s
-
(Locked)
Discriminant with two categories5m 2s
-
(Locked)
Stepwise discriminant1m 3s
-
(Locked)
Logistic regression10m 54s
-
(Locked)
Stepwise logistic regression1m 3s
-
(Locked)
Decision Trees4m 46s
-
(Locked)
KNN3m 58s
-
(Locked)
Linear SVM8m 2s
-
Neural nets7m 57s
-
(Locked)
Bayesian networks7m 54s
-
(Locked)
Heterogenous ensembles3m 22s
-
(Locked)
Bagging and random forest3m 26s
-
(Locked)
Boosting and XGBoost1m 57s
-
-
-