Julian Belz

Normalized L1 regularization for axis-oblique tree construction algorithms

2017

Axis-oblique decision trees have been proposed to effectively deal with high-dimensional input spaces, weakening the effects of the curse of dimensionality. Usually the axis-oblique partitioning is obtained by nonlinear optimization techniques, introducing additional flexibility together …