Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Possibilistic Approach to RBFN Centers Initialization

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2005)

Abstract

Clustering techniques have always been oriented to solve classification and pattern recognition problems. This clustering techniques have been used also to initialize the centers of the Radial Basis Function (RBF) when designing an RBF Neural Network (RBFNN) that approximates a function. Since classification and function approximation problems are quite different, it is necessary to design a new clustering technique specialized in the problem of function approximation. In this paper, a new clustering technique it is proposed to make the right initialization of the centers of the RBFs. The novelty of the algorithm is the employment of a possibilistic partition of the data, rather than a hard or fuzzy partition as it is commonly used in clustering algorithms. The use of this kind of partition with the addition of several components to use the information provided by the output, allow the new algorithm to provide better results and be more robust than the other clustering algorithms even if noise exits in the input data.

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
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Barni, M., Capellini, V., Mecocci, A.: Comments on A posibilistic approach to clustering. IEEE Transactions on Fuzzy Systems 4, 393–396

    Google Scholar 

  2. Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum, New York (1981)

    MATH  Google Scholar 

  3. Bors, A.G.: Introduction of the Radial Basis Function (RBF) networks. OnLine Symposium for Electronics Engineers 1, 1–7 (2001)

    Google Scholar 

  4. Duda, R.O., Hart, P.E.: Pattern classification and scene analysis. Wiley, New York (1973)

    MATH  Google Scholar 

  5. Gersho, A.: Asymptotically Optimal Block Quantization. IEEE Transanctions on Information Theory 25(4), 373–380 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  6. Guillén, A., Rojas, I., Gonzalez, J., Pomares, H., Herrera, L.J.: Clustering based algorithm for rfbs centers initialization. In: XI SIGEF Congress, Techniques and Methodologies for the Information and Knowledge Economy, Reggio Calabria-Messina, November 2004, pp. 44–63 (2004)

    Google Scholar 

  7. Guillén, A., Rojas, I., Gonzalez, J., Pomares, H., Herrera, L.J., Prieto, A.: Using a new clustering algorithm to design rbf networks for functional approximation problem. In: Proceedings of the Learning 2004 International Conference, Elche, October 2004, pp. 19–24 (2004)

    Google Scholar 

  8. Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)

    MATH  Google Scholar 

  9. Karayannis, N.B., Mi, G.W.: Growing radial basis neural networks: Merging supervised and unsupervised learning with network growth techniques. IEEE Transactions on Neural Networks 8, 1492–1506 (1997)

    Article  Google Scholar 

  10. Krishnapuram, R., Keller, J.M.: A Possibilistic Approach to Clustering. IEEE Transactions on Fuzzy Systems 1(2), 98–110 (1993)

    Article  Google Scholar 

  11. Park, J., Sandberg, J.W.: Universal approximation using radial basis functions network. Neural Computation 3, 246–257 (1991)

    Article  Google Scholar 

  12. Patanè, G., Russo, M.: The Enhanced-LBG algorithm. Neural Networks 14(9), 1219–1237 (2001)

    Article  Google Scholar 

  13. Rojas, I., Anguita, M., Prieto, A., Valenzuela, O.: Analysis of the operators involved in the definition of the implication functions and in the fuzzy inference proccess. Int. J. Approximate Reasoning 19, 367–389 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  14. Zhang, J., Leung, Y.: Improved possibilistic C–means clustering algorithms. IEEE Transactions on Fuzzy Systems 12, 209–217 (2004)

    Article  MathSciNet  Google Scholar 

  15. Zhu, Q., Cai, Y., Liu, L.: A global learning algorithm for a RBF network. Neural Networks 12, 527–540 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guillén, A. et al. (2005). A Possibilistic Approach to RBFN Centers Initialization. In: Ślęzak, D., Yao, J., Peters, J.F., Ziarko, W., Hu, X. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548706_19

Download citation

  • DOI: https://doi.org/10.1007/11548706_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28660-8

  • Online ISBN: 978-3-540-31824-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics