Abstract
Structured domains are characterized by complex patterns which are usually represented as lists, trees, and graphs of variable sizes and complexity. The ability to recognize and classify these patterns is fundamental for several applications that use, generate or manipulate structures. In this paper I review some of the concepts underpinning Recursive Neural Networks, i.e. neural network models able to deal with data represented as directed acyclic graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.M. Bianucci, A. Micheli, A. Sperduti, and A. Starita. Application of cascade correlation networks for structures to chemistry. Applied Intelligence, 12:115–145, 2000.
A.M. Bianucci, A. Micheli, A. Sperduti, and A. Starita. Analysis of the internal representations developed by neural networks for structures applied to quantitative structure-activity relationship studies of benzodiazepines. J. Chem. Inf. Comput. Sci., 41(l):202–218, 2001.
R.C. Carrasco and M.L. Forcada. Simple strategies to encode tree automata in sigmoid recursive neural networks. IEEE TKDE, 13(2):148–156, 2001.
F. Costa, P. Frasconi, V. Lombardo, and G. Soda. Towards incremental parsing of natural language using recursive neural networks. Applied Intelligence, To appear.
E. Francesconi, P. Frasconi, M. Gori, S. Marinai, J. Q. Sheng, G. Soda, and A. Sperduti. Logo recognition by recursive neural networks. In R. Kasturi and K. Tombre, editors, Graphics Recognition-Algorithms and Systems, pages 104–117. LNCS, Vol. 1389, Springer Verlag, 1997.
P. Frasconi, M. Gori, and A. Sperduti. On the efficient classification of data structures by neural networks. In IJCAI, pages 1066–1071, 1997.
P. Frasconi, M. Gori, and A. Sperduti. A general framework for adaptive processing of data structures. IEEE TNN, 9(5):768, 1998.
C. Goller. A Connectionist Approach for Learning Search-Control Heuristics for Automated Deduction Systems. PhD thesis, Technical University Munich, Computer Science, 1997.
C. Goller and A. Küchler. Learning task-dependent distributed structure-representations by backpropagation through structure. In IEEE International Conference on Neural Networks, pages 347–352, 1996.
M. Gori, A. Kuchler, and A. Sperduti. On the implementation of frontier-to-root tree automata in recursive neural networks. IEEE Transactions on Neural Networks, 10(6):1305–1314, 1999.
M. Hagenbuchner, A. Sperduti, and A. C. Tsoi. A supervised self-organising map for structured data. In WSOM’01, 2001.
B. Hammer. On the learnability of recursive data. Mathematics of Control Signals and Systems, 12:62–79, 1999.
B. Hammer. Generalization ability of folding networks. IEEE TKDE, 13(2):196–206, 2001.
A. Sperduti. On the computational power of recurrent neural networks for structures. Neural Networks, 10(3):395–400, 1997.
A. Sperduti and A. Starita. Supervised neural networks for the classification of structures. IEEE Transactions on Neural Networks, 8(3):714–735, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sperduti, A. (2001). Neural Networks for Adaptive Processing of Structured Data. In: Dorffner, G., Bischof, H., Hornik, K. (eds) Artificial Neural Networks — ICANN 2001. ICANN 2001. Lecture Notes in Computer Science, vol 2130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44668-0_2
Download citation
DOI: https://doi.org/10.1007/3-540-44668-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42486-4
Online ISBN: 978-3-540-44668-2
eBook Packages: Springer Book Archive