liveBook · Manning

Entropy

As explained in Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI

Entropy is a measure of disorder or randomness in a distribution of class labels.

Entropy measures how disordered or random the class labels are within a subset. Decision trees use it to prefer splits that produce more homogeneous target groups. section 5.1

In classification-tree training, entropy is related to two other split criteria:

  • Information gain derives from entropy and measures how much a feature-based split reduces uncertainty about class labels. section 5.1
  • Gini impurity measures the probability of misclassifying a randomly selected subset element when labels follow the subset’s label distribution. section 5.1
  • The algorithm searches observed feature values for the combination that creates the most homogeneous target subsets; regression uses different criteria. section 5.1

How Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI covers it

How deep it goes
Defines disorder and contrasts entropy with information gain and Gini impurity, without giving a formula or worked calculation.
Examples
Uses candidate feature-and-value splits and their resulting target subsets as the practical setting for entropy.
What you can do after
Evaluate candidate classification-tree splits by comparing their ability to reduce label disorder.
How it connects
Connects entropy to decision trees, classification, information gain, Gini impurity, feature splits, and homogeneous target subsets.

Also explained in

Compare how 13 books explain entropy →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI. The section links point to the parts of the book it draws on.