Deep Tree Echo State Networks
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
This work proposes a first study, through empirical assessment, of a deep recursive Neural Network (RecNN) architecture for tree structured data exploiting the efficient design of the Echo State Network (ESN) framework. Three benchmark tasks for trees allow us to assess the potentiality of the novel Deep Tree ESN (DeepTESN) model with respect to the shallow counterpart (Tree ESN) and literature results (including hidden tree Markov models and kernel based approaches) in different conditions and according to both efficiency and predictive performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Harnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication
Jaeger, H., & Haas, H. (2004) · Science · doi:10.1126/science.1091277 · Cited by 3,811 · cited 2×
“…(TESN) [27] is an efficient approach to the design of RecNN based on the Reservoir Computing (RC) paradigm [28] and on the Echo State Network (ESN) [29] model, whereas the recursive part is implemented by a randomized fixed-weight (obeying stability condition for their values) reservoir of units…”
BackgroundMethodImproved Semantic Representations From Tree-Structured Long Short-Term Memory Networks
Tai, K. S., Socher, R., & Manning, C. D. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1150 · Cited by 3,081
Reservoir computing approaches to recurrent neural network training
Lukoševičius, M., & Jaeger, H. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.03.005 · Cited by 2,956
Supervised neural networks for the classification of structures
Sperduti, A., & Starita, A. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572108 · Cited by 666 · cited 1×
“It was based on pioneering works [3], [4], [5], [6] with many variants and extension of the recursive framework for unsupervised processing [7], [8], extension to directed acyclic graphs [9], [10], generative version in the form of hidden tree Markov models (HTMM) [5], [11], [12], [13] and long short-term memory netwo…”
MethodLearning task-dependent distributed representations by backpropagation through structure
Goller, C., & Kuchler, A. (2002) · Proceedings of International Conference on Neural Networks (ICNN'96) · doi:10.1109/icnn.1996.548916 · Cited by 581
Universal Approximation Capability of Cascade Correlation for Structures
Hammer, B., Micheli, A., & Sperduti, A. (2005) · Neural Computation · doi:10.1162/0899766053491878 · Cited by 51
Self-citation
Cited by
Deep learning for time series classification: a review
Ismail Fawaz, H., Forestier, G., Weber, J., Idoumghar, L., & Muller, P.-A. (2019) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-019-00619-1 · Cited by 3,342
Recurrent Neural Networks: A Comprehensive Review of Architectures, Variants, and Applications
Mienye, I. D., Swart, T. G., & Obaido, G. (2024) · Information · doi:10.3390/info15090517 · Cited by 732
Design of deep echo state networks
Gallicchio, C., Micheli, A., & Pedrelli, L. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.08.002 · Cited by 262
Self-citationOnline Learning of Oil Leak Anomalies in Wind Turbines with Block-Based Binary Reservoir
Cardoni, M., Pau, D. P., Falaschetti, L., Turchetti, C., & Lattuada, M. (2021) · Electronics · doi:10.3390/electronics10222836 · Cited by 17
Bonci, A., Fredianelli, L., Kermenov, R., Longarini, L., Longhi, S., Pompei, G., Prist, M., & Verdini, C. (2024) · Applied Sciences · doi:10.3390/app14198686 · Cited by 16
Metadata
- Authors
- Gallicchio, C., & Micheli, A.
- Venue
- 2018 International Joint Conference on Neural Networks (IJCNN)
- Publisher
- IEEE
- Published
- 2018-07
- Pages
- 1-8
- OpenAlex
- W2897647030
- Cited by
- 65
- References
- 6
- FWCI
- 3.54
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.