Skip to main content

The Universal Approximation Capability of Double Flexible Approximate Identity Neural Networks

  • Conference paper
  • First Online:
Computer Engineering and Networking

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 277))

Abstract

This study investigates the universal approximation capability of three-layer feedforward double flexible approximate identity neural networks in the space of continuous functions with two variables. First, we propose double flexible approximate identity functions, which are a combination of double approximate identity functions and flexible approximate identity functions as investigated in our previous studies. Then, we prove that any continuous function f with two variables will converge to itself if it convolves with double flexible approximate identity. Finally, we prove a main theorem by using the obtained results.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. Cybenko, G. (1989). Approximation by superpositions of sigmoidal function. Mathematics of Control, Signals and Systems, 2(4), 303–314.

    Article  MATH  MathSciNet  Google Scholar 

  2. Funahashi, K. (1989). On the approximate realization of continuous mappings by neural network. Neural Networks, 2(3), 183–192.

    Article  Google Scholar 

  3. Park, J., & Sandberg, I. W. (1991). Universal approximation using radial-basis-function networks. Neural Computation, 3(2), 246–257.

    Article  Google Scholar 

  4. Liao, Y., Fang, S. C., & Nuttle, H. L. W. (2003). Relaxed conditions for radial-basis function networks to be universal approximators. Neural Networks, 16(7), 1019–1028.

    Article  MATH  Google Scholar 

  5. Sanguineti, M. (2008). Universal approximation by ridge Computational models and neural networks: a survey. The Open Applied Mathematics Journal, 2(1), 31–58.

    Article  MathSciNet  Google Scholar 

  6. Zainuddin, Z., & Panahian Fard, S. (2012). Double approximate identity neural networks universal approximation in real Lebesgue spaces. Neural information processing. Lecture Notes in Computer Science, vol. 7663, (pp. 409–415). Berlin, Heidelberg: Springer.

    Google Scholar 

  7. Yang, X., Chen, S., & Chen, B. (2012). Plane-Gaussian artificial neural network. Neural Computing and Applications, 21(2), 305–317.

    Article  Google Scholar 

  8. Panahian Fard, S., & Zainuddin, Z. (2013). On the universal approximation capability of flexible approximate identity neural networks. Emerging technologies for information systems, computing, and management. Lecture Notes in Electrical Engineering, vol. 236, (pp. 201–27). New York: Springer.

    Google Scholar 

  9. Panahian Fard, S., & Zainuddin, Z. (2013). Analyses for L P [a, b]-norm approximation capability of flexible approximate identity neural networks. Neural Computing and Applications, DOI 10.1007/s00521-013-1493-9

  10. Fernández, N. F., Hervás, M. C., Sanchez, M. J., & Gutiírrez, P. A. (2011). MELM-GRBF: A modified version of the extreme learning machine for generalized radial basis function neural networks. Neurocomputing, 74(16), 2502–2510.

    Article  Google Scholar 

  11. Panahian Fard, S., & Zainuddin, Z. (2013). The universal approximation capabilities of Mellin approximate identity neural networks. Advances in Neural Networks- ISNN 2013. Lecture Notes in Computer Science, vol. 7951, (pp. 205–213). Berlin, Heidelberg: Springer.

    Google Scholar 

  12. Ditkin, V. A., & Prudnikov, A. P. (1962). Operation calculus in two variable and its applications. New York: Pergamon press.

    Google Scholar 

  13. Lebedev, V. (1997). An introduction to functional analysis and computational mathematics. Boston: Birkhäuser.

    Google Scholar 

  14. Jones, F. (1997). Lebesgue integration on Euclidean space. Boston: Jones and Bartlett.

    Google Scholar 

  15. Wu, W., Nan, D., Li, Z., & Long, J. (August 2007). Approximation to compact set of functions by feedforward neural networks. In 20th International Joint Conference on Neural Networks, Orlando, Fl, USA, pp. 1222–1225.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Saeed Panahian Fard .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Fard, S.P., Zainuddin, Z. (2014). The Universal Approximation Capability of Double Flexible Approximate Identity Neural Networks. In: Wong, W.E., Zhu, T. (eds) Computer Engineering and Networking. Lecture Notes in Electrical Engineering, vol 277. Springer, Cham. https://doi.org/10.1007/978-3-319-01766-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01766-2_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01765-5

  • Online ISBN: 978-3-319-01766-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics