Jaime Shinsuke Ide, Fábio Gagliardi Cozman.
Graphical models that represent uncertainty through sets of probability measures are often referred to as credal networks. Polynomial-time exact inference methods are available only for polytree-structured binary credal networks. In this work, we approximate potentially intractable inferences in multiconnected binary networks by tractable inferences in polytree-structures. We propose a novel set-based structural variational inference method - the SV2U algorithm. The SV2U algorithm is the first method that produces approximate inferences in large binary credal networks with theoretical solid convergence analysis and offers a promising way to handle continuous variables in credal networks.
http://www.lbd.dcc.ufmg.br/colecoes/enia/2005/059.pdf
Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web