Send feedback

Introduction Stay organized with collections Save and categorize content based on your preferences.

outlined_flag

  • Decision forests are interpretable machine learning algorithms that work well with tabular data for tasks like classification, regression, and ranking.

  • Decision forests offer advantages such as easy configuration, native handling of various data types, robustness to noise, and fast inference/training on smaller datasets.

  • This course provides a comprehensive understanding of decision trees and forests, including how they make predictions, different types, performance considerations, and effective usage strategies.

  • The course uses YDF library code examples to demonstrate concepts, but the knowledge is transferable to other decision forest libraries.

  • Basic machine learning knowledge and familiarity with data preprocessing are prerequisites for this course.

Estimated Course Time: 2.5 hours

Decision forests provide the following benefits:

  • They are easier to configure than neural networks. Decision forests have fewer hyperparameters; furthermore, the hyperparameters in decision forests provide good defaults.
  • They natively handle numeric, categorical, and missing features. This means you can write far less preprocessing code than when using a neural network, saving you time and reducing sources for error.
  • They often give good results out of the box, are robust to noisy data, and have interpretable properties.
  • They infer and train on small datasets (< 1M examples) much faster than neural networks.

Decision forests produce great results in machine learning competitions, and are heavily used in many industrial tasks.

This course introduces decision trees and decision forests. Decision forests are a family of interpretable machine learning algorithms that excel with tabular data. Decision forests can perform:

Learning Objectives:
  • Explain decision trees and decision forests.
  • Determine how decision trees and decision forests make predictions.
  • Understand how different types of decision forests, such as random forests and gradient boosted trees.
  • Explain when decision forests perform well, and what their limitations are.
  • Develop a sense of how to use decision forests effectively.

This course explains how decision forests work without focusing on any specific libraries. However, throughout the course, text boxes showcase code examples that rely on the

YDF

decision forest library, but can be be converted to other decision forest libraries.

Prerequisites

This course assumes you have completed the following courses or have equivalent knowledge:

Happy Learning!

Send feedback

Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.

Last updated 2025-08-25 UTC.

Need to tell us more? [[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-08-25 UTC."],[],[]]