The following pages link to Alessandro Antonucci (Q473388):
Displaying 27 items.
- Robust classification of multivariate time series by imprecise hidden Markov models (Q473391) (← links)
- The multilabel naive credal classifier (Q518629) (← links)
- An aggregation framework based on coherent lower previsions: application to Zadeh's paradox and sensor networks (Q622262) (← links)
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees (Q622263) (← links)
- Fast algorithms for robust classification with Bayesian nets (Q881796) (← links)
- Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks (Q962637) (← links)
- (Q1621363) (redirect page) (← links)
- Credal ensembles of classifiers (Q1621364) (← links)
- Cautious classification with data missing not at random using generative random forests (Q2146029) (← links)
- A new score for adaptive tests in Bayesian and credal networks (Q2146042) (← links)
- Tractable inference in credal sentential decision diagrams (Q2206447) (← links)
- Approximate credal network updating by linear programming with applications to decision making (Q2344362) (← links)
- Evaluating interval-valued influence diagrams (Q2374538) (← links)
- Reliable knowledge-based adaptive tests by credal networks (Q2401878) (← links)
- Probabilistic graphical models (Q2875990) (← links)
- Trading off Speed and Accuracy in Multilabel Classification (Q2938401) (← links)
- Bayesian Networks with Imprecise Probabilities: Theory and Application to Classification (Q3113386) (← links)
- Likelihood-Based Robust Classification with Bayesian Networks (Q3143428) (← links)
- (Q3157511) (← links)
- (Q3416157) (← links)
- Variable Elimination for Interval-Valued Influence Diagrams (Q3451214) (← links)
- Decision Making with Hierarchical Credal Sets (Q5227399) (← links)
- Approximating Credal Network Inferences by Linear Programming (Q5326407) (← links)
- Probabilistic Inference in Credal Networks: New Complexity Results (Q5494858) (← links)
- Approximating counterfactual bounds while fusing observational, biased and randomised data sources (Q6066852) (← links)
- Robust Model Checking with Imprecise Markov Reward Models (Q6362407) (← links)
- Efficient computation of counterfactual bounds (Q6577658) (← links)
