Skip to main content

A New Neural Implementation of Exploratory Projection Pursuit

  • Conference paper
  • First Online:
Intelligent Data Engineering and Automated Learning — IDEAL 2002 (IDEAL 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2412))

Abstract

We investigate 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(pdf). 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(EPP). We explore the performance of our method first in response to an artificial data type, then to a real data set.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bishop, C.M, Neural Networks for Pattern Recognition, Oxford, 1995.

    Google Scholar 

  2. Diaconis, P. and Freedman D., Asymptotics of Graphical Projections. The Annals of Statistics. 12(3): 793–815, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  3. Fyfe, C., “PCA Properties of Interneurons”, From Neurobiology to Real World Computing, Proceedings of International Conference on Artificial on Artificial Neural Networks, ICAAN93, pages 183–188, 1993.

    Google Scholar 

  4. Fyfe, C. and Baddeley, R. Non-linear Data Structure Extraction using Simple Hebbian Learning, Biological Cybernetics, 72(6), 533–541, 1995.

    Article  MATH  Google Scholar 

  5. Fyfe, C. and MacDonald, D., •-Insensitive Hebbian learning, Neurocomputing, 2001

    Google Scholar 

  6. Hyverinnen, A. Complexity Pursuit: Separating interesting components from time series. Neural Computation, 13: 883–898, 2001.

    Article  Google Scholar 

  7. Karhunen, J. and Joutsensalo, J., Representation and Separation of Signals Using Nonlinear PCA Type Learning, Neural Networks, 7:113–127, 1994.

    Article  Google Scholar 

  8. Oja, E., Neural Networks, Principal Components and Subspaces, International Journal of Neural Systems, 1:61–68, 1989.

    Article  MathSciNet  Google Scholar 

  9. Oja, E., Ogawa, H., Wangviwattana, J., Principal Components Analysis by Homogeneous Neural Networks, part 1, The Weighted Subspace Criterion, IEICE Transaction on Information and Systems, E75D: 366–375, May 1992.

    Google Scholar 

  10. Oimola, A.J. and. Scholkopf, B. A Tutorial on Support Vector Regression. Technical Report NC2-TR-1998-030, NeuroCOLT2 Technical Report Series, Oct.1998.

    Google Scholar 

  11. Xu L., Least Mean Square Error Reconstruction for Self-Organizing Nets”, Neural Networks, Vol. 6, pp. 627–648, 1993.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fyfe, C., Corchado, E. (2002). A New Neural Implementation of Exploratory Projection Pursuit. In: Yin, H., Allinson, N., Freeman, R., Keane, J., Hubbard, S. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2002. IDEAL 2002. Lecture Notes in Computer Science, vol 2412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45675-9_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-45675-9_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44025-3

  • Online ISBN: 978-3-540-45675-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics