Skip to main content

Growing Greedy Search and Its Application to Hysteresis Neural Networks

  • Conference paper
  • First Online:
Book cover Neural Information Processing (ICONIP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9491))

Included in the following conference series:

Abstract

This paper presents the growing greedy search algorithm and its application to associative memories of hysteresis neural networks in which storage of desired memories are guaranteed. In the algorithm, individuals correspond to cross-connection parameters, the cost function evaluates the number of spurious memories, and the set of individuals can grow depending on the global best. Performing basic numerical experiments, the algorithm efficiency is investigated.

T. Saito—This work is supported in part by JSPS KAKENHI\(\#\)15K00350.

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 EPUB and 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

References

  1. Jin’no, K., Saito, T.: Analysis and synthesis of a continuous-time hysteresis neural network. In: Proceedings of IEEE/ISCAS, pp. 471–474 (1992)

    Google Scholar 

  2. Jin’no, K., Nakamura, T., Saito, T.: Analysis of bifurcation phenomena in a 3 cells hysteresis neural network. IEEE Trans. Circuit Syst. I 46(7), 851–857 (1999)

    Article  Google Scholar 

  3. Jin’no, K., Tanaka, M.: Hysteresis quantizer, In: Proceedings of IEEE/ISCAS, pp. 661–664 (1997)

    Google Scholar 

  4. Nakaguchi, T., Jin’no, K., Tanaka, M.: Hysteresis neural networks for n-queens problems. IEICE Trans. Fund. E82–A(9), 1851–1859 (1999)

    Google Scholar 

  5. Nakaguchi, T., Isome, S., Jin’no, K., Tanaka, M.: Box puzzling problem solver by hysteresis neural networks. IEICE Trans. Fund. E84–A(9), 2173–2181 (2001)

    Google Scholar 

  6. Couvreur, C., Bresler, Y.: On the optimality of the backward greedy algorithm for the subset selection problem. SIAM J. Matrix Anal. Appl. 21(3), 797–808 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ertel, W.: Introduction to Artificial Intelligence. Springer, London (2009)

    MATH  Google Scholar 

  8. Hopfield, J.J.: Neural networks and physical systems with emergent collective computation abilities. Proc. Natl. Acad. Sci. 79, 2554–2558 (1982)

    Article  MathSciNet  Google Scholar 

  9. Müezzinoglu, M.K., Güzelis, G.: A Boolean Hebb rule for binary associative memory design. IEEE Trans. Neural Netw. 15(1), 195–202 (2004)

    Article  Google Scholar 

  10. Tarzan-Lorente, M., Gutierrez-Galvez, Dominique Martinez, D., Marco, S.: A Biologically inspired associative memory for artificial olfaction. In: Proceedings of IJCNN, pp. 25–30 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Toshimichi Saito .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Yamaoka, K., Saito, T. (2015). Growing Greedy Search and Its Application to Hysteresis Neural Networks. In: Arik, S., Huang, T., Lai, W., Liu, Q. (eds) Neural Information Processing. ICONIP 2015. Lecture Notes in Computer Science(), vol 9491. Springer, Cham. https://doi.org/10.1007/978-3-319-26555-1_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26555-1_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26554-4

  • Online ISBN: 978-3-319-26555-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics