Analysis and test of efficient methods for building recursive deterministic perceptron neural networks

Authors:
David A. Elizondo;Ralph Birkenhead;Mario Góngora;Eric Taillard;Patrick Luyima
Affiliations:
Centre for Computational Intelligence, School of Computing, Faculty of Computing Sciences and Engineering, De Montfort University, Leicester, UK;Centre for Computational Intelligence, School of Computing, Faculty of Computing Sciences and Engineering, De Montfort University, Leicester, UK;Centre for Computational Intelligence, School of Computing, Faculty of Computing Sciences and Engineering, De Montfort University, Leicester, UK;EIVD, University of Applied Sciences of Western Switzerland, Route de Cheseaux 1, Case postale, CH-1401 Yverdon, Switzerland;Centre for Computational Intelligence, School of Computing, Faculty of Computing Sciences and Engineering, De Montfort University, Leicester, UK
Venue:
Neural Networks
Year:
2007

Citing 10
Cited 1

A training algorithm for optimal margin classifiers

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Support-Vector Networks

Machine Learning
Growing methods for constructing recursive deterministic perceptron neural networks and knowledge extraction

Artificial Intelligence
The recursive deterministic perceptron neural network

Neural Networks
A Novel Kernel Method for Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
Current trends on knowledge extraction and neural networks

ICANN'05 Proceedings of the 15th international conference on Artificial neural networks: formal models and their applications - Volume Part II
The reduced nearest neighbor rule (Corresp.)

IEEE Transactions on Information Theory
Nosing Around the Neighborhood: A New System Structure and Classification Rule for Recognition in Partially Exposed Environments

IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond

IEEE Transactions on Neural Networks
The linear separability problem: some testing methods

IEEE Transactions on Neural Networks

Feature extraction for time-series data: An artificial neural network evolutionary training model for the management of mountainous watersheds

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Recursive Deterministic Perceptron (RDP) feed-forward multilayer neural network is a generalisation of the single layer perceptron topology. This model is capable of solving any two-class classification problem as opposed to the single layer perceptron which can only solve classification problems dealing with linearly separable sets. For all classification problems, the construction of an RDP is done automatically and convergence is always guaranteed. Three methods for constructing RDP neural networks exist: Batch, Incremental, and Modular. The Batch method has been extensively tested and it has been shown to produce results comparable with those obtained with other neural network methods such as Back Propagation, Cascade Correlation, Rulex, and Ruleneg. However, no testing has been done before on the Incremental and Modular methods. Contrary to the Batch method, the complexity of these two methods is not NP-Complete. For the first time, a study on the three methods is presented. This study will allow the highlighting of the main advantages and disadvantages of each of these methods by comparing the results obtained while building RDP neural networks with the three methods in terms of the convergence time, the level of generalisation, and the topology size. The networks were trained and tested using the following standard benchmark classification datasets: IRIS, SOYBEAN, and Wisconsin Breast Cancer. The results obtained show the effectiveness of the Incremental and the Modular methods which are as good as that of the NP-Complete Batch method but with a much lower complexity level. The results obtained with the RDP are comparable to those obtained with the backpropagation and the Cascade Correlation algorithms.