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

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 Sine × 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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Liu, X., Yang, J., Shen, H., & Wang, X. (2006). A new scaling kernel-based fuzzy system with low computational complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3967 LNCS, pp. 466–474). Springer Verlag. https://doi.org/10.1007/11753728_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free