Sciweavers

4 search results - page 1 / 1
» Credal Sets Approximation by Lower Probabilities: Applicatio...
Sort
View
IPMU
2010
Springer
13 years 8 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 specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
ISIPTA
2005
IEEE
168views Mathematics» more  ISIPTA 2005»
13 years 10 months ago
Approximate Inference in Credal Networks by Variational Mean Field Methods
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
IJAR
2010
105views more  IJAR 2010»
13 years 2 months ago
A tree augmented classifier based on Extreme Imprecise Dirichlet Model
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
G. Corani, C. P. de Campos
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
13 years 10 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet