论文信息 - Maximum likelihood Hebbian rules

Maximum likelihood Hebbian rules

In this paper, we review an extension of the learning rules in a Principal Component Analysis network which has been derived to be optimal for a specific probability density function. We note that this probability density function is one of a family of pdfs and investigate the learning rules formed in order to be optimal for several members of this family. We show that, whereas previous authors (5) have viewed the single member of the family as an extension of PCA, it is more appropriate to view the whole family of learning rules as methods of performing Exploratory Projection Pursuit. We illustrate this on artificial data sets.

Emilio Corchado | Colin Fyfe | C. Fyfe | E. Corchado

[1] Juha Karhunen,et al. Representation and separation of signals using nonlinear PCA type learning , 1994, Neural Networks.

[2] E. Oja,et al. Principal component analysis by homogeneous neural networks, Part I : The weighted subspace criterion , 1992 .

[3] Heekuck Oh,et al. Neural Networks for Pattern Recognition , 1993, Adv. Comput..

[4] Colin Fyfe,et al. Non-linear data structure extraction using simple hebbian networks , 1995, Biological Cybernetics.

[5] Colin Fyfe. PCA Properties of Interneurons , 1993 .

[6] D. Freedman,et al. Asymptotics of Graphical Projection Pursuit , 1984 .

[7] Bernhard Schölkopf,et al. A tutorial on support vector regression , 2004, Stat. Comput..

[8] Aapo Hyvärinen,et al. Complexity Pursuit: Separating Interesting Components from Time Series , 2001, Neural Computation.

[9] Erkki Oja,et al. Neural Networks, Principal Components, and Subspaces , 1989, Int. J. Neural Syst..