A new scaling kernel-based fuzzy system with low computational complexity

  • Authors:
  • Xiaojun Liu;Jie Yang;Hongbin Shen;Xiangyang Wang

  • Affiliations:
  • Institute of Image Processing & Pattern Recognition, Shanghai Jiaotong University, Shanghai, P.R. China;Institute of Image Processing & Pattern Recognition, Shanghai Jiaotong University, Shanghai, P.R. China;Institute of Image Processing & Pattern Recognition, Shanghai Jiaotong University, Shanghai, P.R. China;Institute of Image Processing & Pattern Recognition, Shanghai Jiaotong University, Shanghai, P.R. China

  • Venue:
  • CSR'06 Proceedings of the First international computer science conference on Theory and Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The approximation capability of fuzzy systems heavily depends on the shapes of the chosen fuzzy membership functions. When fuzzy systems are applied in adaptive control, computational complexity and generalization capability are another two important indexes we must consider. Inspired by the conclusion drawn by S.Mitaim and B.Kosko and wavelet analysis and SVM, the scaling kernel-based fuzzy system SKFS(Scaling Kernel-based Fuzzy System) is presented as a new simplified fuzzy system in this paper, based on Sinc x membership functions. SKFS can approximate any function in L2(R), with much less computational complexity than classical fuzzy systems. Compared with another simplified fuzzy system GKFS(Gaussian Kernel-based Fuzzy System) using Gaussian membership functions, SKFS has a better approximation and generalization capabilities, especially in the coexistence of linearity and nonlinearity. Therefore, SKFS is very suitable for fuzzy control. Finally, several experiment results are used to demonstrate the effectiveness of the new simplified fuzzy system SKFS.