Tree-based model
A predictive model that represents its decision function as one or more trees of conditional splits, mapping input features to predictions or decisions.
Fight Fraud with Machine Learning
A tree-based model is a predictive model whose decision process is represented by one or more tree structures with conditional feature-based splits.
- How it is used
- Detects fraudulent online transactions by learning patterns from tabular data instead of relying only on explicit rules.
- How deep it goes
- Explains decision trees and random forests through training, tuning, AUPRC evaluation, and interpretation; defers detailed model discussion to appendices.
- Examples
- Uses a cleaned online-transactions dataset, categorical features, cross-validation, random hyperparameter search, and a random-forest fraud model.
- What you can do after
- Build it from scratch as a tuned and interpreted tree-based fraud detector evaluated on held-out transaction data.
Read how Fight Fraud with Machine Learning explains tree-based model →
Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI
A tree-based model is a predictive model whose decision structure is formed from one or more decision trees.
- How it is used
- Handles tabular prediction with relatively little preprocessing, supporting both classification and regression workflows.
- How deep it goes
- Explains roots, branches, leaves, split search, impurity criteria, and pruning, but does not detail ensemble variants.
- Examples
- Uses animal classification by legs and eyes and Airbnb NYC listing classification with categorical and numeric features.
- What you can do after
- Apply it via scikit-learn pipelines, preprocessing features and evaluating a DecisionTreeClassifier with cross-validation.
Machine Learning Algorithms in Depth
A tree-based model makes predictions by recursively partitioning an input space into regions represented by nodes and leaves.
- How it is used
- Uses recursive partitioning for interpretable classification and regression, with feature importance as an additional source of insight.
- How deep it goes
- Derives feature-threshold search and Gini impurity, mentions entropy, and stops short of detailing the full objective equations.
- Examples
- Demonstrates Python classes for CART and applies the workflow to the Iris dataset with train-test splitting and accuracy scoring.
- What you can do after
- Build a basic CART classifier from scratch with node state, split search, depth control, and accuracy evaluation.
Read how Machine Learning Algorithms in Depth explains tree-based model →
Demand Forecasting Best Practices
A tree-based machine learning model makes predictions using one or more decision-tree structures that represent relationships between inputs and outputs.
- How it is used
- Uses tree-based models to forecast demand and inspect which data features receive the model’s attention.
- How deep it goes
- Explains feature importance and scenario analysis, but stops short of exposing level, trend, seasonality, or direct causal effects.
- Examples
- Uses feature rankings, weather as a low-importance driver, and promotion scenarios showing uplift and self-cannibalization.
- What you can do after
- Evaluate demand drivers and compare forecast scenarios while avoiding causal claims from feature importance alone.
Read how Demand Forecasting Best Practices explains tree-based model →
Also covered in
- Build AI Drug Discovery PipelinesIn early access (MEAP)
What to know first
- gradient boostingGradient boosting is an ensemble-learning technique that sequentially adds predictive models fitted to reduce a loss by following its gradient.
- neural networkA neural network is a computational model composed of interconnected, parameterized units or transformations that learn to map inputs to outputs.
- accuracyAccuracy is the degree to which a result agrees with a specified truth, reference, or criterion, commonly measured as the proportion of evaluated predictions that are correct.
- language modelA language model is a computational model that represents patterns in linguistic sequences to assign probabilities, predict, generate, or evaluate language.
Related concepts
- random forestincludes · A random forest is an ensemble learning model that aggregates predictions from multiple decision trees trained with randomized data samples, feature subsets, or both.
- gradient boostingincludes · Gradient boosting is an ensemble-learning technique that sequentially adds predictive models fitted to reduce a loss by following its gradient.
- feature importance scoreused by · A feature importance score is a numerical estimate of an input feature’s relative contribution or influence on a model’s predictions or performance.
- XGBoostincludes · XGBoost is an open-source software library for efficient, scalable gradient-boosted decision-tree algorithms.
- decision treeincludes · A decision tree is a tree-structured model or representation in which successive tests or choices lead through branches to outcomes, predictions, or actions.
Questions about tree-based model
What is tree-based model?
A predictive model that represents its decision function as one or more trees of conditional splits, mapping input features to predictions or decisions.
Which Manning books explain tree-based model?
Fight Fraud with Machine Learning, Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI, Machine Learning Algorithms in Depth and Demand Forecasting Best Practices.
What should I know before learning tree-based model?
Manning books that teach tree-based model usually introduce gradient boosting, neural network, accuracy and language model first.
What kinds of tree-based model are there?
Kinds of tree-based model include random forest, gradient boosting, XGBoost, decision-tree-based method and decision tree.
What is tree-based model also called?
Tree-based model is also called tree-based method.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.



