Fuzzy subset: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Giangiacomo Gerla
imported>Giangiacomo Gerla
Line 4: Line 4:
== The notion of [[fuzzy set|fuzzy subset]] ==  
== The notion of [[fuzzy set|fuzzy subset]] ==  
Given a well defined property ''P'' and a set ''S'', the axiom of abstraction reads that there exists a set ''B'' whose members are precisely those objects in ''S'' that satisfy ''P''. Such a set is called ''the extension of P''. For example if ''S'' is the set of natural numbers and ''P'' is the property "to be prime", then the set ''B'' of prime numbers is defined. Assume that ''P'' is a vague property as ''"to be big"'', ''"to be young"'': there is a way to define the extension of ''P'' ? For example: is there a precise definition of the notion of ''set of big objects'' ?   
Given a well defined property ''P'' and a set ''S'', the axiom of abstraction reads that there exists a set ''B'' whose members are precisely those objects in ''S'' that satisfy ''P''. Such a set is called ''the extension of P''. For example if ''S'' is the set of natural numbers and ''P'' is the property "to be prime", then the set ''B'' of prime numbers is defined. Assume that ''P'' is a vague property as ''"to be big"'', ''"to be young"'': there is a way to define the extension of ''P'' ? For example: is there a precise definition of the notion of ''set of big objects'' ?   
The definition of ''fuzzy subset'' was proposed in 1965 by Lotfi Zadeh as an attempt to give an answer to such a question.  At the same time, the same definition was proposed by Dieter Klaua in the framework of multi-valued logic. Now recall that the ''[[characteristic function]]'' of a classical subset ''X'' of ''S'' is the map <math> c_X : S\rightarrow \{0,1\} </math> such that <math> c_X(x) = 1 </math> if ''x'' is an element in ''X'' and <math>c_X(x) =0 </math> otherwise. Obviously, it is possible to identify ''X'' with its characteristic function <math>c_X</math>. This suggests that we can define the subset of big elements by a generalized characteristic function in which instead of the Boolean algebra {0,1} we can consider, for example, a bounded [[lattice (order)|lattice]] ''L''. The following is a precise definition.
The definition of ''fuzzy subset'' was proposed in 1965 by Lotfi Zadeh as an attempt to give an answer to such a question.  At the same time, the same definition was proposed by Dieter Klaua in the framework of multi-valued logic. Now recall that the ''[[characteristic function]]'' of a classical subset ''X'' of ''S'' is the map ''c''<sub>X</sub> : {0,1} such that ''c<sub>X</sub>''(''x'') = 1 if ''x'' is an element in ''X'' and ''c<sub>X</sub>''(''x'') =0 otherwise. Obviously, it is possible to identify every subset ''X'' with its characteristic function ''c<sub>X</sub>'' and therefore the extension of a property with a suitable characteristic function. This suggests that we can define the subset of big elements by a generalized characteristic function in which instead of the Boolean algebra {0,1} we can consider, for example, a bounded [[lattice (order)|lattice]] ''L''. The following is a precise definition.





Revision as of 22:14, 1 January 2009

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

Template:TOC-right

The notion of fuzzy subset

Given a well defined property P and a set S, the axiom of abstraction reads that there exists a set B whose members are precisely those objects in S that satisfy P. Such a set is called the extension of P. For example if S is the set of natural numbers and P is the property "to be prime", then the set B of prime numbers is defined. Assume that P is a vague property as "to be big", "to be young": there is a way to define the extension of P ? For example: is there a precise definition of the notion of set of big objects ? The definition of fuzzy subset was proposed in 1965 by Lotfi Zadeh as an attempt to give an answer to such a question. At the same time, the same definition was proposed by Dieter Klaua in the framework of multi-valued logic. Now recall that the characteristic function of a classical subset X of S is the map cX : → {0,1} such that cX(x) = 1 if x is an element in X and cX(x) =0 otherwise. Obviously, it is possible to identify every subset X with its characteristic function cX and therefore the extension of a property with a suitable characteristic function. This suggests that we can define the subset of big elements by a generalized characteristic function in which instead of the Boolean algebra {0,1} we can consider, for example, a bounded lattice L. The following is a precise definition.


Definition. Let L be a bounded lattice. Then, given a nonempty set S, an L-subset of fuzzy subset of S is a map s from S into L. We denote by LS the class of all the fuzzy subsets of S. If S1,...Sn are nonempty sets then a fuzzy subset of S1 Sn is called an n-ary L-relation.

