Byte-Sized-Chunks: Decision Trees and Random Forests | Janani Ravi Vitthal Srinivasan | Skillshare

Byte-Sized-Chunks: Decision Trees and Random Forests

Janani Ravi Vitthal Srinivasan, An ex-Google, Stanford and Flipkart team

Play Speed
  • 0.5x
  • 1x (Normal)
  • 1.25x
  • 1.5x
  • 2x
19 Videos (4h 35m)
    • You, This Course, and Us!

    • Planting the seed - What are Decision Trees?

    • Growing the Tree - Decision Tree Learning

    • Branching out - Information Gain

    • Decision Tree Algorithms

    • Installing Python - Anaconda and Pip

    • Back to Basics : Numpy in Python

    • Back to Basics : Numpy and Scipy in Python

    • Titanic : Decision Trees predict Survival (Kaggle) - I

    • Titanic : Decision Trees predict Survival (Kaggle) - II

    • Titanic : Decision Trees predict Survival (Kaggle) - III

    • Overfitting - The Bane of Machine Learning

    • Overfitting Continued

    • Cross-Validation

    • Simplicity is a virtue - Regularization

    • The Wisdom Of Crowds - Ensemble Learning

    • Ensemble Learning continued - Bagging, Boosting and Stacking

    • Random Forests - Much more than trees

    • Back on the Titanic - Cross Validation and Random Forests


About This Class


Note: This course is a subset of our 20+ hour course 'From 0 to 1: Machine Learning & Natural Language Processing' so please don't sign up for both:-)

In an age of decision fatigue and information overload, this course is a crisp yet thorough primer on 2 great ML techniques that help cut through the noise: decision trees and random forests.

Prerequisites: No prerequisites, knowledge of some undergraduate level mathematics would help but is not mandatory. Working knowledge of Python would be helpful if you want to run the source code that is provided.

Taught by a Stanford-educated, ex-Googler and an IIT, IIM - educated ex-Flipkart lead analyst. This team has decades of practical experience in quant trading, analytics and e-commerce.

What's Covered:

  • Decision Trees are a visual and intuitive way of predicting what the outcome will be given some inputs. They assign an order of importance to the input variables that helps you see clearly what really influences your outcome.
  • Random Forests avoid overfitting: Decision trees are cool but painstaking to build - because they really tend to overfit. Random Forests to the rescue! Use an ensemble of decision trees - all the benefits of decision trees, few of the pains!
  • Python Activity: Surviving aboard the Titanic! Build a decision tree to predict the survival of a passenger on the Titanic. This is a challenge posed by Kaggle (a competitive online data science community). We'll start off by exploring the data and transforming the data into feature vectors that can be fed to a Decision Tree Classifier.






  • --
  • Beginner
  • Intermediate
  • Advanced
  • All Levels
  • Beg/Int
  • Int/Adv


Community Generated

The level is determined by a majority opinion of students who have reviewed this class. The teacher's recommendation is shown until at least 5 student responses are collected.

Janani Ravi Vitthal Srinivasan

An ex-Google, Stanford and Flipkart team

Loonycorn is us, Janani Ravi and Vitthal Srinivasan. Between us, we have studied at Stanford, been admitted to IIM Ahmedabad and have spent years working in tech, in the Bay Area, New York, Singapore, and Bangalore.

Janani: 7 years at Google (New York, Singapore); Studied at Stanford; also worked at Flipkart and Microsoft

Vitthal: Also Google (Singapore) and studied at Stanford; Flipkart, Credit Suisse and INSEAD too

We think we might have hit upon a neat way of teaching ...

See full profile

Technology Data Science Machine Learning
Report class