An empirical evaluation of constructive neural network algorithms in classification tasks Online publication date: Wed, 25-Apr-2007
by Maria do Carmo Nicoletti, Joao R. Bertini Jr.
International Journal of Innovative Computing and Applications (IJICA), Vol. 1, No. 1, 2007
Abstract: Unlike conventional Neural Network (NN) algorithms that require the definition of the NN architecture before learning starts, Constructive Neural Network (CoNN) algorithms enable the network architecture to be constructed along with the learning process. This paper presents and discusses the results of an empirical evaluation of seven two-class CoNN algorithms, namely Tower, Pyramid, Tiling, Upstart, Shift, Perceptron Cascade (PC) and Partial Target Inversion (PTI) in 12 knowledge domains. The way each particular algorithm approaches the growing of the network determines their differences. This paper also presents and analyses empirical results of five multiclass CoNN algorithms in five knowledge domains, namely MTower, MPyramid, MTiling, MUpstart and MPerceptron Cascade, which can be considered extensions of their two-class counterparts. Results obtained with the Pocket with the Ratchet Modification (PRM) algorithm, with its multiclass version, the PRMWTA algorithm and with the back propagation algorithm, are presented for comparison.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com