Backward Elimination Methods for Associative Memory Network Pruning

Authors:
Xia Hong;Chris Harris;Martin Brown;Sheng Chen
Affiliations:
Department of Cybernetics, University of Reading, Reading, UK;Department of Electronics and Computer Science, University of Southampton, Southampton, UK;Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, UK;Department of Electronics and Computer Science, University of Southampton, Southampton, UK
Venue:
International Journal of Hybrid Intelligent Systems
Year:
2004

Citing 7
Cited 3

Neurofuzzy adaptive modelling and control

Neurofuzzy adaptive modelling and control
Adaptive modelling, estimation and fusion from data: a neurofuzzy approach

Adaptive modelling, estimation and fusion from data: a neurofuzzy approach
Atomic Decomposition by Basis Pursuit

SIAM Review
A neurofuzzy network knowledge extraction and extended Gram-Schmidt algorithm for model subspace decomposition

IEEE Transactions on Fuzzy Systems
Combined genetic algorithm optimization and regularized orthogonal least squares learning for radial basis function networks

IEEE Transactions on Neural Networks
Nonlinear model structure detection using optimum experimental design and orthogonal least squares

IEEE Transactions on Neural Networks
Nonlinear model structure design and construction using orthogonal least squares and D-optimality design

IEEE Transactions on Neural Networks

Backward elimination model construction for regression and classification using leave-one-out criteria

International Journal of Systems Science
Model selection approaches for non-linear system identification: a review

International Journal of Systems Science
Two-stage mixed discrete-continuous identification of radial basis function (RBF) neural models for nonlinear systems

IEEE Transactions on Circuits and Systems Part I: Regular Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Three hybrid data based model construction/pruning formula are introduced by using backward elimination as automatic postprocessing approaches to improved model sparsity. Each of these approaches is based on a composite cost function between the model fit and one of three terms of A-/D-optimality / (parameter 1-norm in basis pursuit) that determines a pruning process. The A-/D-optimality based pruning formula contain some orthogonalisation between the pruned model and the deleted regressor. The basis pursuit cost function is derived as a simple formula without need for an orthogonalisation process. These different approaches to parsimonious data based modelling are applied to the same numerical examples in parallel to demonstrate their computational effectiveness.