On Sensitivity of the MAP Bayesian Network Structure to the Equivalent Sample Size Parameter (2007)

by Tomi Silander , Petri Kontkanen , Petri Myllymäki
Citations:7 - 4 self

Documents Related by Co-Citation

24 A lineartime algorithm for computing the multinomial stochastic complexity – P Kontkanen, P Myllymäki - 2007
125 Universal sequential coding of single messages – Yu M Shtarkov - 1987
913 Learning Bayesian networks: The combination of knowledge and statistical data – David Heckerman, David M. Chickering - 1995
1209 Information theory and an extension of the maximum likelihood principle – H Akaike - 1973
2283 Estimating the dimension of a model – G Schwarz - 1978
276 Fisher information and stochastic complexity – J J Rissanen - 1996
159 Learning Bayesian Networks is NP-Complete – David Maxwell Chickering - 1996
5 Conditional NML models – J Rissanen, T Roos - 2007
6 Factorized Normalized Maximum Likelihood Criterion for Learning Bayesian Network Structures – Tomi Silander, Teemu Roos, Petri Kontkanen, Petri Myllymäki - 2008
174 Statistical theory: The prequential approach – A P Dawid - 1984
45 A Simple Approach for Finding the Globally Optimal Bayesian Network Structure – Tomi Silander, Petri Myllymäki
7 On Sensitivity of the MAP Bayesian Network Structure to the Equivalent Sample Size Parameter – Tomi Sil, Petri Kontkanen, Petri Myllymäki
1081 A Bayesian method for the induction of probabilistic networks from data – Gregory F. Cooper, Tom Dietterich - 1992
7069 Probabilistic Reasoning in Intelligent Systems – J Pearl - 1988
15 The minimum description principle in coding and modeling – A Barron, J Rissanen, B Yu - 1998
41 Sampling contingency tables,” Random Structures and Algorithms – M Dyer, R Kannan, J Mount - 1997
11 MDL histogram density estimation – Petri Kontkanen, Petri Myllymäki - 2007
25 Learning Bayesian networks is NP-Complete,” in Learning from Data – D M Chickering - 1996
495 Stochastic complexity – J Rissanen - 1987