Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.54, Iss.1, 1997-02, pp. : 169-176

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Neural Networks with Quadratic VC Dimension

By Koiran P. Sontag E.D.

Journal of Computer and System Sciences, Vol. 54, Iss. 1, 1997-02 ,pp. : 190-198

Academic Press

Access to resources Recommend Favorite

Sigmoidal Function Classes for Feedforward Artificial Neural Networks

By Chandra Pravin

Neural Processing Letters, Vol. 18, Iss. 3, 2003-12 ,pp. : 205-215

Springer Publishing Company

Access to resources Recommend Favorite

Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension

By Haussler D.

Machine Learning, Vol. 14, Iss. 1, 1994-01 ,pp. : 83-113

Springer Publishing Company

Access to resources Recommend Favorite

Approximation and Estimation Bounds for Artificial Neural Networks

By Barron A.R.

Machine Learning, Vol. 14, Iss. 1, 1994-01 ,pp. : 115-133

Springer Publishing Company

Access to resources Recommend Favorite

Fuzzy Polynomial Neuron-Based Self-Organizing Neural Networks

By Oh S-K. Pedrycz W.

International Journal of General Systems, Vol. 32, Iss. 3, 2003-05 ,pp. : 237-250

Taylor & Francis Ltd

Access to resources Recommend Favorite