46 citations · 77 across the 3 of their papers we have counts for
3 papers
cs.AI2013★ 12 cited
On characterizing Inclusion of Bayesian Networks
Tomas Kocka, Remco R. Bouckaert, Milan Studeny
Every directed acyclic graph (DAG) over a finite non-empty set of variables (= nodes) N induces an independence model over N, which is a list of conditional independence statements…
cs.LG2012★ 19 cited
Dimension Correction for Hierarchical Latent Class Models
Tomas Kocka, Nevin Lianwen Zhang
Model complexity is an important factor to consider when selecting among graphical models. When all variables are observed, the complexity of a model can be measured by its standar…
cs.LG2012★ 46 cited
On Local Optima in Learning Bayesian Networks
Jens D. Nielsen, Tomas Kocka, Jose M. Pena
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it…