Università di Pisa
Sistema bibliotecario di ateneo

A Bottom-up Hidden Tree Markov Model

Bacciu, Davide and Micheli, Alessio and Sperduti, Alessandro (2010) A Bottom-up Hidden Tree Markov Model. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Other (GZip)
Available under License Creative Commons Attribution No Derivatives.

Download (280Kb)


    Hidden Tree Markov Models describe probability distributions over tree-structured data by defining a top-down generative process from the root to the leaves of the tree. We provide a novel compositional hidden tree Markov model that inverts the generative process, allowing hidden states to better correlate and model the co-occurrence of substructures among the child subtrees of internal nodes. To this end, we introduce a mixed memory approximation that factorizes the joint children-to-parent state transition matrix as a mixture of pairwise transitions. This Technical Report provides and in-depth introduction to the Bottom-Up Hidden Tree Markov Model, including the details of the learning and inference procedures.

    Item Type: Book
    Uncontrolled Keywords: Structured data; Hidden Tree Markov Model; Learning
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 04 Dec 2014 14:35
    Last Modified: 04 Dec 2014 14:35
    URI: http://eprints.adm.unipi.it/id/eprint/2252

    Repository staff only actions

    View Item