A pruning algorithm based on neural complexity
From MaRDI portal
Publication:3014341
zbMATH Open1232.92027MaRDI QIDQ3014341FDOQ3014341
Authors: Zhaozhao Zhang, Honggui Han, Junfei Qiao 
Publication date: 19 July 2011
Recommendations
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)
Cited In (13)
- A simple neural network pruning algorithm with application to filter synthesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pruning nodes in feedforward neural networks
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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
- A pruning algorithm for extreme learning machine based on sensitivity analysis
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)
