Marco Zaffalon

According to our database1, Marco Zaffalon authored at least 105 papers between 1997 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Information algebras of coherent sets of gambles.
CoRR, 2021

2020
EM Based Bounding of Unidentifiable Queries in Structural Causal Models.
CoRR, 2020

Automatic Forecasting using Gaussian Processes.
CoRR, 2020

Structural Causal Models Are (Solvable by) Credal Networks.
CoRR, 2020

Orthogonally Decoupled Variational Fourier Features.
CoRR, 2020

Recursive estimation for sparse Gaussian process regression.
Autom., 2020

Compatibility, desirability, and the running intersection property.
Artif. Intell., 2020

Sampling Subgraphs with Guaranteed Treewidth for Accurate and Efficient Graphical Inference.
Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020

Probabilistic Reconciliation of Hierarchical Forecast via Bayes' Rule.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

Social Pooling of Beliefs and Values with Desirability.
Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, 2020

2019
Sum-of-squares for bounded rationality.
Int. J. Approx. Reason., 2019

Hierarchical estimation of parameters in Bayesian networks.
Comput. Stat. Data Anal., 2019

Computational Complexity and the Nature of Quantum Mechanics.
CoRR, 2019

Computational Complexity and the Nature of Quantum Mechanics (Extended version).
CoRR, 2019

Bernstein's Socks, Polynomial-Time Provable Coherence and Entanglement.
Proceedings of the International Symposium on Imprecise Probabilities: Theories and Applications, 2019

2018
Approximate structure learning for large Bayesian networks.
Mach. Learn., 2018

Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets.
Int. J. Approx. Reason., 2018

Entropy-based pruning for learning Bayesian networks using BIC.
Artif. Intell., 2018

Compatibility, Coherence and the RIP.
Proceedings of the Uncertainty Modelling in Data Science, 2018

2017
Statistical comparison of classifiers through Bayesian hierarchical modelling.
Mach. Learn., 2017

Time for a Change: a Tutorial for Comparing Multiple Classifiers Through Bayesian Analysis.
J. Mach. Learn. Res., 2017

Axiomatising Incomplete Preferences through Sets of Desirable Gambles.
J. Artif. Intell. Res., 2017

A Polarity Theory for Sets of Desirable Gambles.
Proceedings of the Tenth International Symposium on Imprecise Probability: Theories and Applications, 2017

SOS for Bounded Rationality.
Proceedings of the Tenth International Symposium on Imprecise Probability: Theories and Applications, 2017

Hierarchical Multinomial-Dirichlet Model for the Estimation of Conditional Probability Tables.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

Improved Local Search in Bayesian Networks Structure Learning.
Proceedings of the 3rd Workshop on Advanced Methodologies for Bayesian Networks, 2017

2016
Conformity and independence with coherent lower previsions.
Int. J. Approx. Reason., 2016

Learning extended tree augmented naive structures.
Int. J. Approx. Reason., 2016

Bayesian network data imputation with application to survival tree analysis.
Comput. Stat. Data Anal., 2016

Learning Bounded Treewidth Bayesian Networks with Thousands of Variables.
CoRR, 2016

State Space representation of non-stationary Gaussian Processes.
CoRR, 2016

Full Conglomerability, Continuity and Marginal Extension.
Proceedings of the Soft Methods for Data Science, 2016

Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Quantum Rational Preferences and Desirability.
Proceedings of the NIPS 2016 Workshop on Imperfect Decision Makers: Admitting Real-World Rationality, 2016

2015
On the problem of computing the conglomerable natural extension.
Int. J. Approx. Reason., 2015

Approximate credal network updating by linear programming with applications to decision making.
Int. J. Approx. Reason., 2015

Desirability and the birth of incomplete preferences.
CoRR, 2015

Bayesian Hypothesis Testing in Machine Learning.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2015

Learning Bayesian Networks with Thousands of Variables.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

A Bayesian nonparametric procedure for comparing algorithms.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Comments on "Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks" by Andrés R. Masegosa and Serafín Moral.
Int. J. Approx. Reason., 2014

Min-BDeu and Max-BDeu Scores for Learning Bayesian Networks.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014

Extended Tree Augmented Naive Classifier.
Proceedings of the Probabilistic Graphical Models - 7th European Workshop, 2014

A Bayesian Wilcoxon signed-rank test based on the Dirichlet process.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
Conglomerable coherence.
Int. J. Approx. Reason., 2013

Probability and time.
Artif. Intell., 2013

On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables.
Artif. Intell., 2013

CREDO: A military decision-support system based on credal networks.
Proceedings of the 16th International Conference on Information Fusion, 2013

Approximating Credal Network Inferences by Linear Programming.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2013

2012
Solving Limited Memory Influence Diagrams.
J. Artif. Intell. Res., 2012

Evaluating credal classifiers by utility-discounted predictive accuracy.
Int. J. Approx. Reason., 2012

Conglomerable natural extension.
Int. J. Approx. Reason., 2012

Updating credal networks is approximable in polynomial time.
Int. J. Approx. Reason., 2012

The Complexity of Approximately Solving Influence Diagrams.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Conglomerable Coherent Lower Previsions.
Proceedings of the Synergies of Soft Computing and Statistics for Intelligent Data Analysis, 2012

2011
Robust Filtering Through Coherent Lower Previsions.
IEEE Trans. Autom. Control., 2011

Independent natural extension.
Artif. Intell., 2011

2010
Inference and risk measurement with the pari-mutuel model.
Int. J. Approx. Reason., 2010

Epistemic irrelevance in credal nets: The case of imprecise Markov trees.
Int. J. Approx. Reason., 2010

Generalized loopy 2U: A new algorithm for approximate inference in credal networks.
Int. J. Approx. Reason., 2010

Notes on desirability and conditional lower previsions.
Ann. Math. Artif. Intell., 2010

Factorisation Properties of the Strong Product.
Proceedings of the Combining Soft Computing and Statistical Methods in Data Analysis, 2010

2009
Conservative Inference Rule for Uncertain Reasoning under Incompleteness.
J. Artif. Intell. Res., 2009

Limits of learning about a categorical latent variable under prior near-ignorance.
Int. J. Approx. Reason., 2009

Credal networks for military identification problems.
Int. J. Approx. Reason., 2009

Coherence graphs.
Artif. Intell., 2009

Lazy naive credal classifier.
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data, 2009

Reproducing human decisions in reservoir management: the case of lake Lugano.
Proceedings of the Information Technologies in Environmental Engineering, 2009

Reliable hidden Markov model filtering through coherent lower previsions.
Proceedings of the 12th International Conference on Information Fusion, 2009

Multiple model tracking by imprecise markov trees.
Proceedings of the 12th International Conference on Information Fusion, 2009

2008
Learning Reliable Classifiers From Small or Incomplete Data Sets: The Naive Credal Classifier 2.
J. Mach. Learn. Res., 2008

Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks.
Int. J. Approx. Reason., 2008

JNCC2: An extension of naive Bayes classifier suited for small and incomplete data sets.
Environ. Model. Softw., 2008

Credal Model Averaging: An Extension of Bayesian Model Averaging to Imprecise Probabilities.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008

Naive credal classifier 2: an extension of naive Bayes for delivering robust classifications.
Proceedings of The 2008 International Conference on Data Mining, 2008

2007
Notes on "Notes on conditional previsions".
Int. J. Approx. Reason., 2007

Fast algorithms for robust classification with Bayesian nets.
Int. J. Approx. Reason., 2007

Credal Networks for Operational Risk Measurement and Management.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2007

2006
Binarization Algorithms for Approximate Updating in Credal Nets.
Proceedings of the STAIRS 2006, 2006

Equivalence Between Bayesian and Credal Nets on an Updating Problem.
Proceedings of the Soft Methods for Integrated Uncertainty Modelling, 2006

Classification of Dementia Types from Cognitive Profiles Data.
Proceedings of the Knowledge Discovery in Databases: PKDD 2006, 2006

Locally specified credal networks.
Proceedings of the Third European Workshop on Probabilistic Graphical Models, 2006

2005
Credibility via imprecise probability.
Int. J. Approx. Reason., 2005

Credible classification for environmental problems.
Environ. Model. Softw., 2005

Distribution of mutual information from complete and incomplete data.
Comput. Stat. Data Anal., 2005

Robust inference of trees.
Ann. Math. Artif. Intell., 2005

Editorial: Imprecise probability perspectives on artificial intelligence.
Ann. Math. Artif. Intell., 2005

Conservative Rules for Predictive Inference with Incomplete Data.
Proceedings of the ISIPTA '05, 2005

Limits of Learning from Imperfect Observations under Prior Ignorance: the Case of the Imprecise Dirichlet Model.
Proceedings of the ISIPTA '05, 2005

2004
Updating beliefs with incomplete observations.
Artif. Intell., 2004

2003
Tree-Based Credal Networks for Classification.
Reliab. Comput., 2003

Reliable diagnoses of dementia by the naive credal classifier inferred from incomplete cognitive data.
Artif. Intell. Medicine, 2003

Updating with incomplete observations.
Proceedings of the UAI '03, 2003

Bayesian Treatment of Incomplete Discrete Data Applied to Mutual Information and Feature Selection.
Proceedings of the KI 2003: Advances in Artificial Intelligence, 2003

Preface: Proceedings of the Third International Symposium on Imprecise Probabilities and Their Applications.
Proceedings of the ISIPTA '03, 2003

2002
Robust Feature Selection by Mutual Information Distributions.
Proceedings of the UAI '02, 2002

2001
An optimization methodology for intermodal terminal management.
J. Intell. Manuf., 2001

Robust discovery of tree-dependency structures.
Proceedings of the ISIPTA '01, 2001

Statistical inference of the naive credal classifier.
Proceedings of the ISIPTA '01, 2001

Credal Classification for Dementia Screening.
Proceedings of the Artificial Intelligence Medicine, 2001

1999
A Credal Approach to Naive Classification.
Proceedings of the ISIPTA '99, Proceedings of the First International Symposium on Imprecise Probabilities and Their Applications, held at the Conference Center "Het Pand" of the Universiteit Gent, Ghent, Belgium, 29 June, 1999

1998
Simulation and Planning of an Intermodal Container Terminal.
Simul., 1998

A note about redundancy in influence diagrams.
Int. J. Approx. Reason., 1998

2U: An Exact Interval Propagation Algorithm for Polytrees with Binary Variables.
Artif. Intell., 1998

1997
Constraint Logic Programming and Integer Programming Approaches and Their Collaboration in Solving an Assignment Scheduling Problem.
Constraints An Int. J., 1997


  Loading...