The following pages link to (Q3096123):
Displaying 15 items.
- Credal model averaging for classification: representing prior ignorance and expert opinions (Q473394) (← links)
- The multilabel naive credal classifier (Q518629) (← links)
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees (Q622263) (← links)
- A tree augmented classifier based on extreme imprecise Dirichlet model (Q622264) (← links)
- A unified view of class-selection with probabilistic classifiers (Q898341) (← links)
- Credal ensembles of classifiers (Q1621364) (← links)
- Efficient set-valued prediction in multi-class classification (Q2036773) (← links)
- Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods (Q2051254) (← links)
- A robust algorithm for explaining unreliable machine learning survival models using the Kolmogorov-Smirnov bounds (Q2057739) (← links)
- Thirty years of credal networks: specification, algorithms and complexity (Q2206469) (← links)
- Techniques for dealing with incomplete data: a tutorial and survey (Q2337405) (← links)
- Evaluating credal classifiers by utility-discounted predictive accuracy (Q2375326) (← links)
- Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks (Q2509602) (← links)
- An Empirical Comparison of Bayesian and Credal Set Theory for Discrete State Estimation (Q3163974) (← links)
- Desirability foundations of robust rational decision making (Q6142422) (← links)
