Machine learningMachine learning

Robust Decision Tree

A Robust Decision Tree is a decision tree variant trained with modified splitting criteria or training procedures designed to reduce sensitivity to outliers, label noise, and adversarial perturbations. Rather than minimizing standard impurity measures that are strongly affected by extreme values, robust variants use statistically robust analogues or regularization to produce splits that generalize under noisy or corrupted data conditions.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Chen, H., & Nan, F. (2019). Robust Decision Trees Against Adversarial Examples. Proceedings of the 36th International Conference on Machine Learning (ICML), PMLR 97, 1006–1015. link
  2. Hubert, M., & Debruyne, M. (2010). Minimum covariance determinant. Wiley Interdisciplinary Reviews: Computational Statistics, 2(1), 36–43. (background on robust estimation applied to tree splitting criteria) DOI: 10.1002/wics.61

Related methods

ScholarGateRobust Decision Tree (Robust Decision Tree (Outlier-Resistant Tree Induction)). Retrieved 2026-06-04 from https://scholargate.app/tr/machine-learning/robust-decision-tree