Finding frequent fuzzy itemsets in operational quantitative databases is a significant challenge for association rule mining the context of data mining. If are detected, decision-making process and formulating strategies businesses will be made more precise. Because characteristic these models large number transactions unlimited high-speed productions. This leads to limitations calculating supp...

Because of the reason that the individuals’ thoughts have the complicated and uncertain characteristics in the field of social science, this study makes the most of the fuzzy sets, which solve uncertain and imprecise conditions, to transform the opinions belonging to human beings into the quantitative numbers. Advertising involvement is regarded as the object for this empirical study which comp...

This paper presents a fuzzy inference guided cellular automata approach. Semantic or linguistic knowledge on urban development is expressed as fuzzy rules, based on which fuzzy inference is applied to determine the urban development potential for each pixel. A defuzzification process converts the development potential to the required neighborhood development level, which is taken by cellular au...

This paper is concerned with the widest class of automaton structures whose semantics is compatible with our notions of state and automaton. It is first shown that the conventional spectrum of deterministic, stochastic, fuzzy and non-deterministic can be fitted into a single framework which is complete. In particular new results on the normalization of fuzzy automata and the relationship betwee...

This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution property (SP) partition for a finite intuitionistic fuzzy automaton is formulated, and the quotient automaton with respect to an SP partition is defined.

Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification” of the local rule of a corresponding Boolean cellular automaton in disjunctive normal form. In this paper we are interested in the relationship between Boolean and fuzzy models and we analytically show, for the first time, the existence of a strong connection between them by foc...

Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellular automaton in disjunctive normal form. In this paper, we are interested in the relationship between Boolean and fuzzy models and, for the first time, we analytically show the existence of a strong connection between them by fo...

We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity can’t be handled by usual searching algorithms. We present sample situations, which would use this kind of searching. Then we define a f...