Fuzzy subset: Difference between revisions
imported>Giangiacomo Gerla |
imported>Giangiacomo Gerla |
||
Line 13: | Line 13: | ||
== Some set-theoretical notions for fuzzy subsets == | == 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 <math>\vee, \wedge, \neg</math>. In order to define the same operations for fuzzy subsets, we have to fix suitable operations <math> \oplus, \otimes</math> and ~ to interpret these connectives. Once this was done, we can set | In classical mathematics the definitions of union, intersection and complement are related with the interpretation of the basic logical connectives <math>\vee, \wedge, \neg</math>. In order to define the same operations for fuzzy subsets, we have to fix suitable operations <math> \oplus, \otimes</math> and ~ in ''L'' to interpret these connectives. Once this was done, we can set | ||
<math>(s\cup t)(x) = s(x)\oplus t(x)</math>, | <math>(s\cup t)(x) = s(x)\oplus t(x)</math>, | ||
Line 26: | Line 26: | ||
In such a way an algebraic structure <math>([ | In such a way an algebraic structure <math>([L^S, \cup, \cap, -, \emptyset, S)</math> is defined and this structure is the direct power of the structure <math>(L,\oplus, \otimes,</math>~,0,1) with index set ''S''. | ||
In Zadeh's original papers the operations <math> \oplus, \otimes</math>, '''~''' are defined by setting for every ''x'' and ''y'' in [0,1]: | In Zadeh's original papers the operations <math> \oplus, \otimes</math>, '''~''' are defined by setting for every ''x'' and ''y'' in [0,1]: | ||
<math> x\otimes y </math> = min(''x'', ''y'') ; <math> x\oplus y </math> = max(''x'',''y'') ; <math> ~x </math> = 1-''x''. | <math> x\otimes y </math> = min(''x'', ''y'') ; <math> x\oplus y </math> = max(''x'',''y'') ; <math> ~x </math> = 1-''x''. | ||
In such a case <math>([0,1]^F, \cup, \cap, -, \emptyset, S)</math> is a complete, completely distributive lattice with an involution. Several authors prefer to consider different operations, as an example to assume that <math>\otimes</math> is a triangular norm and that <math>\oplus </math> is the corresponding triangular co-norm. | In such a case <math>([0,1]^F, \cup, \cap, -, \emptyset, S)</math> is a complete, completely distributive lattice with an involution. Several authors prefer to consider different operations, as an example to assume that <math>\otimes</math> is a triangular norm in [0,1] and that <math>\oplus </math> is the corresponding triangular co-norm. | ||
In all the cases the interpretation of a logical | 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 caracteristic function is an embedding of the Boolean algebra <math>({0,1}^S, \cup, \cap, -, \emptyset, S)</math> into the algebra <math>(L^S, \cup, \cap, -, \emptyset, S)</math>. | ||
== Truth degree and belief degree: fuzzy logic and probability == | == Truth degree and belief degree: fuzzy logic and probability == |
Revision as of 03:36, 23 October 2008
The notion of fuzzy subset
Fuzzy set theory is an attempt to represent the extension of vague properties. 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 youngh": 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 ? In order to give an aswer to this question recall that the caracteristic function of a classical subset X of S is the map such that if x is an element in X and otherwise. Obviously, it is possible to identify X with its characteristic function . This suggests that we can define the subset of big elements by a generalized caracteristic 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 caracteristic 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 caracteristic 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 siuation 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 strongly from 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
- Formal fuzzy logic
- Fuzzy logic
- Fuzzy control system
- Neuro-fuzzy
- Fuzzy subalgebra
- Fuzzy associative matrix
- FuzzyCLIPS expert system
- Paradox of the heap
- Pattern recognition
- Rough set
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.
- 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
- Bart Kosko, 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) 338353.