structure. A global search algorithm like Markov chain Monte Carlo (MCMC) can avoid getting trapped in local minima. Finding a structure that maximizes the mutual information, typically by restricting the parent candidate set to k nodes or by finding an optimal k on a node-per-node basis, is a technique that consistently achieves high scores on benchmark datasets.

A particularly fast method for exact