← Back to Data Science

All Topics

Advertisement

Learn/Data Science/Machine Learning

Decision Tree Algorithm

Topic: Tree Models

Advertisement

Decision Trees Explained

Tree-based predictive models.

Structure

Nodes: conditions. Leaves: predictions. Branches: outcomes.

Splitting Criteria

Gini impurity: 1 - Σp². Entropy: -Σp log₂(p). Information gain: entropy before - weighted entropy after.

Pruning

Pre-pruning: max_depth, min_samples. Post-pruning: cost-complexity pruning.

Key Takeaways

  1. Interpretable tree structure
  2. Gini vs entropy for splitting
  3. Pruning controls complexity

Advertisement

Advertisement

Need More Practice?

Get personalized data science help from ChatWhole's AI-powered platform.

Get Expert Help →