Pages that link to "Item:Q1916879"
From MaRDI portal
The following pages link to Technical note: Some properties of splitting criteria (Q1916879):
Displaying 20 items.
- Theoretical comparison between the Gini Index and Information Gain criteria (Q596490) (← links)
- Splitting methods for decision tree induction: An exploration of the relative performance of two entropy-based families (Q851794) (← links)
- A new node splitting measure for decision tree construction (Q975179) (← links)
- Navigating random forests and related advances in algorithmic modeling (Q975577) (← links)
- Moving towards efficient decision tree construction (Q1006753) (← links)
- Stability and scalability in decision trees (Q1887226) (← links)
- A branch \& bound algorithm to determine optimal cross-splits for decision tree induction (Q2188762) (← links)
- \textit{Kernel cuts}: kernel and spectral clustering meet regularization (Q2193808) (← links)
- A classification tree approach for the modeling of competing risks in discrete time (Q2303058) (← links)
- The effect of splitting on random forests (Q2347711) (← links)
- First order random forests: Learning relational classifiers with complex aggregates (Q2433184) (← links)
- Reusable components in decision tree induction algorithms (Q2512776) (← links)
- Random forests, decision trees, and categorical predictors: the ``absent levels'' problem (Q4558194) (← links)
- (Q4558507) (← links)
- (Q4998872) (← links)
- Semiparametric regression for discrete time-to-event data (Q5142211) (← links)
- Aggregating expert predictions in a networked environment. (Q5945326) (← links)
- ClaSP: parameter-free time series segmentation (Q6040514) (← links)
- Building Trees for Probabilistic Prediction via Scoring Rules (Q6637486) (← links)
- Time-penalised trees (\texttt{TpT}): introducing a new tree-based data mining algorithm for time-varying covariates (Q6661058) (← links)
