Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations
On the Problem of Local Minima in Backpropagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Global Optimization for Neural Network Training
Computer - Special issue: neural computing: companion issue to Spring 1996 IEEE Computational Science & Engineering
Adaptive Processing of Tree-Structure Image Representation
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
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
Training neural nets with the reactive tabu search
IEEE Transactions on Neural Networks
Tree structures with attentive objects for image classification using a neural network
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
ISNN'05 Proceedings of the Second international conference on Advances in neural networks - Volume Part II
Expert Systems with Applications: An International Journal
Structured-Based neural network classification of images using wavelet coefficients
ISNN'06 Proceedings of the Third international conference on Advnaces in Neural Networks - Volume Part II
Improvement of panchromatic IKONOS image classification based on structural neural network
ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part I
Hi-index | 0.02 |
Many researchers have explored the use of neural network models for the adaptive processing of data structures. The learning formulation for one of the models is known as the Backpropagation Through Structure (BPTS) algorithm. The main limitations of the BPTS algorithm are attributed to the problems of slow convergence speed and long-term dependency. In this Letter, a novel heuristic algorithm is proposed. The idea of this algorithm is to optimize the free parameters of the node representation in data structure by using a hybrid type of learning algorithm. Encouraging results achieved demonstrate that this proposed algorithm outperforms the BPTS algorithm.