[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Cost-Sensitive Greedy Network-Growing Algorithm with Gaussian Activation Functions

  • Conference paper
Neural Information Processing (ICONIP 2004)

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

Included in the following conference series:

Abstract

In this paper, we propose a new network-growing algorithm which is called the cost-sensitive greedy network-growing algorithm. This new method can maximize information while controlling the associated cost. Experimantal results show that the cost minimization approximates input patterns as much as possible, while information maximization aims to extract distinctive features.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. Fahlman, S.E., Lebiere, C.: The cascade-correlation learning architecture. In: Advances in Neural Information Processing, vol. 2, pp. 524–532. Morgan Kaufmann Publishers, San Mateo (1990)

    Google Scholar 

  2. Shultz, T.A., Rivest, F.: Knowledge-based cascade-correlation: Using knowledge to speed learning. Connection Science 13, 43–72 (2001)

    Article  MATH  Google Scholar 

  3. Lehtokangas, M.: Modelling with constructive backpropagation architecture. Neural Networks 12, 707–716 (1999)

    Article  Google Scholar 

  4. Kamimura, R., Kamimura, T., Takeuchi, H.: Greedy information acquisition algorithm: A new information theoretic approach to dynamic information acquisition in neural networks. Connection Science 14(2), 137–162 (2002)

    Article  Google Scholar 

  5. Kamimura, R.: Progressive feature extraction by greedy network-growing algorithm. Complex Systems 14(2), 127–153 (2003)

    MATH  MathSciNet  Google Scholar 

  6. Kamimura, R., Kamimura, T., Uchida, O., Takeuchi, H.: Greedy information acquisition algorithm. In: Proc. of International Joint Conference on Neural Networks (2002)

    Google Scholar 

  7. Kamimura, R., Uchida, O.: Accelerated Greedy Network-Growing Algorithmwith application to Student Survey. In: Proc. of IASTED International Conference on Applied Simulation and Modelling (2003)

    Google Scholar 

  8. Kamimura, R., Uchida, O.: Improving Feature Extraction Performance of Greedy Network-Growing Algorithm. In: Liu, J., Cheung, Y.-m., Yin, H. (eds.) IDEAL 2003. LNCS, vol. 2690, pp. 1056–1061. Springer, Heidelberg (2003)

    Google Scholar 

  9. Gatlin, L.L.: Information Theory and Living Systems. Columbia University Press (1972)

    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

Kamimura, R., Uchida, O. (2004). Cost-Sensitive Greedy Network-Growing Algorithm with Gaussian Activation Functions. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds) Neural Information Processing. ICONIP 2004. Lecture Notes in Computer Science, vol 3316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30499-9_100

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30499-9_100

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23931-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics