The Most Probable Bayesian Network and Beyond
Tomi Silander · Työväentutkimus Vuosikirja · 2009
This doctoral dissertation introduces 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.