Analyzing Markov random fields using t-cherry junction tree structures

zbMATH Open1232.62124MaRDI QIDQ3170488FDOQ3170488

Tamás Szántai, Edith Kovács

Publication date: 27 September 2011

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

zbMATH Keywords

speech recognitionmultivariate probability distributions

Mathematics Subject Classification ID

Multivariate distribution of statistics (62H10) Random fields; image analysis (62M40) Applications of statistics to biology and medical sciences; meta analysis (62P10) Medical applications (general) (92C50) Pattern recognition, speech recognition (68T10)

Cited In (1)

• Computational Methods for Hidden Markov Tree Models—An Application to Wavelet Trees

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)