In this paper two agglomerative learning algorithms based on new similarity measures defined for hyperbox fuzzy sets are proposed. They are presented in a context of clustering and classification problems tackled using a general fuzzy min-max (GFMM) neural network. The proposed agglomerative schemes have shown robust behaviour in presence of noise and outliers and insensitivity to the order of ...

The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along wi...

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...

A hybrid approach based on Fuzzy Logic and neural networks with the combination of the classic Hu & Zernike moments joined with Geodesic descriptors is used to keep the maximum amount of information that are given by the color of the image. These moments are calculated for each color level and geodesic descriptors are applied directly to binary images to get information about the general shape ...

In this paper, we report the results of Marathi (Language spoken in the state of Maharashtra, India) spoken digit recognition using General Fuzzy Min-Max Neural Network (GFMM NN)[1] and Modified General Fuzzy MinMax Neural Network (MGFMM NN), which is obtained by modifying the transfer function of output layer of GFMM NN.

Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...

We introduce a new class of automata on infinite words, called min-automata. We prove that min-automata have the same expressive power as weak monadic second-order logic (weak MSO) extended with a new quantifier, the recurrence quantifier. These results are dual to a framework presented in [2], where max-automata were proved equivalent to weak MSO extended with an unbounding quantifier. We also...