Doctoral disseration: algorithm for constructing the most probable Bayesian network from data for small domains

30 May 2009 - Tomi Silander introduced in his doctoral dissertation an algorithm for constructing the most probable Bayesian network from data for small domains. The algorithm is used to show that a popular goodness criterion for the Bayesian networks has a severe sensitivity problem. The dissertation then proposes an information theoretic criterion that avoids the problem.

Read more (in Finnish) »