M. Zaffalon

From MaRDI portal
Person:146610

Available identifiers

zbMath Open zaffalon.marcoDBLP08/4633WikidataQ62057835 ScholiaQ62057835MaRDI QIDQ146610

List of research outcomes





PublicationDate of PublicationType
On negative conglomerability2024-10-18Paper
Efficient computation of counterfactual bounds2024-07-24Paper
Desirability foundations of robust rational decision making2024-01-26Paper
Approximating counterfactual bounds while fusing observational, biased and randomised data sources2023-11-16Paper
Correlated product of experts for sparse Gaussian process regression2023-06-27Paper
Nonlinear desirability theory2023-06-20Paper
Connecting classical finite exchangeability to quantum theory2023-06-06Paper
Quantum indistinguishability through exchangeability2022-12-08Paper
Nonlinear desirability as a linear classification problem2022-12-08Paper
Information algebras in the theory of imprecise probabilities, an extension2022-11-02Paper
Algebras of sets and coherent sets of gambles2022-06-15Paper
Why we should interpret density matrices as moment matrices: the case of (in)distinguishable particles and the emergence of classical reality2022-03-08Paper
Information algebras in the theory of imprecise probabilities2022-02-22Paper
The weirdness theorem and the origin of quantum paradoxes2021-12-27Paper
Quantum indistinguishability through exchangeable desirable gambles2021-05-10Paper
Recursive estimation for sparse Gaussian process regression2020-10-01Paper
Imprecise Dirichlet process with application to the hypothesis test on the probability that \(X \leq Y\)2019-08-28Paper
Hierarchical estimation of parameters in Bayesian networks2019-05-24Paper
Sum-of-squares for bounded rationality2019-02-20Paper
Approximate structure learning for large Bayesian networks2018-12-07Paper
Bayesian network data imputation with application to survival tree analysis2018-08-15Paper
Entropy-based pruning for learning Bayesian networks using BIC2018-06-27Paper
Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets2018-06-15Paper
Approximate structure learning for large Bayesian networks2018-05-07Paper
https://portal.mardi4nfdi.de/entity/Q46369862018-04-17Paper
Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets2018-04-01Paper
Statistical comparison of classifiers through Bayesian hierarchical modelling2018-02-02Paper
A Gleason-type theorem for any dimension based on a gambling formulation of quantum mechanics2018-01-08Paper
A polarity theory for sets of desirable gambles2017-05-26Paper
Quantum rational preferences and desirability2016-10-21Paper
Conformity and independence with coherent lower previsions2016-10-17Paper
Conglomerable Coherent Lower Previsions2016-05-13Paper
Reliable survival analysis based on the Dirichlet process2016-05-04Paper
Prior near ignorance for inferences in thek-parameter exponential family2016-01-04Paper
Learning extended tree augmented naive structures2015-12-03Paper
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables2015-08-27Paper
Reliable survival analysis based on the Dirichlet process2015-08-22Paper
Approximate credal network updating by linear programming with applications to decision making2015-05-15Paper
Min-BDeu and max-BDeu scores for learning Bayesian networks2015-01-14Paper
Extended tree augmented naive classifier2015-01-14Paper
Probabilistic graphical models2014-08-12Paper
Classification2014-08-12Paper
Comments on ``Imprecise probability models for learning multinomial distributions from data. applications to learning credal networks2014-07-29Paper
Approximating credal network inferences by linear programming2013-08-05Paper
Evaluating credal classifiers by utility-discounted predictive accuracy2013-06-13Paper
Updating credal networks is approximable in polynomial time2013-06-13Paper
Solving limited memory influence diagrams2012-08-27Paper
A model of prior ignorance for inferences in the one-parameter exponential family2012-05-18Paper
Bayesian networks with imprecise probabilities: theory and application to classification2012-02-09Paper
Learning reliable classifiers from small or incomplete data sets: the naive credal classifier 22011-11-08Paper
Epistemic irrelevance in credal nets: the case of imprecise Markov trees2011-01-31Paper
Inference and risk measurement with the pari-mutuel model2011-01-31Paper
Limits of learning about a categorical latent variable under prior near-ignorance2010-04-07Paper
Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks2010-04-07Paper
Bayesian treatment of incomplete discrete data applied to mutual information and feature selection2010-03-03Paper
Distribution of mutual information from complete and incomplete data2008-11-26Paper
Learning about a Categorical Latent Variable under Prior Near-Ignorance2007-05-29Paper
Notes on ``Notes on conditional previsions2007-05-18Paper
Fast algorithms for robust classification with Bayesian nets2007-05-18Paper
https://portal.mardi4nfdi.de/entity/Q34161572007-01-19Paper
Robust inference of trees2006-04-04Paper
Updating beliefs with incomplete observations2006-02-07Paper
https://portal.mardi4nfdi.de/entity/Q31575112005-01-19Paper
Tree-based credal networks for classification2003-11-10Paper
The naive credal classifier2002-08-28Paper
Exact credal treatment of missing data2002-08-28Paper
https://portal.mardi4nfdi.de/entity/Q45338852002-06-11Paper
https://portal.mardi4nfdi.de/entity/Q44245702000-01-01Paper
2U: an exact interval propagation algorithm for polytrees with binary variables1999-01-12Paper
A note about redundancy in influence diagrams1998-01-01Paper

Research outcomes over time

This page was built for person: M. Zaffalon