Pruning using parameter and neuronal metrics

Neural Computation

Volumn 11, Issue 4, 1999, Pages 977-993

  Van De Laar, Piërre ^a   Heskes, Tom ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; AMERICAN INDIAN; ARTICLE; ARTIFICIAL NEURAL NETWORK; DIABETES MELLITUS; NERVE CELL; PATHOPHYSIOLOGY; PHYSIOLOGY; PROBABILITY; REPRODUCIBILITY;

ALGORITHMS; DIABETES MELLITUS; INDIANS, NORTH AMERICAN; NEURAL NETWORKS (COMPUTER); NEURONS; PROBABILITY; REPRODUCIBILITY OF RESULTS;

EID: 0033561861     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976699300016548     Document Type: Article

References (27)

1. Akaike, H. (1974). A new look at the statistical model identification. IEEE Transactions on Automatic Control, 19(6), 716-723.
2. Amari, S.-I. (1998). Natural gradient works efficiently in learning. Neural Computation, 10(2), 251-276.
3. Belsley, D. A., Kuh, E., & Welsch, R. E. (1980). Regression diagnostics: Identifying influential data and sources of collinearity. New York: Wiley.
4. Breiman, L. (1996). Bagging predictors, Machine Learning 24(2), 123-140.
5. Castellano, G., Fanelli, A. M., & Pelillo, M. (1997). An iterative pruning algorithm for feedforward neural networks. IEEE Transactions on Neural Networks 8(3), 519-531.
6. Cochran, W. G. (1938). The omission or addition of an independent variate in multiple linear regression. Supplement to the Journal of the Royal Statistical Society 5(2), 171-176.
7. Draper, N. R., & Smith, H. (1981). Applied regression analysis (2nd ed.). New York: Wiley.
8. Egmont-Petersen, M. (1996). Specification and assessment of methods supporting the development of neural networks in medicine. Unpublished doctoral dissertation, Maastricht University, Maastricht.
9. Fahlman, S. E., & Lebiere, C. (1990). The cascade-correlation learning architecture. In D. S. Touretzky (Ed.), Advances in neural information processing systems 2 (pp. 524-532). San Mateo, CA: Morgan Kaufmann.
10. Fisher, R. A. (1970). Statistical methods for research workers (14th ed.). Edinburgh: Oliver and Boyd.
11. Hassibi, B., & Stork, D. G. (1993). Second order derivatives for network pruning: Optimal Brain Surgeon. In S. J. Hanson, J. D. Cowan, & C. L. Giles (Eds.), Advances in neural information processing systems, 5 (pp. 164-171). San Mateo, CA: Morgan Kaufmann.
12. Hassibi, B., Stork, D. G., Wolff, G., & Watanabe, T. (1994). Optimal Brain Surgeon: Extensions and performance comparisons. In J. D. Cowan, G. Tesauro, & J. Alspector (Eds.), Advances in neural information processing systems, 6 (pp. 263-270). San Mateo, CA: Morgan Kaufmann.
13. Hirose, Y., Yamashita, K., & Hijiya, S. (1991). Back-propagation algorithm which varies the number of hidden units. Neural Networks 4(1), 61-66.
14. Ishikawa, M. (1996). Structural learning with forgetting. Neural Networks, 9(3), 509-521.
15. Kleinbaum, D. G., Kupper, L. L., & Muller, K. E. (1988). Applied regression analysis and other multivariable methods. (2nd ed.). Boston: PWS-KENT Publishing Company.
16. LeCun, Y., Denker, J. S., & Solla, S. A. (1990). Optimal Brain Damage. In D. S. Touretzky (Ed.), Advances in neural information processing systems, 2 (pp. 598-605). San Mateo, CA: Morgan Kaufmann.
17. MacKay, D. J. C. (1995). Probable networks and plausible predictions - a review of practical Bayesian methods for supervised neural networks. Network: Computation in Neural Systems, 6(3), 469-505.
18. Moody, J. O., & Antsaklis, P. J. (1996). The dependence identification neural network construction algorithm. IEEE Transactions on Neural Networks, 7(1), 3-15.
19. Murata, N., Yoshizawa, S., & Amari, S.-I. (1994). Network information criterion - Determining the number of hidden units for an artificial neural network model. IEEE Transactions on Neural Networks, 5(6), 865-872.
20. Pedersen, M. W., Hansen, L. K., & Larsen, J. (1996). Pruning with generalization based weight saliencies: γOBD, γOBS. In D. S. Touretzky, M. C. Mozer, & M. E. Hasselmo (Eds.), Advances in neural information processing systems, 8 (pp. 521-527). Cambridge, MA: MIT Press.
21. Prechelt, L. (1994). PROBEN1 - A set of neural network benchmark problems and benchmarking rules (Tech. Rep. 21/94). Fakultät für Informatik, Universität Karlsruhe.
22. Reed, R. (1993). Pruning algorithms - A survey. IEEE Transactions on Neural Networks, 4(5), 740-747.
23. Rissanen, J. (1978). Modeling by shortest data description. Automatica, 14, 465-471.
24. Stahlberger, A., & Riedmiller, M. (1997). Fast network pruning and feature extraction using the unit-OBS algorithm. In M. C. Mozer, M. I. Jordan, & T. Petsche (Eds.), Advances in neural information processing systems, 9 (pp. 655-661). Cambridge, MA: MIT Press.
25. Thrun, S. B., Bala, J., Bloedorn, E., Bratko, I., Cestnik, B., Cheng, J., De Jong, K., Džeroski, S., Fahlman, S. E., Fisher, D., Hamann, R., Kaufman, K., Keller, S., Kononenko, I., Kreuziger, J., Michalski, R. S., Mitchell, T., Pachowics, P., Reich, Y., Vafaie, H., Van de Welde, W., Wenzel, W., Wnek, J., & Zhang, J. (1991). The MONK's problems: A performance comparison of different learning algorithms (Tech. Rep. CMU-CS-91-197). Pittsburgh, PA: Carnegie Mellon University.
26. van de Laar, P., Gielen, S., & Heskes, T. (1997). Input selection with partial retraining. In W. Gerstner, A. Germond, M. Hasler, & J.-D. Nicoud (Eds.), Artificial neural networks - ICANN'97 (pp. 469-474). Berlin: Springer, pp. 469-474.
27. van de Laar, P., Heskes, T., & Gielen, S. (1998). Partial retraining: A new approach to input relevance determination. Unpublished manuscript. Nijmegen: University of Nijmegen.