Neural network architecture selection: Size depends on function complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4131 LNCS - I, Issue , 2006, Pages 122-129

  Gómez, Iván ^a   Franco, Leonardo ^a   Subirats, José L ^a   Jerez, José M ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; SET THEORY;

ASSOCIATION RULE DISCOVERY (ARD); COMPLEXITY FUNCTIONS; NEURAL ARCHITECTURE;

NEURAL NETWORKS;

EID: 33749869958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11840817_13     Document Type: Conference Paper

References (21)

1. Haykin, S. (1994). Neural Networks: A Comprehensive Foundation. Macmillan/IEEE Press.
2. Baum, E.B. & Haussler, D. (1989) What size net gives valid generalization? Neural Computation, 1, pp. 151-160.
3. Lawrence, S., Giles, C. L., & Tsoi, A. C. (1996). What Size Neural Network Gives Optimal Generalization ? Convergence Properties of Backpropagation. In Technical Report UMIACS-TR-96-22 and CS-TR-3617, Institute for Advanced Computer Studies, Univ, of Maryland.
4. Caruana, R., Lawrence, S., & Giles, C.L. (2001). Overfitting in Neural Networks: Backpropagation, Conjugate Gradient, and Early Stopping. In Leen, T. K., Dietterich, T. G. & Tresp, V. editors, Advances in Neural Information Processing Systems, MIT Press, 13, pp. 402-408.
5. Krogh, A. & Hertz,J.A. (1992) A simple weight decay can improve generalization. In J.E. Moody, S. J. Hanson, & R. P. Lippmann editors, Advances in Neural Information Processing Systems Morgan Kaufmann, San Mateo, CA, 4, pp. 950 957.
6. Prechelt, L. (1998). Automatic Early Stopping Using Cross Validation: Quantifying the Criteria. Neural Networks, 11, pp.761-767.
7. Setiono,R. (2001) Feedforward neural network construction using cross-validation, Neural Computation, 13, pp. 2865-2877.
8. Bartlett,P.L. (1997). For valid generalization the size of the weights is more important than the size of the network. In M.C, Mozer, M. I. Jordan, & T. Petsche, editors, Advances in Neural Information Processing Systems, MIT Press, 9, pp. 134-140.
9. Franco, L. & Anthony, M. (2004). On a generalization complexity measure for Boolean functions. In Proceedings of the 2004 IEEE International Joint Conference on Neural Networks, IEEE Press, pp. 973-978.
10. Franco, L. Generalization ability of Boolean functions implemented in feedforward neural networks. Neurocomputing. (2006), In Press.
11. Franco, L. and Anthony, M. The influence of oppositely classified examples on the generalization complexity of Boolean functions, IEEE Transactions on Neural Networks. (2006), In Press.
12. Wegener, I. (1987) The complexity of Boolean functions. Wiley and Sons Inc.
13. Siu, K.Y., Roychowdhury, V.P., & Kailath, T. (1991) Depth-Size Tradeoff's for Neural Computation IEEE Transactions on Computers, 40, pp. 1402-1412.
14. Franco, L. & Cannas, S.A. (2004), Non glassy ground-state in a long-range antiferromagnetic frustrated model in the hypercubic cell Physica A, 382, pp. 337-348.
15. Franco, L. & Cannas, S.A. (2000). Generalization and Selection of Examples in Feedforward Neural Networks. Neural Computation, 12, 10, pp. 2405-2426.
16. Franco, L. & Cannas, S.A. (2001). Generalization Properties of Modular Networks: Implementing the Parity Function, IEEE Transactions on Neural Networks, 12, pp. 1306-1313.
17. Becquet, C. & Blachon, S. & Jeudy, B. & Boulicaut, J.F. & Gandrillon, O. (2002). Strong association rules mining for large-scale gene-expression data analysis: A case study on human SAGE data. Genome Biology, 3, pp. 1-16.
18. Creighton, C. & Hanash, S. (2003). Mining gene expressions databases for association rules, Bioinformatics, 19, pp. 79-86.
19. Agrawal, R. & Imielinski, T. & Swami, A. (1993). Mining associations rules between sets of items in large databases. In Proceedings of the ACM SIGMOD international conference on Management of data, Washignton D.C., pp. 207-216.
20. Brian, S. & Motwani, R. & Silverstein, C. (1997). Beyond Market baskets: Generalizing associations rules to correlations. In Proceedings of the ACM SIGMOD conference, Tucson, pp. 265-276.
21. Franco, L. & Jerez, J.M. & Bravo. J.M (2005). Role of function complexity and network size in the generalization ability of feedforward networks. LNCS, 3512, pp. 1-8.