Self‐tuning of fuzzy rules when learning data have a radically changing distribution

Abstract

AbstractIn this paper, we propose a new type of membership functions (MSFs) and their efficient use to improve optimization of fuzzy reasoning using a steepest descent method. In self‐tuning of fuzzy rules using the steepest descent method, an algorithm to avoid suboptimal solutions by modifying learning coefficients has been proposed, where piecewise linear MSFs were introduced. In such an algorithm, when learning data have a radically changing distribution, it is impossible to avoid suboptimal solutions.To overcome this problem, we propose to apply double right triangular MSFs to the self‐tuning of fuzzy reasoning. By using these MSFs, radically changing grades can be represented easily. In addition, by a technique of simulated annealing (SA) we propose to move the peak positions of the MSFs according to the progress of learning so as to arrange the MSFs in certain positions where the learning data are changing radically. Compared with the algorithm using piecewise linear MSFs, this new algorithm makes it possible to avoid suboptimal solutions more effectively. The advantages of this new technique are demonstrated by numerical examples involving function approximations. © 2003 Wiley Periodicals, Inc. Electr Eng Jpn, 144(4): 63–74, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/eej.10168