TY - JOUR
T1 - GA-based learning of BMF fuzzy-neural network
AU - Wang, Wei Yen
AU - Lee, Tsu Tian
AU - Hsu, Chen Chian
AU - Li, Yi Hsum
PY - 2002
Y1 - 2002
N2 - In this paper, a novel approach to adjust both control points of B-spline membership functions (BMFs) and weightings of fuzzy-neural networks using a simplified genetic algorithm (SGA) is proposed. Fuzzy-neural networks are traditionally trained by using gradient-based methods, and may fall into local minimum during the learning process. Genetic algorithms have drawn significant attentions in various fields due to their capabilities of directed random search for global optimization. This motivates the use of the genetic algorithms to overcome the problem encountered by the conventional learning methods. However, it is well known that searching speed of the conventional genetic algorithms is not desirable. Thus far, such conventional genetic algorithms are inherently disadvantaged in dealing with a vast amount (over 100) of adjustable parameters in the fuzzy-neural networks. In this paper, the SGA is proposed by using a sequential- search-based crossover point (SSCP) method in which a better crossover point is determined and only the gene at the specified crossover point is crossed as a single point crossover operation. Chromosomes consisting of both the control points of BMF's and the weightings of fuzzy-neural networks are coded as an adjustable vector with real number components and searched by the SGA. Because of the use of the SGA, faster convergence of the evolution process to search for an optimal fuzzy-neural network can be achieved. Nonlinear functions approximated by using the fuzzy-neural networks via the SGA are demonstrated in this paper to illustrate the applicability of the proposed method.
AB - In this paper, a novel approach to adjust both control points of B-spline membership functions (BMFs) and weightings of fuzzy-neural networks using a simplified genetic algorithm (SGA) is proposed. Fuzzy-neural networks are traditionally trained by using gradient-based methods, and may fall into local minimum during the learning process. Genetic algorithms have drawn significant attentions in various fields due to their capabilities of directed random search for global optimization. This motivates the use of the genetic algorithms to overcome the problem encountered by the conventional learning methods. However, it is well known that searching speed of the conventional genetic algorithms is not desirable. Thus far, such conventional genetic algorithms are inherently disadvantaged in dealing with a vast amount (over 100) of adjustable parameters in the fuzzy-neural networks. In this paper, the SGA is proposed by using a sequential- search-based crossover point (SSCP) method in which a better crossover point is determined and only the gene at the specified crossover point is crossed as a single point crossover operation. Chromosomes consisting of both the control points of BMF's and the weightings of fuzzy-neural networks are coded as an adjustable vector with real number components and searched by the SGA. Because of the use of the SGA, faster convergence of the evolution process to search for an optimal fuzzy-neural network can be achieved. Nonlinear functions approximated by using the fuzzy-neural networks via the SGA are demonstrated in this paper to illustrate the applicability of the proposed method.
KW - B-spline membership function
KW - Fuzzy neural network
KW - Simplified genetic algorithm
UR - http://www.scopus.com/inward/record.url?scp=0036456053&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036456053&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:0036456053
SN - 1098-7584
VL - 2
SP - 1234
EP - 1239
JO - IEEE International Conference on Fuzzy Systems
JF - IEEE International Conference on Fuzzy Systems
T2 - 2002 IEEE International Conference on Fuzzy Systems: FUZZ-IEEE'02
Y2 - 12 May 2002 through 17 May 2002
ER -