登入選單

返回Google圖書搜尋

Neural Network Constructive Algorithms: Trading Generalization for Learning Efficiency?

Frank J. ŚmiejaGesellschaft für Mathematik und Datenverarbeitung

出版	Gesellschaft für Mathematik und Datenverarbeitung mbH, 1992
URL	http://books.google.com.hk/books?id=bTEzHAAACAAJ&hl=&source=gbs_api

註釋

Abstract: "There are currently several types of constructive, or growth, algorithms available for training a feed-forward neural network. This paper describes and explains the main ones, using a fundamental approach to the multi-layer perceptron problem-solving mechanisms. The claimed convergence properties of the algorithms are verified using just two mapping theorems, which consequently enables all the algorithms to be unified under a basic mechanism. The algorithms are compared and contrasted and the deficiencies of some highlighted. The fundamental reasons for the actual success of these algorithms are extracted, and used to suggest where they might most fruitfully be applied. A suspicion that they are not a panacea for all current neural network difficulties, and that one must somewhere along the line pay for the learning efficiency they promise, is developed into an argument that their generalization abilities will lie on average below that of back-propagation."