Entropy measures uncertainty from the distribution of class probabilities. In decision-tree learning, it evaluates how well a feature split separates labeled examples. section 5.2.1
A decision tree uses entropy within a top-down, greedy construction process:
- Start with labeled training examples and choose a feature and threshold that best separate their outcomes. section 5.2.1
- Create branches, repeat the split process for each subset, and stop at conditions such as limited depth or homogeneous leaf labels. section 5.2.1
- Compared with Gini impurity, entropy is more sensitive to changing class proportions and can sometimes produce more balanced trees under class imbalance. section 5.2.1
Molecular inhibition classification
A classifier can split molecules using RDKit descriptors such as molecular weight and logP, then predict cytochrome P450 inhibition for validation molecules. section 5.2.1


















