Skip to main content

On the Discrete Time Dynamics of the MCA Neural Networks

  • Conference paper
Book cover Advances in Neural Networks – ISNN 2004 (ISNN 2004)

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

Included in the following conference series:

Abstract

Minor component analysis(MCA) by neural network is endowed with a stochastic discrete-time(SDT) weight vector learning algorithm. It is very difficult to study such algorithm directly. Previous theoretical results on the SDT algorithm are based on its deterministic continuous-time(DCT) ODE asymptotic approximation. However, in general, they are not equivalent at all. Since the behavior of the conditional expectation of the weight vector can be studied by the deterministic discrete-time(DDT) algorithm, it is reasonable to study the SDT algorithm by its DDT algorithm indirectly. By studying the DDT algorithms, we can prove that some of previous MCA neural networks are globally convergent if the learning rate is a variable.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Anisse, T., Gianalvo, C.: Against the convergence of the minor component analysis neurons. IEEE Trans. Neural Network 10, 207–210 (1999)

    Article  Google Scholar 

  2. Cirrincione, G., Cirrincione, M., Herault, J., Huffel, S.V.: The MCA EXIN Neuron for the minor component anlysis. IEEE Trans. Neural Network 13, 160–187 (2002)

    Article  Google Scholar 

  3. Feng, D.Z., Bao, Z., Jiao, L.C.: Total least mean squares algorithm. IEEE Trans. Signal Processing 46, 2122–2130 (1998)

    Article  Google Scholar 

  4. Fiori, S., Piazza, F.: Neural MCA for robust beamforming. In: Proc. of International Symposium on Circuits and Systems (ISCAS 2000), vol. III, pp. 614–617 (2000)

    Google Scholar 

  5. Luo, F., Unbehauen, R., Cichocki, A.: A minor component analysis algorithm. Neural Networks 10, 291–297 (1997)

    Article  Google Scholar 

  6. Mathew, G., Reddy, V.: Developement and analysis of a neural network approach to Pisarenko’s harmonic retrieval method. IEEE Trans. Signal Processing 42, 663–667 (1994)

    Article  Google Scholar 

  7. Oja, E.: Principal components, Minor components, and linear neural networks. Neural Networks 5, 927–935 (1992)

    Article  Google Scholar 

  8. Oja, E., Wang, L.: Robust fitting by non-linear neural units. Neural networks 9, 435–444 (1996)

    Article  Google Scholar 

  9. Xu, L., Oja, E., Suen, C.: Modified Hebbian learning for curve and surface fitting. Neural Networks 5, 441–457 (1992)

    Article  Google Scholar 

  10. Zuffiria, P.J.: On the discrete time dynamics of the basic hebbian nerual network node. IEEE Trans. Neural Network 13, 1342–1352 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ye, M., Yi, Z. (2004). On the Discrete Time Dynamics of the MCA Neural Networks. In: Yin, FL., Wang, J., Guo, C. (eds) Advances in Neural Networks – ISNN 2004. ISNN 2004. Lecture Notes in Computer Science, vol 3173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28647-9_134

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28647-9_134

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22841-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics