( en | de | ru )

 

Disambiguation of "Moral, Serafín"

Author of the publication

copydeleteadd this publication to your clipboard
Methods to Determine the Branching Attribute in Bayesian Multinets Classifiers.

, , , and . ECSQARU, volume 3571 of Lecture Notes in Computer Science, page 932-943. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Reinhard Moral

Robert Serafin

Josef Serafin

Michael Serafin

Serafin Roon

 

Other publications of authors with the same name

MPE Computation in Bayesian Networks Using Mini-Bucket and Probability Trees Approximation., , , and . Int. J. Uncertain. Fuzziness Knowl. Based Syst., 28 (5): 785-805 (2020)A Bayesian stochastic search method for discovering Markov boundaries., and . Knowl. Based Syst., (2012)Imprecise Probability in Graphical Models: Achievements and Challenges.. ECSQARU, volume 3571 of Lecture Notes in Computer Science, page 1-2. Springer, (2005)Approximate Factorisation of Probability Trees., , , and . ECSQARU, volume 3571 of Lecture Notes in Computer Science, page 51-62. Springer, (2005)Dynamic Importance Sampling Computation in Bayesian Networks., and . ECSQARU, volume 2711 of Lecture Notes in Computer Science, page 137-148. Springer, (2003)Mixtures of Truncated Exponentials in Hybrid Bayesian Networks., , and . ECSQARU, volume 2143 of Lecture Notes in Computer Science, page 156-167. Springer, (2001)A Monte Carlo Algorithm for Combining Dempster-Shafer Belief Based on Approximate Pre-computation., and . ESCQARU, volume 1638 of Lecture Notes in Computer Science, page 305-315. Springer, (1999)Binary Probability Trees for Bayesian Networks Inference., , and . ECSQARU, volume 5590 of Lecture Notes in Computer Science, page 180-191. Springer, (2009)Uncertainty Management Using Probability Intervals., , and . IPMU, volume 945 of Lecture Notes in Computer Science, page 190-199. Springer, (1994)Mixing exact and importance sampling propagation algorithms in dependence graphs., and . Int. J. Intell. Syst., 12 (8): 553-576 (1997)