Pattern recognition using t-cherry junction tree structures

MaRDI QIDQ3457320zbMATH OpenFDO

Authors Tamás Szántai, Edith Kovács

Publication date 14 December 2015

zbMATH Keywords

\(h\)-uniform hyper-tree\(t\)-cherry junction treepattern recognitionprobabilistic modeling

Mathematics Subject Classification ID

Hypergraphs (05C65) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Pattern recognition, speech recognition (68T10)

Recommendations

• Analyzing Markov random fields using t-cherry junction tree structures
• Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
• Discovering a junction tree behind a Markov network by a greedy algorithm
• scientific article; zbMATH DE number 3864536
• scientific article; zbMATH DE number 3862476

Cited in

(4)

• Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
• Pattern Recognition Using Morphological Class Distribution Functions and Classification Trees
• Analyzing Markov random fields using t-cherry junction tree structures
• Discovering a junction tree behind a Markov network by a greedy algorithm

This page was built for publication: Pattern recognition 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 Q3457320)