The elements in L are interpreted as truth values and, in accordance, for every x in S, the value s(x) is interpreted as the membership degree of x to s. Usually, one considers the lattice [0,1]. We say that a fuzzy subset s is crisp if for every . By associating every classical subsets of S with its characteristic function, we can identify the subsets of S with the crisp fuzzy subsets. In particular we identify with the fuzzy subset constantly equal to 0 and with the fuzzy subset constantly equal to 1.

Some set-theoretical notions for fuzzy subsets

In classical mathematics the definitions of union, intersection and complement are related with the interpretation of the basic logical connectives . In order to define the same operations for fuzzy subsets, we have to fix suitable operations and ~ in L to interpret these connectives. Once this was done, we can set

,

,

.

Also, the inclusion relation is defined by setting

for every .


In such a way an algebraic structure is defined and this structure is the direct power of the structure ~,0,1) with index set S. In Zadeh's original papers the operations , ~ are defined by setting for every x and y in [0,1]:

= min(x, y) ; = max(x,y) ; = 1-x.

In such a case is a complete, completely distributive lattice with an involution. Several authors prefer to consider different operations, as an example to assume that is a triangular norm in [0,1] and that is the corresponding triangular co-norm.

In all the cases the interpretation of a logical connective is conservative in the sense that its restriction to {0,1} coincides with the classical one. This entails that the map associating any subset X of a set S with the related characteristic function is an embedding of the Boolean algebra into the algebra .

Truth degree and belief degree: fuzzy logic and probability

Many peoples compare fuzzy logic with probability theory since both refer to the interval [0,1]. However, they are conceptually distinct since we have not confuse a degree of truth with a probability measure. To illustrate the difference, consider the following example: Let be the claim "the rose on the table is red" and imagine we can freely examine such a rose (complete information) but, as a matter of fact, the color looks not exactly red. Then is neither fully true nor fully false and we can express that by assigning to a truth degree, as an example 0.8, different from 0 and 1 (fuzziness). This truth degree does not depend on the information we have since it is assigned in a situation of complete information. Now, imagine a world in which all the roses are either clearly red or clearly yellow. In such a world is either true or false but, inasmuch as we cannot examine the rose on the table, we are not able to know what is the case. Nevertheless, we have an opinion about the possible color of that rose and we could assign to a number, as an example 0.8, as a subjective measure of our degree of belief in (probability). In such a case this number depends on the information we have and, for example, it can vary if we have some new information on the taste of the possessor of the rose.

See also

Bibliography

  • Cox E., The Fuzzy Systems Handbook (1994), ISBN 0-12-194270-8
  • Elkan C.. The Paradoxical Success of Fuzzy Logic. November 1993. Available from Elkan's home page.
  • Gerla G., Fuzzy logic: Mathematical Tools for Approximate Reasoning, Kluwer, 2001.
  • Gottwald S., A treatase on Multi-Valued Logics, Research Studies Press LTD, Baldock 2001.
  • Hájek P., Metamathematics of fuzzy logic. Kluwer 1998.
  • Höppner F., Klawonn F., Kruse R. and Runkler T., Fuzzy Cluster Analysis (1999), ISBN 0-471-98864-2.
  • Klaua D., Über einen Ansatz zur mehrwertigen Mengenlehre, Monatsberichte der Deutschen Akademie der Wissenschaften Berlin, vol 7 (1965), pp 859-867.
  • Klir G. and Folger T., Fuzzy Sets, Uncertainty, and Information (1988), ISBN 0-13-345984-5.
  • Klir G. , UTE H. St. Clair and Bo Yuan Fuzzy Set Theory Foundations and Applications,1997.
  • Klir G. and Bo Yuan, Fuzzy Sets and Fuzzy Logic (1995) ISBN 0-13-101171-5
  • Kosko B., Fuzzy Thinking: The New Science of Fuzzy Logic (1993), Hyperion. ISBN 0-7868-8021-X
  • Novák V., Perfilieva I, Mockor J., Mathematical Principles of Fuzzy Logic, Kluwer Academic Publishers, Dordrecht, (1999).
  • Yager R. and Filev D., Essentials of Fuzzy Modeling and Control (1994), ISBN 0-471-01761-2
  • Zimmermann H., Fuzzy Set Theory and its Applications (2001), ISBN 0-7923-7435-5.
  • Zadeh L.A., Fuzzy Sets, Information and Control, 8 (1965) 338­-353.