Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Recurrent networks: supervised learning
The handbook of brain theory and neural networks
Neural Networks: A Comprehensive Foundation
Neural Networks: A Comprehensive Foundation
Relational Data Mining
Application of Cascade Correlation Networks for Structures toChemistry
Applied Intelligence
The Journal of Machine Learning Research
A survey of kernels for structured data
ACM SIGKDD Explorations Newsletter
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Clustering documents into a web directory for bootstrapping a supervised classification
Data & Knowledge Engineering - Special issue: WIDM 2003
Pattern Recognition Letters - Special issue: Artificial neural networks in pattern recognition
Universal Approximation Capability of Cascade Correlation for Structures
Neural Computation
2005 Special Issue: Learning protein secondary structure from sequential and relational data
Neural Networks - Special issue on neural networks and kernel methods for structured domains
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Learning and generalization in cascade network architectures
Neural Computation
Kernels on prolog ground terms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A new neural network model for contextual processing of graphs
WIRN'05 Proceedings of the 16th Italian conference on Neural Nets
Statistical relational learning: an inductive logic programming perspective
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Supervised neural networks for the classification of structures
IEEE Transactions on Neural Networks
A general framework for adaptive processing of data structures
IEEE Transactions on Neural Networks
Processing directed acyclic graphs with recursive neural networks
IEEE Transactions on Neural Networks
Contextual processing of structured data by recursive cascade correlation
IEEE Transactions on Neural Networks
Recursive processing of cyclic graphs
IEEE Transactions on Neural Networks
Backpropagation Algorithms for a Broad Class of Dynamic Networks
IEEE Transactions on Neural Networks
A Normalized Adaptive Training of Recurrent Neural Networks With Augmented Error Gradient
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
IEEE Computational Intelligence Magazine
Towards the unification of structural and statistical pattern recognition
Pattern Recognition Letters
Neurocomputing
Hi-index | 0.00 |
This paper presents a new approach for learning in structured domains (SDs) using a constructive neural network for graphs (NN4G). The new model allows the extension of the input domain for supervised neural networks to a general class of graphs including both acyclic/cyclic, directed/undirected labeled graphs. In particular, the model can realize adaptive contextual transductions, learning the mapping from graphs for both classification and regression tasks. In contrast to previous neural networks for structures that had a recursive dynamics, NN4G is based on a constructive feedforward architecture with state variables that uses neurons with no feedback connections. The neurons are applied to the input graphs by a general traversal process that relaxes the constraints of previous approaches derived by the causality assumption over hierarchical input data. Moreover, the incremental approach eliminates the need to introduce cyclic dependencies in the definition of the system state variables. In the traversal process, the NN4G units exploit (local) contextual information of the graphs vertices. In spite of the simplicity of the approach, we show that, through the compositionality of the contextual information developed by the learning, the model can deal with contextual information that is incrementally extended according to the graphs topology. The effectiveness and the generality of the new approach are investigated by analyzing its theoretical properties and providing experimental results.