Structure learning infers a graph or probabilistic model structure from observed relational data. Given data D, it evaluates plausible graph structures G = (V, E), but general-graph search is NP-hard because the number of directed topologies grows exponentially. section 9.3
Approximate structure-learning methods specialize the search to two settings:
- Chow–Liu constructs a tree-based graph by using mutual information between nodes as edge weights and selecting a maximum-weight spanning tree. section 9.6
- Inverse covariance estimation targets general graphs; regularizing the inverse covariance matrix produces more interpretable topologies with fewer inferred edges. section 9.6
Choosing a tractable topology
When graph search is infeasible, a tree approximation limits the structure to a maximum-weight spanning tree; for a general graph, inverse-covariance regularization favors a sparser topology. section 9.8
