An Experimental Comparison of Three PCA Neural Networks

Authors:
Simone Fiori
Affiliations:
Department of Electronics and Automatics, University of Ancona, Ancona, Italy/ Department of Industrial Engineering, University of Perugia, Perugia, Italy. E-mail: simone@eealab.unian.it
Venue:
Neural Processing Letters
Year:
2000

Citing 6
Cited 1

Original Contribution: Principal components, minor components, and linear neural networks

Neural Networks
Original Contribution: Convergence analysis of local feature extraction algorithms

Neural Networks
Principal component neural networks: theory and applications

Principal component neural networks: theory and applications
SVD Algorithms: APEX-like versus Subspace Methods

Neural Processing Letters
Projection approximation subspace tracking

IEEE Transactions on Signal Processing
Learning in linear neural networks: a survey

IEEE Transactions on Neural Networks

Automatic prognostic determination and evolution of cognitive decline using artificial neural networks

IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a numerical and structural comparison of three neural PCA techniques: The GHA by Sanger, the APEX by Kung and Diamantaras, and the ψ–APEX first proposed by the present author. Through computer simulations we illustrate the performances of the algorithms in terms of convergence speed and minimal attainable error; then an evaluation of the computational efforts for the different algorithms is presented and discussed. A close examination of the obtained results shows that the members of the new class improve the numerical performances of the considered existing algorithms, and are also easier to implement.