Bottom-up hidden tree Markov model;
Input-driven generative model;
Learning tree transductions;
Structured data processing;
GENERAL FRAMEWORK;
STRUCTURED DATA;
EDIT DISTANCE;
D O I:
10.1016/j.neucom.2012.12.044
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
The paper introduces an input-driven generative model for tree-structured data that extends the bottom-up hidden tree Markov model to non-homogeneous state transition and emission probabilities. We show how the proposed input-driven approach can be used to realize different types of structured transductions between trees. A thorough experimental analysis is proposed to investigate the advantage of introducing an input-driven dynamics in structured-data processing. The results of this analysis suggest that input-driven models can capture more discriminative structural information than homogeneous approaches in computational learning tasks, including document classification and more general substructure categorization. (C) 2013 Elsevier B.V. All rights reserved.