Efficient Stepwise Selection in Decomposable Models
Adjacency List
Adjacency Matrix
Converts an adjacency matrix to an adjacency list
Converts an adjacency list to an adjacency matrix
Gengraph as igraph
Finds the components of a graph
Depth First Search
Simulate observations from a decomposable graphical model
Joint Entropy
ess: Eficient Stepwise Selection in Decomposable Models
Fit a decomposable graphical model on each component
Fit a decomposable graphical model
A generic and extendable structure for decomposable graphical models
A test for decomposability in undirected graphs
Make a complete graph
Make a null graph
Maximum Cardinality Search
Plot
Runnining Intersection Property
Subgraph
Stepwise backward selection
Stepwise efficient forward selection in decomposable graphical models
Stepwise model selection
An implementation of the ESS algorithm following Amol Deshpande, Minos Garofalakis, Michael I Jordan (2013) <doi:10.48550/arXiv.1301.2267>. The ESS algorithm is used for model selection in decomposable graphical models.