Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

A node pruning algorithm for feedforward neural network based on neural complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhaozhao Zhang ; Coll. of Electron. & Control Eng., Beijing Univ. of Technol., Beijing, China ; Junfei Qiao

In this paper, a hidden node pruning algorithm based on the neural complexity is proposed, the entropy of neural network can be calculated by the standard covariance matrix of the neural network's connection matrix in the training stage, and the neural complexity can be acquired. In ensuring the information processing capacity of neural network is not reduced, select and delete the least important hidden node, and the simpler neural network architecture is achieved. It is not necessary to train the cost function of the neural network to a local minimal, and the pre-processing neural network weights is avoided before neural network architecture adjustment. The simulation results of the non-linear function approximation shows that the performance of the approximation is ensured and at the same time a simple architecture of neural networks can be achieved.

Published in:

Intelligent Control and Information Processing (ICICIP), 2010 International Conference on

Date of Conference:

13-15 Aug. 2010