A node pruning algorithm based on optimal brain surgeon for feedforward neural networks

Jinhua Xu, Daniel W. C. Ho

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

8 Citations (Scopus)

Abstract

In this paper, a node pruning algorithm based on optimal brain surgeon is proposed for feedforward neural networks. First, the neural network is trained to an acceptable solution using the standard training algorithm. After the training process, the orthogonal factorization is applied to the output of the nodes in the same hidden layer to identify and prune the dependant nodes. Then, a unit-based optimal brain surgeon(UB-OBS) pruning algorithm is proposed to prune the insensitive hidden units to further reduce the size of the neural network, and no retraining is needed. Simulations are presented to demonstrate the effectiveness of the proposed approach. © Springer-Verlag Berlin Heidelberg 2006.
Original languageEnglish
Title of host publicationAdvances in Neural Networks - ISNN 2006
Subtitle of host publicationThird International Symposium on Neural Networks, ISNN 2006, Proceedings
PublisherSpringer Verlag
Pages524-529
Volume3971 LNCS
ISBN (Print)354034439, 9783540344391
DOIs
Publication statusPublished - 2006
Event3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks: Advances in Neural Networks - Chengdu, China
Duration: 28 May 20061 Jun 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3971 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks
Country/TerritoryChina
CityChengdu
Period28/05/061/06/06

Fingerprint

Dive into the research topics of 'A node pruning algorithm based on optimal brain surgeon for feedforward neural networks'. Together they form a unique fingerprint.

Cite this