A pruning algorithm based on neural complexity

MaRDI QIDQ3014341zbMATH OpenFDO

Authors Zhaozhao Zhang, Honggui Han, Junfei Qiao

Publication date 19 July 2011

zbMATH Keywords

mutual information entropy

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• scientific article; zbMATH DE number 1876961
• Pruning nodes in feedforward neural networks
• scientific article; zbMATH DE number 710379
• A simple neural network pruning algorithm with application to filter synthesis
• Neural Network Pruning with Tukey-Kramer Multiple Comparison Procedure

Cited in

(13)

• A pruning algorithm for extreme learning machine based on sensitivity analysis
• A simple neural network pruning algorithm with application to filter synthesis
• scientific article; zbMATH DE number 2013533 (Why is no real title available?)
• scientific article; zbMATH DE number 1843099 (Why is no real title available?)
• Pruning nodes in feedforward neural networks
• scientific article; zbMATH DE number 1876961 (Why is no real title available?)
• Sensitivity-informed provable pruning of neural networks
• A pruning algorithm of training high-order neural network based on grey incidence analysis
• Neural Network Pruning with Tukey-Kramer Multiple Comparison Procedure
• scientific article; zbMATH DE number 1748482 (Why is no real title available?)
• Fast unit pruning algorithm for feedforward neural network design
• Dynamic schedule for effective on-line connection pruning
• Joint structure and parameter optimization of multiobjective sparse neural network

This page was built for publication: A pruning algorithm based on neural complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3014341)