liveBook · Manning

Decision tree

As explained in Machine Learning Platform Engineering

A decision tree is a predictive model that recursively partitions input data using feature-based decision rules.

A decision tree is a supervised classification model that fits an income classifier from prepared feature data. Its production value comes from making training, evaluation, and persistence traceable through MLflow. section 4.1.2

A reproducible training run records:

  • Training, test, and reference datasets saved in MinIO with external paths logged as MLflow input metadata. section 4.1.2
  • Accuracy, test ROC AUC, fitting time, model parameters, and the fitted model artifact. section 4.1.2

How Machine Learning Platform Engineering covers it

How deep it goes
Explains implementation through preprocessing, fitting, evaluation, dataset logging, parameter logging, and model persistence.
Examples
Demonstrates an income classifier trained on encoded features and compared with random forest and XGBoost models.
What it assumes
Uses pandas feature tables, categorical encoding, train-test splitting, MinIO storage, and MLflow experiment setup.
What you can do after
Build a tracked decision-tree experiment that records datasets, metrics, parameters, and a reloadable model artifact.
How it connects
Connects decision trees with MLflow tracking, MinIO, one-hot encoding, scikit-learn, random forests, and XGBoost.

Also explained in

Compare how 13 books explain decision tree →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Machine Learning Platform Engineering. The section links point to the parts of the book it draws on.