Hidden Tree Markov Models for Document Image Classification
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parsing with Probabilistic Strictly Locally Testable Tree Languages
IEEE Transactions on Pattern Analysis and Machine Intelligence
Wavelet-based statistical signal processing using hidden Markovmodels
IEEE Transactions on Signal Processing
Computational methods for hidden Markov tree models-an application to wavelet trees
IEEE Transactions on Signal Processing
A general framework for adaptive processing of data structures
IEEE Transactions on Neural Networks
Neurocomputing
An input-output hidden Markov model for tree transductions
Neurocomputing
Hi-index | 0.00 |
We introduce a compositional probabilistic model for treestructured data that defines a bottom-up generative process from the leaves to the root of a tree. Contextual state transitions are introduced from the joint configuration of the children to the parent nodes, allowing hidden states to model the co-occurrence of substructures among the child subtrees. A mixed memory approximation is proposed to factorize the joint transition matrix as a mixture of pairwise transitions. A comparative experimental analysis shows that the proposed approach is able to better model deep structures with respect to top-down approaches.