论文信息 - Optimal projections of high dimensional data

Optimal projections of high dimensional data

In this paper, we compare two artificial neural network algorithms for performing Exploratory Projection Pursuit, a statistical technique for investigating data by projecting it onto lower dimensional manifolds. The neural networks are extensions of a network which performs Principal Component Analysis. We illustrate the technique on artificial data before applying it to real data.

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

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

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

[3] K. S. Fu,et al. Stochastic approximation , 1994 .

[4] Colin Fyfe,et al. epsilon-insensitive Hebbian learning , 2002, Neurocomputing.

[5] Lei Xu,et al. Least mean square error reconstruction principle for self-organizing neural-nets , 1993, Neural Networks.

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

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

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

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

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

[11] E. Oja,et al. Independent Component Analysis , 2013 .

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

[13] Colin Fyfe. Negative feedback as an organising principle for artificial neural networks , 1995 .

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