applicable models
tree based
Techniques for tree-based algorithms (decision trees, random forests, gradient boosting)
3 techniques
| Goals | Models | Data Types | Description | |||
|---|---|---|---|---|---|---|
| Mean Decrease Impurity | Algorithmic | Architecture/tree Based Paradigm/supervised +1 | Tabular | Mean Decrease Impurity (MDI) quantifies a feature's importance in tree-based models (e.g., Random Forests, Gradient... | ||
| Monotonicity Constraints | Algorithmic | Architecture/probabilistic/gaussian Processes Architecture/tree Based +2 | Tabular | Monotonicity constraints enforce consistent directional relationships between input features and model predictions,... | ||
| Intrinsically Interpretable Models | Algorithmic | Architecture/linear Models Architecture/tree Based +2 | Any | Intrinsically interpretable models are machine learning algorithms that are transparent by design, allowing users to... |
Rows per page
Page 1 of 1