Radical pruning: a method to construct skeleton radial basis function networks.
Trained radial basis function networks are well-suited for use in extracting rules and explanations because they contain a set of locally tuned units. However, for rule extraction to be useful, these networks must first be pruned to eliminate unnecessary weights. The pruning algorithm cannot search the network exhaustively because of the computational effort involved. It is shown that using multiple pruning methods with smart ordering of the pruning candidates, the number of weights in a radial basis function network can be reduced to a small fraction of the original number. The complexity of the pruning algorithm is quadratic (instead of exponential) in the number of network weights. Pruning performance is shown using a variety of benchmark problems from the University of California, Irvine machine learning database.
University of Colorado, Colorado Springs 80907, USA.
M F
MF
Augusteijn
K A
KA
Shaw
D000465:Algorithms; D001185:Artificial Intelligence; D007091:Image Processing, Computer-Assisted / Q000379:methods; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated