Fuzzy set operations are a generalization of crisp set operations for fuzzy sets. There is in fact more than one possible generalization. The most widely used operations are called standard fuzzy set operations; they comprise: fuzzy complements, fuzzy intersections, and fuzzy unions.
Standard fuzzy set operations
[edit]Let A and B be fuzzy sets that A,B ⊆ U, u is any element (e.g. value) in the U universe: u ∈ U.
Standard complementThe complement is sometimes denoted by ∁A or A∁ instead of ¬A.
Standard intersection Standard unionIn general, the triple (i,u,n) is called De Morgan Triplet iff
- i is a t-norm,
- u is a t-conorm (aka s-norm),
- n is a strong negator,
so that for all x,y ∈ [0, 1] the following holds true:
u(x,y) = n( i( n(x), n(y) ) )(generalized De Morgan relation).[1] This implies the axioms provided below in detail.
Fuzzy complements
[edit]μA(x) is defined as the degree to which x belongs to A. Let ∁A denote a fuzzy complement of A of type c. Then μ∁A(x) is the degree to which x belongs to ∁A, and the degree to which x does not belong to A. (μA(x) is therefore the degree to which x does not belong to ∁A.) Let a complement ∁A be defined by a function
c : [0,1] → [0,1] For all x ∈ U: μ∁A(x) = c(μA(x))Axioms for fuzzy complements
[edit]c is a strong negator (aka fuzzy complement).
A function c satisfying axioms c1 and c3 has at least one fixpoint a* with c(a*) = a*, and if axiom c2 is fulfilled as well there is exactly one such fixpoint. For the standard negator c(x) = 1-x the unique fixpoint is a* = 0.5 .[2]
Fuzzy intersections
[edit]The intersection of two fuzzy sets A and B is specified in general by a binary operation on the unit interval, a function of the form
i:[0,1]×[0,1] → [0,1]. For all x ∈ U: μA ∩ B(x) = i[μA(x), μB(x)].Axioms for fuzzy intersection
[edit]Axioms i1 up to i4 define a t-norm (aka fuzzy intersection). The standard t-norm min is the only idempotent t-norm (that is, i (a1, a1) = a for all a ∈ [0,1]).[2]
Fuzzy unions
[edit]The union of two fuzzy sets A and B is specified in general by a binary operation on the unit interval function of the form
u:[0,1]×[0,1] → [0,1]. For all x ∈ U: μA ∪ B(x) = u[μA(x), μB(x)].Axioms for fuzzy union
[edit]Axioms u1 up to u4 define a t-conorm (aka s-norm or fuzzy union). The standard t-conorm max is the only idempotent t-conorm (i. e. u (a1, a1) = a for all a ∈ [0,1]).[2]
Aggregation operations
[edit]Aggregation operations on fuzzy sets are operations by which several fuzzy sets are combined in a desirable way to produce a single fuzzy set.
Aggregation operation on n fuzzy set (2 ≤ n) is defined by a function
h:[0,1]n → [0,1]Axioms for aggregation operations fuzzy sets
[edit]See also
[edit]Further reading
[edit]- Klir, George J.; Bo Yuan (1995). Fuzzy Sets and Fuzzy Logic: Theory and Applications. Prentice Hall. ISBN 978-0131011717.
References
[edit]- ^ Ismat Beg, Samina Ashraf: Similarity measures for fuzzy sets, at: Applied and Computational Mathematics, March 2009, available on Research Gate since November 23rd, 2016
- ^ a b c Günther Rudolph: Computational Intelligence (PPS), TU Dortmund, Algorithm Engineering LS11, Winter Term 2009/10. Note that this power point sheet may have some problems with special character rendering