On training RBF neural networks using input--output fuzzy clustering and particle swarm optimization

  • Authors:
  • George E. Tsekouras;John Tsimikas

  • Affiliations:
  • University of the Aegean, Laboratory of Intelligent Multimedia, Department of Cultural Technology and Communication, Mytilene, Lesvos Island, Greece;University of the Aegean, Department of Statistics and Actuarial-Financial Mathematics, Samos Island, Greece

  • Venue:
  • Fuzzy Sets and Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.20

Visualization

Abstract

This paper elaborates on the use of particle swarm optimization in training Gaussian type radial basis function neural networks under the umbrella of input-output fuzzy clustering. The problem being investigated concerns the selection of basis function centers that contribute most in network's performance, given that the clustering process in the input space is guided by the clustering in the output space. To accomplish this task, we quantify the effect of the input space fuzzy partition upon network's square error in terms of an objective function that describes the ability of the partition to accurately reconstruct the input training samples. We, then, theoretically prove that the minimization of the above function acts to minimize an upper bound of the network's square error. Therefore, the resulting solution corresponds to a minimal square error, while at the same time it maintains the structure of the input data. Due to the peculiarity of the aforementioned objective function, we treat it as the fitness function used by the particle swarm optimizer. The proposed methodology encompasses three design steps. The first step implements an independent fuzzy clustering in the output space to obtain a set of cluster centers. In the second step, unlike other approaches, the above centers are directly involved in the estimation of the membership degrees in the input-output space. In the third step, these membership degrees are used by the particle swarm optimizer in order to obtain optimal values for the centers. To summarize, the novelty of our contribution lies in: (a) the way we handle the information flow from output to input space, and (b) the way we handle the effect of the input space partition upon network's performance. The experiments indicate that the fitness function decreases as the number of hidden node increases. Finally, a comparison between the proposed method and other sophisticated approaches shows its statistically significant superiority.