OPTIMAL FUZZY RULES COVER EXTREMA

被引:50
作者
KOSKO, B
机构
[1] Department of Electrical Engineering, Signal and Image Processing Institute, University of Southern California, Los Angeles, California
关键词
D O I
10.1002/int.4550100206
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A fuzzy system approximates a function by covering the graph of the function with fuzzy rule patches and averaging patches that overlap. But the number of rules grows exponentially with the total number of input and output variables. The best rules cover the extrema or bumps in the function-they patch the bumps. For mean-squared approximation this follows from the mean value theorem of calculus. Optimal rules can help reduce the computational burden. To find them we can find or learn the zeroes of the derivative map and then center input fuzzy sets at these points. Neural systems can then both tune these rules and add rules to improve the function approximation. (C) 1995 John Wiley & Sons, Inc.
引用
收藏
页码:249 / 255
页数:7
相关论文
共 8 条
[1]  
[Anonymous], 1988, ADV ENG MATH
[2]  
DICKERSON JA, 1993, JUL WORLD C NEUR NET, V2, P9
[3]   FUZZY-SYSTEMS AS UNIVERSAL APPROXIMATORS [J].
KOSKO, B .
IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (11) :1329-1333
[4]  
Kosko B., 1991, NEURAL NETWORKS FUZZ
[5]  
KOSKO B, 1992, MAR P IEEE INT C FUZ, P1153
[6]  
Pacini P. J., 1992, Intelligent Systems Engineering, V1, P3, DOI 10.1049/ise.1992.0002
[7]  
Papoulis A., 1984, PROBABILITY RANDOM V
[8]  
RICE JR, 1964, APPROXIMATION FUNCTI