Pruning algorithms-a survey

A rule of thumb for obtaining good generalization in systems trained by examples is that one should use the smallest system that will fit the data. Unfortunately, it usually is not obvious what size is best; a system that is too small will not be able to learn the data while one that is just big eno...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on neural networks 1993-09, Vol.4 (5), p.740-747
Main Author: Reed, R.
Format: Article
Language:English
Subjects:
Applied sciences
Electric, optical and optoelectronic circuits
Electronics
Exact sciences and technology
Multilayer perceptrons
Neural networks
Sampling methods
Testing
Thumb
Training data
Tree data structures
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A rule of thumb for obtaining good generalization in systems trained by examples is that one should use the smallest system that will fit the data. Unfortunately, it usually is not obvious what size is best; a system that is too small will not be able to learn the data while one that is just big enough may learn very slowly and be very sensitive to initial conditions and learning parameters. This paper is a survey of neural network pruning algorithms. The approach taken by the methods described here is to train a network that is larger than necessary and then remove the parts that are not needed.< >
ISSN:1045-9227
1941-0093
DOI:10.1109/72.248452