Analyzing Markov random fields using t-cherry junction tree structures
From MaRDI portal
Analyzing Markov random fields using \(t\)-cherry junction tree structures
Recommendations
- Pattern recognition using t-cherry junction tree structures
- Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
- Markov random fields and their applications
- Approximating discrete probability distributions with dependence trees
- The construction of multivariate distributions from Markov random fields
Cited in
(3)
This page was built for publication: Analyzing Markov random fields using \(t\)-cherry junction tree structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170488)