Skip to main content

A Hamming Maxnet That Determines all the Maxima

  • Conference paper
Artificial Intelligence: Theories, Models and Applications (SETN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5138))

Included in the following conference series:

Abstract

In this paper the problem of the determination of the maximum among the M members of a set of positive real numbers S is considered. More specifically, a version of the Hamming Maxnet is proposed that is able to determine all maxima of S, in contrast to the original Hamming Maxnet and most of its variants, which can not deal with multiple maxima in S. A detailed convergence analysis of the proposed network is provided. Also, the proposed version is compared with other variants of the Hamming Maxnet via simulations.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Chen, C.-M., Hsu, M.-H., Wang, T.-Y.: A fast winner-take-all neural network with the dynamic ratio. Journal of Information Science and Engineering 18, 187–210 (2002)

    Google Scholar 

  2. Floreen, P.: The Convergence of Hamming Memory Networks. IEEE Trans. on Neural Networks 2(4) (1991)

    Google Scholar 

  3. Koutroumbas, K., Kalouptsidis, N.: Qualitative Analysis of the Parallel and asynchronous modes of the Hamming Network. IEEE Trans. on Neural Networks 5(3), 380–391 (1994)

    Article  Google Scholar 

  4. Koutroumbas, K.: Accelerating the Hamming Maxnet. In: Vouros, G.A., Panayiotopoulos, T. (eds.) SETN 2004. LNCS (LNAI), vol. 3025, pp. 338–347. Springer, Heidelberg (2004)

    Google Scholar 

  5. Koutroumbas, K., Kalouptsidis, N.: Generalized Hamming Networks and applications. Neural Networks 18(7), 896–913 (2005)

    Article  MATH  Google Scholar 

  6. Lippmann, R.P.: An Introduction to Computing with Neural Nets. IEEE ASSP Magazine 4(2) (April 1987)

    Google Scholar 

  7. Meilijson, I., Ruppin, E., Sipper, M.: A single-iteration threshold Hamming Network. IEEE Transactions on Neural Networks 6, 261–266 (1995)

    Article  Google Scholar 

  8. Sum, J., Tam, P.K.S.: Note on the Maxnet dynamics. Neural Computation 8(3), 491–499 (1996)

    Article  Google Scholar 

  9. Yadid-Pecht, O., Gur, M.: A biologically-inspired improved Maxnet. IEEE Transactions on Neural Networks 6(3), 757–759 (1995)

    Article  Google Scholar 

  10. Yang, J.F., Chen, C.M., Wang, W.C., Lee, J.Y.: A general mean based iteration winner-take-all neural network. IEEE Transactions on Neural Networks 6(1), 14–24 (1995)

    Article  Google Scholar 

  11. Yang, J.F., Chen, C.M.: Winner-take-all neural networks using the highest threshold. IEEE Transactions on Neural Networks 11(1), 194–199 (2000)

    Article  Google Scholar 

  12. Yen, J.C., Chang, S.: Improved winner-take-all neural network. Electronics Letters, 662–664 (1992)

    Google Scholar 

  13. Yen, J.C., Chang, F.J., Chang, S.: A new winners-take-all architecture in artificial neural networks. IEEE Transactions on Neural Networks 5(5), 838–843 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

John Darzentas George A. Vouros Spyros Vosinakis Argyris Arnellos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koutroumbas, K. (2008). A Hamming Maxnet That Determines all the Maxima. In: Darzentas, J., Vouros, G.A., Vosinakis, S., Arnellos, A. (eds) Artificial Intelligence: Theories, Models and Applications. SETN 2008. Lecture Notes in Computer Science(), vol 5138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87881-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87881-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-87881-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics