default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Zaffalon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j61]Marco Zaffalon, Alessandro Antonucci
, Rafael Cabañas, David Huber, Dario Azzimonti:
Efficient computation of counterfactual bounds. Int. J. Approx. Reason. 171: 109111 (2024)- [c59]Vani Kanjirangat, Alessandro Antonucci, Marco Zaffalon:
On the Limitations of Zero-Shot Classification of Causal Relations by LLMs. Text2Story@ECIR 2024: 151-160 - [i38]Marco Zaffalon, Alessandro Antonucci:
A Note on Bayesian Networks with Latent Root Variables. CoRR abs/2402.17087 (2024) - 2023
- [j60]Arianna Casanova, Alessio Benavoli, Marco Zaffalon:
Nonlinear desirability as a linear classification problem. Int. J. Approx. Reason. 152: 1-32 (2023) - [j59]Enrique Miranda, Marco Zaffalon:
Nonlinear desirability theory. Int. J. Approx. Reason. 154: 176-199 (2023) - [j58]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber:
Approximating counterfactual bounds while fusing observational, biased and randomised data sources. Int. J. Approx. Reason. 162: 109023 (2023) - [j57]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Correlated product of experts for sparse Gaussian process regression. Mach. Learn. 112(5): 1411-1432 (2023) - [c58]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Closure operators, classifiers and desirability. ISIPTA 2023: 25-36 - [i37]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti:
Efficient Computation of Counterfactual Bounds. CoRR abs/2307.08304 (2023) - [i36]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber:
Approximating Counterfactual Bounds while Fusing Observational, Biased and Randomised Data Sources. CoRR abs/2307.16577 (2023) - [i35]David Huber, Yizuo Chen, Alessandro Antonucci, Adnan Darwiche, Marco Zaffalon:
Tractable Bounding of Counterfactual Queries by Knowledge Compilation. CoRR abs/2310.03352 (2023) - [i34]Alessandro Antonucci, Gregorio Piqué, Marco Zaffalon:
Zero-shot Causal Graph Extrapolation from Text via LLMs. CoRR abs/2312.14670 (2023) - 2022
- [j56]Arianna Casanova, Juerg Kohlas, Marco Zaffalon:
Information algebras in the theory of imprecise probabilities. Int. J. Approx. Reason. 142: 383-416 (2022) - [j55]Arianna Casanova, Juerg Kohlas, Marco Zaffalon:
Information algebras in the theory of imprecise probabilities, an extension. Int. J. Approx. Reason. 150: 311-336 (2022) - [j54]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Quantum indistinguishability through exchangeability. Int. J. Approx. Reason. 151: 389-412 (2022) - [c57]Arianna Casanova, Enrique Miranda, Marco Zaffalon:
Joint Desirability Foundations of Social Choice and Opinion Pooling. ISAIM 2022 - [c56]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti:
Bounding Counterfactuals under Selection Bias. PGM 2022: 289-300 - [i33]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti:
Bounding Counterfactuals under Selection Bias. CoRR abs/2208.01417 (2022) - [i32]Enrique Miranda, Marco Zaffalon:
Nonlinear desirability theory. CoRR abs/2209.00686 (2022) - [i31]Marco Zaffalon, Alessandro Antonucci, David Huber, Rafael Cabañas:
Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data. CoRR abs/2212.02932 (2022) - 2021
- [j53]Arianna Casanova, Enrique Miranda, Marco Zaffalon:
Joint desirability foundations of social choice and opinion pooling. Ann. Math. Artif. Intell. 89(10-11): 965-1011 (2021) - [j52]Marco Zaffalon, Enrique Miranda:
Desirability foundations of robust rational decision making. Synth. 198(27): 6529-6570 (2021) - [c55]Arianna Casanova, Jürg Kohlas, Marco Zaffalon:
Algebras of Sets and Coherent Sets of Gambles. ECSQARU 2021: 603-615 - [c54]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Quantum Indistinguishability through Exchangeable Desirable Gambles. ISIPTA 2021: 22-31 - [c53]Arianna Casanova, Alessio Benavoli, Marco Zaffalon:
Nonlinear Desirability as a Linear Classification Problem. ISIPTA 2021: 61-71 - [c52]Jürg Kohlas, Arianna Casanova, Marco Zaffalon:
Information Algebras of Coherent Sets of Gambles in General Possibility Spaces. ISIPTA 2021: 191-200 - [c51]Marco Zaffalon, Enrique Miranda:
The Sure Thing. ISIPTA 2021: 342-351 - [c50]Giorgio Corani, Alessio Benavoli, Marco Zaffalon:
Time Series Forecasting with Gaussian Processes Needs Priors. ECML/PKDD (4) 2021: 103-117 - [i30]Jürg Kohlas, Arianna Casanova, Marco Zaffalon:
Information algebras of coherent sets of gambles. CoRR abs/2102.13368 (2021) - [i29]Jürg Kohlas, Arianna Casanova, Marco Zaffalon:
Information algebras of coherent sets of gambles in general possibility spaces. CoRR abs/2105.12037 (2021) - [i28]Jürg Kohlas, Arianna Casanova, Marco Zaffalon:
Algebras of Sets and Coherent Sets of Gambles. CoRR abs/2105.12986 (2021) - [i27]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Correlated Product of Experts for Sparse Gaussian Process Regression. CoRR abs/2112.09519 (2021) - 2020
- [j51]Enrique Miranda, Marco Zaffalon:
Compatibility, desirability, and the running intersection property. Artif. Intell. 283: 103274 (2020) - [j50]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Recursive estimation for sparse Gaussian process regression. Autom. 120: 109127 (2020) - [c49]Arianna Casanova, Enrique Miranda, Marco Zaffalon:
Social Pooling of Beliefs and Values with Desirability. FLAIRS 2020: 569-574 - [c48]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas:
Structural Causal Models Are (Solvable by) Credal Networks. PGM 2020: 581-592 - [c47]Rafael Cabañas, Alessandro Antonucci, David Huber, Marco Zaffalon:
CREDICI: A Java Library for Causal Inference by Credal Networks. PGM 2020: 597-600 - [c46]David Huber, Rafael Cabañas, Alessandro Antonucci, Marco Zaffalon:
CREMA: A Java Library for Credal Network Inference. PGM 2020: 613-616 - [c45]Giorgio Corani, Dario Azzimonti, João P. S. C. Augusto, Marco Zaffalon:
Probabilistic Reconciliation of Hierarchical Forecast via Bayes' Rule. ECML/PKDD (3) 2020: 211-226 - [c44]Jaemin Yoo, U Kang, Mauro Scanagatta, Giorgio Corani, Marco Zaffalon:
Sampling Subgraphs with Guaranteed Treewidth for Accurate and Efficient Graphical Inference. WSDM 2020: 708-716 - [i26]Dario Azzimonti, Manuel Schürch, Alessio Benavoli, Marco Zaffalon:
Orthogonally Decoupled Variational Fourier Features. CoRR abs/2007.06363 (2020) - [i25]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas:
Structural Causal Models Are (Solvable by) Credal Networks. CoRR abs/2008.00463 (2020) - [i24]Giorgio Corani, Alessio Benavoli, João P. S. C. Augusto, Marco Zaffalon:
Automatic Forecasting using Gaussian Processes. CoRR abs/2009.08102 (2020) - [i23]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas:
EM Based Bounding of Unidentifiable Queries in Structural Causal Models. CoRR abs/2011.02912 (2020)
2010 – 2019
- 2019
- [j49]Laura Azzimonti, Giorgio Corani, Marco Zaffalon:
Hierarchical estimation of parameters in Bayesian networks. Comput. Stat. Data Anal. 137: 67-91 (2019) - [j48]Alessio Benavoli, Alessandro Facchini, Dario Piga, Marco Zaffalon:
Sum-of-squares for bounded rationality. Int. J. Approx. Reason. 105: 130-152 (2019) - [c43]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Bernstein's Socks, Polynomial-Time Provable Coherence and Entanglement. ISIPTA 2019: 23-31 - [i22]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Computational Complexity and the Nature of Quantum Mechanics (Extended version). CoRR abs/1902.03513 (2019) - [i21]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Computational Complexity and the Nature of Quantum Mechanics. CoRR abs/1902.04569 (2019) - [i20]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Recursive Estimation for Sparse Gaussian Process Regression. CoRR abs/1905.11711 (2019) - 2018
- [j47]Cassio P. de Campos, Mauro Scanagatta, Giorgio Corani, Marco Zaffalon:
Entropy-based pruning for learning Bayesian networks using BIC. Artif. Intell. 260: 42-50 (2018) - [j46]Mauro Scanagatta, Giorgio Corani, Marco Zaffalon, Jaemin Yoo, U Kang:
Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets. Int. J. Approx. Reason. 95: 152-166 (2018) - [j45]Mauro Scanagatta, Giorgio Corani, Cassio Polpo de Campos, Marco Zaffalon:
Approximate structure learning for large Bayesian networks. Mach. Learn. 107(8-10): 1209-1227 (2018) - [c42]Enrique Miranda, Marco Zaffalon:
Compatibility, Coherence and the RIP. SMPS 2018: 166-174 - [i19]Mauro Scanagatta, Giorgio Corani, Marco Zaffalon, Jaemin Yoo, U Kang:
Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets. CoRR abs/1802.02468 (2018) - 2017
- [j44]Marco Zaffalon, Enrique Miranda:
Axiomatising Incomplete Preferences through Sets of Desirable Gambles. J. Artif. Intell. Res. 60: 1057-1126 (2017) - [j43]Alessio Benavoli, Giorgio Corani, Janez Demsar, Marco Zaffalon:
Time for a Change: a Tutorial for Comparing Multiple Classifiers Through Bayesian Analysis. J. Mach. Learn. Res. 18: 77:1-77:36 (2017) - [j42]Giorgio Corani, Alessio Benavoli, Janez Demsar, Francesca Mangili, Marco Zaffalon:
Statistical comparison of classifiers through Bayesian hierarchical modelling. Mach. Learn. 106(11): 1817-1837 (2017) - [c41]Mauro Scanagatta, Giorgio Corani, Marco Zaffalon:
Improved Local Search in Bayesian Networks Structure Learning. AMBN 2017: 45-56 - [c40]Laura Azzimonti, Giorgio Corani, Marco Zaffalon:
Hierarchical Multinomial-Dirichlet Model for the Estimation of Conditional Probability Tables. ICDM 2017: 739-744 - [c39]Alessio Benavoli, Alessandro Facchini, Dario Piga, Marco Zaffalon:
SOS for Bounded Rationality. ISIPTA 2017: 25-36 - [c38]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon, José Vicente-Pérez:
A Polarity Theory for Sets of Desirable Gambles. ISIPTA 2017: 37-48 - [i18]Cassio P. de Campos, Mauro Scanagatta, Giorgio Corani, Marco Zaffalon:
Entropy-based Pruning for Learning Bayesian Networks using BIC. CoRR abs/1707.06194 (2017) - 2016
- [j41]Paola M. V. Rancoita, Marco Zaffalon, Emanuele Zucca, Francesco Bertoni, Cassio P. de Campos:
Bayesian network data imputation with application to survival tree analysis. Comput. Stat. Data Anal. 93: 373-387 (2016) - [j40]Cassio P. de Campos, Giorgio Corani, Mauro Scanagatta, Marco Cuccu, Marco Zaffalon:
Learning extended tree augmented naive structures. Int. J. Approx. Reason. 68: 153-163 (2016) - [j39]Enrique Miranda, Marco Zaffalon:
Conformity and independence with coherent lower previsions. Int. J. Approx. Reason. 78: 125-137 (2016) - [c37]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Quantum Rational Preferences and Desirability. IDM@NIPS 2016: 87-96 - [c36]Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon:
Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables. NIPS 2016: 1462-1470 - [c35]Enrique Miranda, Marco Zaffalon:
Full Conglomerability, Continuity and Marginal Extension. SMPS 2016: 355-362 - [i17]Alessio Benavoli, Marco Zaffalon:
State Space representation of non-stationary Gaussian Processes. CoRR abs/1601.01544 (2016) - [i16]Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon:
Learning Bounded Treewidth Bayesian Networks with Thousands of Variables. CoRR abs/1605.03392 (2016) - [i15]Alessio Benavoli, Giorgio Corani, Janez Demsar, Marco Zaffalon:
Time for a change: a tutorial for comparing multiple classifiers through Bayesian analysis. CoRR abs/1606.04316 (2016) - [i14]Giorgio Corani, Alessio Benavoli, Janez Demsar, Francesca Mangili, Marco Zaffalon:
Statistical comparison of classifiers through Bayesian hierarchical modelling. CoRR abs/1609.08905 (2016) - 2015
- [j38]Enrique Miranda, Marco Zaffalon:
On the problem of computing the conglomerable natural extension. Int. J. Approx. Reason. 56: 1-27 (2015) - [j37]Alessandro Antonucci, Cassio P. de Campos, David Huber, Marco Zaffalon:
Approximate credal network updating by linear programming with applications to decision making. Int. J. Approx. Reason. 58: 25-38 (2015) - [c34]Alessio Benavoli, Giorgio Corani, Francesca Mangili, Marco Zaffalon:
A Bayesian nonparametric procedure for comparing algorithms. ICML 2015: 1264-1272 - [c33]Mauro Scanagatta, Cassio P. de Campos, Giorgio Corani, Marco Zaffalon:
Learning Bayesian Networks with Thousands of Variables. NIPS 2015: 1864-1872 - [c32]Giorgio Corani, Alessio Benavoli, Francesca Mangili, Marco Zaffalon:
Bayesian Hypothesis Testing in Machine Learning. ECML/PKDD (3) 2015: 199-202 - [i13]Marco Zaffalon, Enrique Miranda:
Desirability and the birth of incomplete preferences. CoRR abs/1506.00529 (2015) - 2014
- [j36]Marco Zaffalon, Giorgio Corani:
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. 55(7): 1597-1600 (2014) - [c31]Alessio Benavoli, Giorgio Corani, Francesca Mangili, Marco Zaffalon, Fabrizio Ruggeri:
A Bayesian Wilcoxon signed-rank test based on the Dirichlet process. ICML 2014: 1026-1034 - [c30]Cassio P. de Campos, Marco Cuccu, Giorgio Corani, Marco Zaffalon:
Extended Tree Augmented Naive Classifier. Probabilistic Graphical Models 2014: 176-189 - [c29]Mauro Scanagatta, Cassio P. de Campos, Marco Zaffalon:
Min-BDeu and Max-BDeu Scores for Learning Bayesian Networks. Probabilistic Graphical Models 2014: 426-441 - [i12]Marco Zaffalon, Enrique Miranda:
Conservative Inference Rule for Uncertain Reasoning under Incompleteness. CoRR abs/1401.3471 (2014) - [i11]Marco Zaffalon, Marcus Hutter:
Robust Feature Selection by Mutual Information Distributions. CoRR abs/1408.1487 (2014) - [i10]Gert de Cooman, Marco Zaffalon:
Updating with incomplete observations. CoRR abs/1408.1488 (2014) - 2013
- [j35]Marco Zaffalon, Enrique Miranda:
Probability and time. Artif. Intell. 198: 1-51 (2013) - [j34]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables. Artif. Intell. 205: 30-38 (2013) - [j33]Enrique Miranda, Marco Zaffalon:
Conglomerable coherence. Int. J. Approx. Reason. 54(9): 1322-1350 (2013) - [c28]Alessandro Antonucci, Cassio P. de Campos, David Huber, Marco Zaffalon:
Approximating Credal Network Inferences by Linear Programming. ECSQARU 2013: 13-24 - [c27]Alessandro Antonucci, David Huber, Marco Zaffalon, Philippe Luginbuhl, Ian Chapman, Richard Ladouceur:
CREDO: A military decision-support system based on credal networks. FUSION 2013: 1942-1949 - 2012
- [j32]Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon:
Updating credal networks is approximable in polynomial time. Int. J. Approx. Reason. 53(8): 1183-1199 (2012) - [j31]Enrique Miranda, Marco Zaffalon, Gert de Cooman:
Conglomerable natural extension. Int. J. Approx. Reason. 53(8): 1200-1227 (2012) - [j30]Marco Zaffalon, Giorgio Corani, Denis Deratani Mauá:
Evaluating credal classifiers by utility-discounted predictive accuracy. Int. J. Approx. Reason. 53(8): 1282-1301 (2012) - [j29]Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon:
Solving Limited Memory Influence Diagrams. J. Artif. Intell. Res. 44: 97-140 (2012) - [c26]Enrique Miranda, Marco Zaffalon:
Conglomerable Coherent Lower Previsions. SMPS 2012: 419-427 - [c25]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
The Complexity of Approximately Solving Influence Diagrams. UAI 2012: 604-613 - [i9]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
The Complexity of Approximately Solving Influence Diagrams. CoRR abs/1210.4890 (2012) - 2011
- [j28]Gert de Cooman, Enrique Miranda, Marco Zaffalon:
Independent natural extension. Artif. Intell. 175(12-13): 1911-1950 (2011) - [j27]Alessio Benavoli, Marco Zaffalon, Enrique Miranda:
Robust Filtering Through Coherent Lower Previsions. IEEE Trans. Autom. Control. 56(7): 1567-1581 (2011) - [i8]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
Solving Limited Memory Influence Diagrams. CoRR abs/1109.1754 (2011) - 2010
- [j26]Enrique Miranda, Marco Zaffalon:
Notes on desirability and conditional lower previsions. Ann. Math. Artif. Intell. 60(3-4): 251-309 (2010) - [j25]Alessandro Antonucci, Yi Sun, Cassio P. de Campos, Marco Zaffalon:
Generalized loopy 2U: A new algorithm for approximate inference in credal networks. Int. J. Approx. Reason. 51(5): 474-484 (2010) - [j24]Gert de Cooman, Filip Hermans, Alessandro Antonucci, Marco Zaffalon:
Epistemic irrelevance in credal nets: The case of imprecise Markov trees. Int. J. Approx. Reason. 51(9): 1029-1052 (2010) - [j23]Renato Pelessoni, Paolo Vicig, Marco Zaffalon:
Inference and risk measurement with the pari-mutuel model. Int. J. Approx. Reason. 51(9): 1145-1158 (2010) - [c24]Gert de Cooman, Enrique Miranda, Marco Zaffalon:
Independent Natural Extension. IPMU 2010: 737-746 - [c23]Gert de Cooman, Enrique Miranda, Marco Zaffalon:
Factorisation Properties of the Strong Product. SMPS 2010: 139-147 - [i7]Gert de Cooman, Filip Hermans, Alessandro Antonucci, Marco Zaffalon:
Epistemic irrelevance in credal nets: the case of imprecise Markov trees. CoRR abs/1008.2514 (2010)
2000 – 2009
- 2009
- [j22]Enrique Miranda, Marco Zaffalon:
Coherence graphs. Artif. Intell. 173(1): 104-144 (2009) - [j21]Alberto Piatti, Marco Zaffalon, Fabio Trojani, Marcus Hutter:
Limits of learning about a categorical latent variable under prior near-ignorance. Int. J. Approx. Reason. 50(4): 597-611 (2009) - [j20]Alessandro Antonucci, Ralph Brühlmann, Alberto Piatti, Marco Zaffalon:
Credal networks for military identification problems. Int. J. Approx. Reason. 50(4): 666-679 (2009) - [j19]Marco Zaffalon, Enrique Miranda:
Conservative Inference Rule for Uncertain Reasoning under Incompleteness. J. Artif. Intell. Res. 34: 757-821 (2009) - [c22]Alessio Benavoli, Marco Zaffalon, Enrique Miranda:
Reliable hidden Markov model filtering through coherent lower previsions. FUSION 2009: 1743-1750 - [c21]Alessandro Antonucci, Alessio Benavoli, Marco Zaffalon, Gert de Cooman, Filip Hermans:
Multiple model tracking by imprecise markov trees. FUSION 2009: 1767-1774 - [c20]Giorgio Corani, Andrea Emilio Rizzoli, A. Salvetti, Marco Zaffalon:
Reproducing human decisions in reservoir management: the case of lake Lugano. ITEE 2009: 252-263 - [c19]Giorgio Corani, Marco Zaffalon:
Lazy naive credal classifier. KDD Workshop on Knowledge Discovery from Uncertain Data 2009: 30-37 - [i6]Alberto Piatti, Marco Zaffalon, Fabio Trojani, Marcus Hutter:
Limits of Learning about a Categorical Latent Variable under Prior Near-Ignorance. CoRR abs/0904.4527 (2009) - 2008
- [j18]Giorgio Corani, Marco Zaffalon:
JNCC2: An extension of naive Bayes classifier suited for small and incomplete data sets. Environ. Model. Softw. 23(7): 960-961 (2008) - [j17]Alessandro Antonucci, Marco Zaffalon:
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks. Int. J. Approx. Reason. 49(2): 345-361 (2008) - [j16]Giorgio Corani, Marco Zaffalon:
Learning Reliable Classifiers From Small or Incomplete Data Sets: The Naive Credal Classifier 2. J. Mach. Learn. Res. 9: 581-621 (2008) - [c18]Giorgio Corani, Marco Zaffalon:
Naive credal classifier 2: an extension of naive Bayes for delivering robust classifications. DMIN 2008: 84-90 - [c17]Giorgio Corani, Marco Zaffalon:
Credal Model Averaging: An Extension of Bayesian Model Averaging to Imprecise Probabilities. ECML/PKDD (1) 2008: 257-271 - 2007
- [j15]Alessandro Antonucci, Marco Zaffalon:
Fast algorithms for robust classification with Bayesian nets. Int. J. Approx. Reason. 44(3): 200-223 (2007) - [j14]Paolo Vicig, Marco Zaffalon, Fábio Gagliardi Cozman:
Notes on "Notes on conditional previsions". Int. J. Approx. Reason. 44(3): 358-365 (2007) - [c16]Alessandro Antonucci, Alberto Piatti, Marco Zaffalon:
Credal Networks for Operational Risk Measurement and Management. KES (2) 2007: 604-611 - 2006
- [c15]Alessandro Antonucci, Marco Zaffalon:
Locally specified credal networks. Probabilistic Graphical Models 2006: 25-34 - [c14]Giorgio Corani, Chris Edgar, Isabelle Marshall, Keith Wesnes, Marco Zaffalon:
Classification of Dementia Types from Cognitive Profiles Data. PKDD 2006: 470-477 - [c13]Alessandro Antonucci, Marco Zaffalon:
Equivalence Between Bayesian and Credal Nets on an Updating Problem. SMPS 2006: 223-230 - [c12]Alessandro Antonucci, Marco Zaffalon, Jaime Shinsuke Ide, Fábio Gagliardi Cozman:
Binarization Algorithms for Approximate Updating in Credal Nets. STAIRS 2006: 120-131 - 2005
- [j13]Marco Zaffalon, Gert de Cooman:
Editorial: Imprecise probability perspectives on artificial intelligence. Ann. Math. Artif. Intell. 45(1-2): 1-4 (2005) - [j12]Marco Zaffalon, Marcus Hutter:
Robust inference of trees. Ann. Math. Artif. Intell. 45(1-2): 215-239 (2005) - [j11]Marcus Hutter, Marco Zaffalon:
Distribution of mutual information from complete and incomplete data. Comput. Stat. Data Anal. 48(3): 633-657 (2005) - [j10]Marco Zaffalon:
Credible classification for environmental problems. Environ. Model. Softw. 20(8): 1003-1012 (2005) - [j9]Marco Zaffalon:
Credibility via imprecise probability. Int. J. Approx. Reason. 39(2-3): 115-121 (2005) - [c11]Alessandro Antonucci, Marco Zaffalon:
Fast Algorithms for Robust Classification with Bayesian Nets. ISIPTA 2005: 11-20 - [c10]Alberto Piatti, Marco Zaffalon, Fabio Trojani:
Limits of Learning from Imperfect Observations under Prior Ignorance: the Case of the Imprecise Dirichlet Model. ISIPTA 2005: 276-286 - [c9]Marco Zaffalon:
Conservative Rules for Predictive Inference with Incomplete Data. ISIPTA 2005: 406-415 - [i5]Marco Zaffalon, Marcus Hutter:
Robust Inference of Trees. CoRR abs/cs/0511087 (2005) - 2004
- [j8]Gert de Cooman, Marco Zaffalon:
Updating beliefs with incomplete observations. Artif. Intell. 159(1-2): 75-125 (2004) - [i4]Marcus Hutter, Marco Zaffalon:
Distribution of Mutual Information from Complete and Incomplete Data. CoRR cs.LG/0403025 (2004) - 2003
- [j7]Marco Zaffalon, Keith Wesnes, Orlando Petrini:
Reliable diagnoses of dementia by the naive credal classifier inferred from incomplete cognitive data. Artif. Intell. Medicine 29(1-2): 61-79 (2003) - [j6]Marco Zaffalon, Enrico Fagiuoli:
Tree-Based Credal Networks for Classification. Reliab. Comput. 9(6): 487-509 (2003) - [c8]Jean-Marc Bernard, Teddy Seidenfeld, Marco Zaffalon:
Preface: Proceedings of the Third International Symposium on Imprecise Probabilities and Their Applications. ISIPTA 2003 - [c7]Marcus Hutter, Marco Zaffalon:
Bayesian Treatment of Incomplete Discrete Data Applied to Mutual Information and Feature Selection. KI 2003: 396-406 - [c6]Gert de Cooman, Marco Zaffalon:
Updating with incomplete observations. UAI 2003: 142-150 - [e1]Jean-Marc Bernard, Teddy Seidenfeld, Marco Zaffalon:
ISIPTA '03, Proceedings of the Third International Symposium on Imprecise Probabilities and Their Applications, Lugano, Switzerland, July 14-17, 2003. Proceedings in Informatics 18, Carleton Scientific 2003, ISBN 1-894145-17-8 [contents] - [i3]Gert de Cooman, Marco Zaffalon:
Updating beliefs with incomplete observations. CoRR cs.AI/0305044 (2003) - [i2]Marcus Hutter, Marco Zaffalon:
Bayesian Treatment of Incomplete Discrete Data applied to Mutual Information and Feature Selection. CoRR cs.LG/0306126 (2003) - 2002
- [c5]Marco Zaffalon, Marcus Hutter:
Robust Feature Selection by Mutual Information Distributions. UAI 2002: 577-584 - [i1]Marco Zaffalon, Marcus Hutter:
Robust Feature Selection by Mutual Information Distributions. CoRR cs.AI/0206006 (2002) - 2001
- [j5]Luca Maria Gambardella, Monaldo Mastrolilli, Andrea Emilio Rizzoli, Marco Zaffalon:
An optimization methodology for intermodal terminal management. J. Intell. Manuf. 12(5-6): 521-534 (2001) - [c4]Marco Zaffalon, Keith Wesnes, Orlando Petrini:
Credal Classification for Dementia Screening. AIME 2001: 67-76 - [c3]Marco Zaffalon:
Statistical inference of the naive credal classifier. ISIPTA 2001: 384-393 - [c2]Marco Zaffalon:
Robust discovery of tree-dependency structures. ISIPTA 2001: 394-
1990 – 1999
- 1999
- [c1]Marco Zaffalon:
A Credal Approach to Naive Classification. ISIPTA 1999: 405- - 1998
- [j4]Enrico Fagiuoli, Marco Zaffalon:
2U: An Exact Interval Propagation Algorithm for Polytrees with Binary Variables. Artif. Intell. 106(1): 77-107 (1998) - [j3]Enrico Fagiuoli, Marco Zaffalon:
A note about redundancy in influence diagrams. Int. J. Approx. Reason. 19(3-4): 351-365 (1998) - [j2]Luca Maria Gambardella, Andrea Emilio Rizzoli, Marco Zaffalon:
Simulation and Planning of an Intermodal Container Terminal. Simul. 71(2): 107-116 (1998) - 1997
- [j1]Ken Darby-Dowman, James Little, Gautam Mitra, Marco Zaffalon:
Constraint Logic Programming and Integer Programming Approaches and Their Collaboration in Solving an Assignment Scheduling Problem. Constraints An Int. J. 1(3): 245-264 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
