Skip to main content

Studying the Convergence of the CFA Algorithm

  • Conference paper
  • First Online:
Computational Methods in Neural Modeling (IWANN 2003)

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

Included in the following conference series:

Abstract

This paper studies the convergence properties of the previously proposed CFA (Clustering for Function Approximation) algorithm and compares its behavior with other input-output clustering techniques also designed for approximation problems. The results obtained show that CFA is able to obtain an initial configuration from which an approximator can improve its performance.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. J. C. Bezdek. Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum, New York, 1981.

    MATH  Google Scholar 

  2. J. González, I. Rojas, and H. Pomares. Neural Networks, Clustering Techniques, and Function Approximation Problems. In ICANN 2002, LNCS 2415, pages 553–568, Madrid, Spain, 2002.

    Chapter  Google Scholar 

  3. N. B. Karayiannis and G. W. Mi. Growing Radial Basis Neural Networks: Merging Supervised and Unsupervised Learning with Network Growth Techniques. IEEE Trans. Neural Networks, 8(6):1492–1506, Nov. 1997.

    Article  Google Scholar 

  4. W. Pedrycz. Conditional Fuzzy Clustering in the Design of Radial Basis Function Neural Networks. IEEE Trans. Neural Networks, 9(4):601–612, 1998.

    Article  Google Scholar 

  5. H. Pomares, I. Rojas, J. Ortega, J. González, and A. Prieto. A Systematic Approach to a Self-Generating Fuzzy Rule-Table for Function Approximation. IEEE Trans. Syst., Man, Cyber. Part B, 30(3):431–447, June 2000.

    Article  Google Scholar 

  6. T. A. Runkler and J. C. Bezdek. Alternating Cluster Estimation: A New Tool for Clustering and Function Approximation. IEEE Trans. Fuzzy Systems, 7(4):377–393, Aug. 1999.

    Article  Google Scholar 

  7. E. L. Sutanto, J. D. Masson, and K. Warwick. Mean-Tracking Clustering Algorithm for Radial Basis Function Center Selection. Int. J. Contr., 67(6):961–977, 1997.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

González, J., Rojas, I., Pomares, H., Ortega, J. (2003). Studying the Convergence of the CFA Algorithm. In: Mira, J., Álvarez, J.R. (eds) Computational Methods in Neural Modeling. IWANN 2003. Lecture Notes in Computer Science, vol 2686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44868-3_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-44868-3_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44868-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics