One of the most commonly known algorithm to perform neural Principal Component Analysis of real-valued random signals is the Kung-Diamantaras' Adaptive Principal component EXtractor (APEX) for a laterally-connected neural architecture. In this paper we present a new approach to obtain an APEX-like PCA procedure as a special case of a more general class of learning rules, by means of an optimization theory specialized for the laterally-connected topology. Through simulations we show the new algorithms can be faster than the original one.
A new class of APEX-like PCA algorithms / Fiori, S; Uncini, Aurelio; Piazza, F.. - 3:(1998), pp. 66-69. [10.1109/ISCAS.1998.703898]
A new class of APEX-like PCA algorithms
UNCINI, Aurelio;
1998
Abstract
One of the most commonly known algorithm to perform neural Principal Component Analysis of real-valued random signals is the Kung-Diamantaras' Adaptive Principal component EXtractor (APEX) for a laterally-connected neural architecture. In this paper we present a new approach to obtain an APEX-like PCA procedure as a special case of a more general class of learning rules, by means of an optimization theory specialized for the laterally-connected topology. Through simulations we show the new algorithms can be faster than the original one.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
