Bayesian networks with imprecise probabilities: theory and application to classification
From MaRDI portal
Recommendations
Cited in
(18)- Confidence intervals for probabilistic network classifiers
- Evaluating credal classifiers by utility-discounted predictive accuracy
- Multilabel predictions with sets of probabilities: the Hamming and ranking loss cases
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- On the median in imprecise ordinal problems
- Likelihood-based robust classification with Bayesian networks
- Explaining robust classification through prime implicants
- Cautious label ranking with label-wise decomposition
- Recent advances in imprecise-probabilistic graphical models
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Multilabel prediction with probability sets: the Hamming loss case
- Comments on ``Imprecise probability models for learning multinomial distributions from data. applications to learning credal networks
- Learning with imprecise probabilities as model selection and averaging
- When in Doubt ... Be Indecisive
- Application of uncertainty measures on credal sets on the naive Bayesian classifier
- Credal ensembles of classifiers
- Interval-based ranking in noisy evolutionary multi-objective optimization
- Approximate credal network updating by linear programming with applications to decision making
This page was built for publication: Bayesian networks with imprecise probabilities: theory and application to classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113386)