The Rand index is a measure commonly used to compare crisp partitions. Campello (2007) and Hüllermeier and Rifqi (2009) respectively, proposed two extensions of this index capable to compare fuzzy partitions. These approaches are useful when continuous values of attributes are discretized using fuzzy sets. In previous works we experimented with these extensions and compared their accuracy with ...

In this paper, the extension principle is used in order to fuzzify location and scale estimators when used on fuzzy numbers. First, fuzzy nonlinear means, such as arithmetic, harmonic, geometric and fuzzy L p mean are deened as extensions of the corresponding crisp means. Fuzzy maximum and minimum operators are used to deene order statistics of fuzzy numbers. Fuzzy L location and scale estimato...

Using neural network we try to model the unknown function f for given input-output data pairs. The connection strength of each neuron is updated through learning. Repeated simulations of crisp neural network produce different values of weight factors that are directly affected by the change of different parameters. We propose the idea that for each neuron in the network, we can obtain quasi-fuz...

In previous studies we first concentrated on utilizing crisp simulationto produce discrete event fuzzy systems simulations. Then we extendedthis research to the simulation of continuous fuzzy systems models. In this paperwe continue our study of continuous fuzzy systems using crisp continuoussimulation. Consider a crisp continuous system whose evolution depends ondifferential equations. Such a ...

in this paper the solution of a second order linear dierential equations with intu-itionistic fuzzy boundary value is described. it is discussed for two dierent cases: coecientis positive crisp number and coecient is negative crisp number. here fuzzy numbers aretaken as generalized trapezoidal intutionistic fuzzy numbers (gtrifns). further a numericalexample is illustrated.

Classical automata theory can not deal with uncertainty. To deal with uncertainty in system modeling, fuzzy automata come into the existence. Fuzzy automaton depends on membership value. For finding the membership degree of strings in fuzzy automata, the concept of max – min automaton and min – max automaton can be used. Many researchers have used the concept of max – min automaton for finding ...

a real-time optimization (rto) strategy incorporating the fuzzy sets theory is developed, where the problem constraints obtained from process considerations are treated in fuzzy environment. furthermore, the objective function is penalized by a fuzzified form of the key process constraints. to enable using conventional optimization techniques, the resulting fuzzy optimization problem is then re...

Abstract An E -fuzzy group is a lattice-valued algebraic structure, defined on a crisp algebra which is not necessarily a group. The crisp equality is replaced by a particular fuzzy one denoted by E . Classical group-like properties are formulated as appropriate fuzzy identities special lattice theoretic formulas. We prove basic features of E -fuzzy groups: properties of the unit and inverses, ...

we present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. first, we introduce a hyper bck-algebra induced by a max-min general fuzzy automaton. then, we study the properties of this hyper bck-algebra. particularly, some theorems and results for hyper bck-algebra are proved. for example, it is shown that this structure consists of different ty...

Finite state automata are crucial for numerous practical algorithms of computer science. We show how to use genetic algorithms and fuzzy automata to simplify a class of FSA defined by labeled graphs and considered in the literature. Finite state automata, FSA, are well-known tools used in coding theory, text processing, image analysis and compression, speech recognition, and bioinformatics. Lab...