Technical note: Some properties of splitting criteria
From MaRDI portal
Publication:1916879
zbMath0849.68095MaRDI QIDQ1916879
Publication date: 14 July 1996
Published in: Machine Learning (Search for Journal in Brave)
Related Items (16)
Stability and scalability in decision trees ⋮ ClaSP: parameter-free time series segmentation ⋮ A branch \& bound algorithm to determine optimal cross-splits for decision tree induction ⋮ \textit{Kernel cuts}: kernel and spectral clustering meet regularization ⋮ Unnamed Item ⋮ First order random forests: Learning relational classifiers with complex aggregates ⋮ Semiparametric regression for discrete time-to-event data ⋮ A new node splitting measure for decision tree construction ⋮ Navigating random forests and related advances in algorithmic modeling ⋮ Aggregating expert predictions in a networked environment. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reusable components in decision tree induction algorithms ⋮ Moving towards efficient decision tree construction ⋮ A classification tree approach for the modeling of competing risks in discrete time ⋮ The effect of splitting on random forests
This page was built for publication: Technical note: Some properties of splitting criteria
