Return
Tree Echo State Networks
DOI:10.1016/j.neucom.2012.08.017.png)
Abstract
En 中文
In this paper we present the Tree Echo State Network (TreeESN) model, generalizing the paradigm of Reservoir Computing to tree structured data. TreeESNs exploit an untrained generalized recursive reservoir, exhibiting extreme efficiency for learning in structured domains. In addition, we highlight through the paper other characteristics of the approach: First, we discuss the Markovian characterization of reservoir dynamics, extended to the case of tree domains, that is implied by the contractive setting of the TreeESN state transition function. Second, we study two types of state mapping functions to map the tree structured state of TreeESN into a fixed-size feature representation for classification or regression tasks. The critical role of the relation between the choice of the state mapping function and the Markovian characterization of the task is analyzed and experimentally investigated on both artificial and real-world tasks. Finally, experimental results on benchmark and real-world tasks show that the TreeESN approach, in spite of its efficiency, can achieve comparable results with state-of-theart, although more complex, neural and kernel based models for tree structured data. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Reservoir computing
Echo state networks
Learning in tree structured domains
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
Towards incremental parsing of natural language using recursive neural networks
APPLIED INTELLIGENCE
IF3.5
A preliminary empirical comparison of recursive neural networks and tree kernel methods on regression tasks for tree structured domains
NEUROCOMPUTING
IF6.5

