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.

Bottom-Up Generative Modeling of Tree-Structured Data.

SPERDUTI, ALESSANDRO
2010

Abstract

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.
2010
Neural Information Processing. Theory and Algorithms - 17th International Conference, ICONIP
3642175368
9783642175367
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2420580
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 4
  • OpenAlex ND
social impact