A Smoothing Algorithm for Training Max-min Neural Networks
نویسندگان
چکیده
In this paper, a smoothing algorithm for training max-min neural networks is proposed. Specifically, we apply a smooth function to approximate functions and use this smoothing technique twice, once to eliminate the inner operator and once to eliminate the operator. In place of actual network output by its approximation function, we use all partial derivatives of the approximation function with respect to weight to substitute those of the actual network output. Then, the smoothing algorithm is constructed by the gradient descent method. This algorithm can also be used to solve fuzzy relational equations. Finally, two numerical examples are provided to show the effectiveness of our smoothing algorithm for training max-min neural networks.
منابع مشابه
Boosting the Performances of the Recurrent Neural Network by the Fuzzy Min-Max
The k-means training algorithm used for the RBF (Radial Basis Function) neural network can have some weakness like empty clusters, the choice of the cluster number and the random choice of the centers of theses clusters. In this paper, we use the Fuzzy Min Max technique to boost the performances of the training algorithm. This technique is used to determine the number of the k centers and to in...
متن کاملClassification of ECG signals using Hermite functions and MLP neural networks
Classification of heart arrhythmia is an important step in developing devices for monitoring the health of individuals. This paper proposes a three module system for classification of electrocardiogram (ECG) beats. These modules are: denoising module, feature extraction module and a classification module. In the first module the stationary wavelet transform (SWF) is used for noise reduction of ...
متن کاملAdaptive resolution min-max classifiers
A high automation degree is one of the most important features of data driven modeling tools and it should be taken into consideration in classification systems design. In this regard, constructive training algorithms are essential to improve the automation degree of a modeling system. Among neuro-fuzzy classifiers, Simpson's (1992) min-max networks have the advantage of being trained in a cons...
متن کاملA smoothing algorithm for finite min-max-min problems
We generalize a smoothing algorithm for finite min–max to finite min– max–min problems. We apply a smoothing technique twice, once to eliminate the inner min operator and once to eliminate the max operator. In mini–max problems, where only the max operator is eliminated, the approximation function is decreasing with respect to the smoothing parameter. Such a property is convenient to establish ...
متن کاملGeneral fuzzy min-max neural network for clustering and classification
This paper describes a general fuzzy min-max (GFMM) neural network which is a generalization and extension of the fuzzy min-max clustering and classification algorithms developed by Simpson. The GFMM method combines the supervised and unsupervised learning within a single training algorithm. The fusion of clustering and classification resulted in an algorithm that can be used as pure clustering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012