Modern heuristic techniques for combinatorial problems
Finite impulse response neural networks with applications in time series prediction
Finite impulse response neural networks with applications in time series prediction
Neural Networks for Statistical Modeling
Neural Networks for Statistical Modeling
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
IEEE Spectrum
ANNSTLF-a neural-network-based electric load forecasting system
IEEE Transactions on Neural Networks
On-line learning algorithms for locally recurrent neural networks
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
A general purpose implementation of the Tabu Search metaheuristic, called Universal Tabu Search, is used to optimally design a Locally Recurrent Neural Network architecture. Indeed, the design of a neural network is a tedious and time consuming trial and error operation that leads to structures whose optimality is not guaranteed. In this paper, the problem of choosing the number of hidden neurons and the number of taps and delays in the FIR and IIR network synapses is formalised as an optimisation problem whose cost function to be minimised is the network error calculated on a validation data set. The performances of the proposed approach have been tested on the design problem of a Neural Network controller of a Custom Power protection device.