Pages that link to "Item:Q149051"

The following pages link to Building classification trees using the total uncertainty criterion (Q149051):

Displaying 17 items.

• imptree (Q149052) (← links)
• Maximising entropy on the nonparametric predictive inference model for multinomial data (Q421497) (← links)
• Supervised classification using probabilistic decision graphs (Q961276) (← links)
• Classification with decision trees from a nonparametric predictive inference perspective (Q1621360) (← links)
• A new robust classifier on noise domains: bagging of Credal C4.5 trees (Q1694254) (← links)
• A robust algorithm for explaining unreliable machine learning survival models using the Kolmogorov-Smirnov bounds (Q2057739) (← links)
• Using credal C4.5 for calibrated label ranking in multi-label classification (Q2152513) (← links)
• Evaluating credal classifiers by utility-discounted predictive accuracy (Q2375326) (← links)
• An introduction to the imprecise Dirichlet model for multinomial data (Q2386113) (← links)
• Measures of divergence on credal sets (Q2493979) (← links)
• Credal sets representable by reachable probability intervals and belief functions (Q2658036) (← links)
• Equivalence relations among dominance concepts on probability intervals and general credal sets (Q3168396) (← links)
• Uncertainty measures on probability intervals from the imprecise Dirichlet model (Q3426360) (← links)
• Split Criterions for Variable Selection Using Decision Trees (Q3524957) (← links)
• Combining Decision Trees Based on Imprecise Probabilities and Uncertainty Measures (Q3524959) (← links)
• Requirements for total uncertainty measures in Dempster–Shafer theory of evidence (Q3549310) (← links)
• A two-step anomaly detection based method for PU classification in imbalanced data sets (Q6040516) (← links)