Show simple item record

dc.contributor.authorElizondo, Daviden
dc.contributor.authorBirkenhead, Ralph, 1955-en
dc.contributor.authorGongora, Mario Augustoen
dc.contributor.authorLuyima, P.en
dc.contributor.authorTaillard, Eric
dc.identifier.citationElizondo, D.A. et al. (2007) Analysis and test of efficient methods for building recursive deterministic perceptron neural networks. Neural Networks, 20 (10), pp. 1095-1108.
dc.descriptionThis paper introduces a comparison study of three existing methods for building Recursive Deterministic Perceptron Neural Networks. Three methods were compared in terms of their level of generalisation, convergence time and topology sizes. Prior to this study only an exhaustive, NP-Complete method was used for building RDP neural networks. Due to its high complexity, this limited its use in real world classification problems. This work shows that the other two methods, with a polynomial time complexity, can be used as an alternative. These results will widen the use of the RDP neural network. The impact factor is 2.000.en
dc.publisherNeural Networksen
dc.subjectRAE 2008
dc.subjectUoA 23 Computer Science and Informatics
dc.subjectrecursive deterministic perceptron
dc.subjectbatch learning
dc.subjectincremental learning
dc.subjectmodular learning
dc.subjectperformance sensitivity analysis
dc.subjectconvergence time
dc.titleAnalysis and test of efficient methods for building recursive deterministic perceptron neural networks.en
dc.researchgroupCentre for Computational Intelligence
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record