Protected: Structural learning of graphical models
On learning graph structures from data in Bayesian networks and Markov probability fields (Max-Min Hill Climbing (MMHC), Chow-Liu's algorithm, maximizing the score function, PC (Peter Spirtes and Clark Clymoir) Algorithm, GS (Grow-Shrink) algorithm, SGS (Spietes Glymour and Scheines) algorithm, sparse regularization, independence condition)