Sciweavers

Share
141 search results - page 1 / 29
» Approximate algorithms for credal networks with binary varia...
Sort
View
IJAR
2010
75views more  IJAR 2010»
11 years 8 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...
IJAR
2008
167views more  IJAR 2008»
11 years 9 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
IPMU
2010
Springer
12 years 1 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities speciļ¬ed by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
IJAR
2008
83views more  IJAR 2008»
11 years 9 months ago
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
Alessandro Antonucci, Marco Zaffalon
SUM
2009
Springer
12 years 4 months ago
Modeling Unreliable Observations in Bayesian Networks by Credal Networks
Bayesian networks are probabilistic graphical models widely employed in AI for the implementation of knowledge-based systems. Standard inference algorithms can update the beliefs a...
Alessandro Antonucci, Alberto Piatti
books