Skip to content

Latest commit

 

History

History
84 lines (52 loc) · 3 KB

boost-trees.md

File metadata and controls

84 lines (52 loc) · 3 KB

Boost Trees

Back to Index


Objective

Learn Boost Tree algorithms

Prerequisite Reading

Essentials Reading

Boost Trees

Extra Reading

Implementing Boosting trees in Scikit-Learn

Knowledge Check

  • What is the basic principle for boost trees?
  • What are some implementations of boost trees?

Exercises

We will be using BT in the same exercises we did in Decision Trees section

Difficulty Level

★☆☆ - Easy
★★☆ - Medium
★★★ - Challenging
★★★★ - Bonus

EX-1: Classification - Synthetic data (★☆☆)

Use Scikit's make_blobs or make_classification to generate some sample data.

Try to separate them using BT

EX-2: Classification (★★☆)

  • Here is Bank marketing dataset
  • You may want to encode variables
  • Use DT to predict yes/no binary decision
  • Visualize the tree
  • Create a confusion matrix
  • What is the accuracy of the model
  • Run Cross Validation to gauge the accuracy of this model

EX-3: Regression - Synthetic data (★☆☆)

Use Scikit's make_regression to generate some sample data.

Use RandomForestRegressor to solve this

EX-4: Regression (★★☆)

  • Use Bike sharing data
  • Use RandomForestRegressor to predict bike demand
  • Visualize the tree
  • Use RMSE, R2 to evaluate the model
  • Use Cross Validation to thoroughly test the model performance

More Exercises