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.
Izvorni zapis
Citati kopirani doslovno iz izvornog zapisa metode. Ne impliciraju nikakvu provjeru na razini tvrdnje.
- 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. · URL
- 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
Uređene tvrdnje
Tvrdnje pohranjene u knjigu dokaza, svaka s vlastitom procjenom.
Ovaj prikaz ne izmišlja procjenu tvrdnje kada knjiga dokaza nema nijednu.
Povezane metode
Generirano iz grafa metode i prikazano kao strojno predložene relacije — ne implicira se nikakva tvrdnja dokaza.