Art

J-GLOBAL ID：200902125272408873   Reference number：98A0639508

An Upper Bound on the Node Complexity of Depth-2 Multilayer Perceptrons.

深さ2の多層パーセプトロンのノード複雑度の上限について

Author (1)： ARAI MASAHIKO (東海大 開発工)
Material： 電子情報通信学会論文誌 D-1  (IEICE Transactions on Information and Systems, Pt.1 (Japanese Edition))
Volume： J81-D-1  Issue： 6  Page： 685-690  Publication year： Jun. 1998 
JST Material Number： S0757B  ISSN： 0915-1915  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *perceptron ,...
Semi thesaurus term： neural network model ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=98A0639508&from=J-GLOBAL&jstjournalNo=S0757B") }}

JST classification (1)： Theory of computation  (JB02000A)

Reference (12)：

• HORNE, B. G. On the node complexity of neural networks. Neural Networks. 1994, 7, 9, 1413-1426
• BAUM, E. What size net gives valid generalization. Neural Computation. 1989, 1, 151-160
• VAPNIK, V. N. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications. 1971, 16, 2, 264-281
• MUROGA, S. Threshold logic and its applications. 1971
• WINDER, R. Threshold logic asymptotes. IEEE Transactions on Computers. 1970, C-19, 4, 394-353

Terms in the title (4)： 多層パーセプトロン ,  ノード ,  複雑度 ,  上限