Fuzzy set operations


Fuzzy set operations
A fuzzy set operation is an operation on fuzzy sets. These operations are generalization of crisp set operations. There is more than one possible generalization. The most widely used operations are called standard fuzzy set operations. There are three operations: fuzzy complements, fuzzy intersections, and fuzzy unions.

Standard fuzzy set operations
Standard complement cA(x) = 1 − A(x) Standard intersection (A ∩ B)(x) = min [A(x), B(x)] Standard union (A ∪ B)(x) = max [A(x), B(x)]

Fuzzy complements
A(x) is defined as the degree to which x belongs to A. Let cA denote a fuzzy complement of A of type c. Then cA(x) is the degree to which x belongs to cA, and the degree to which x does not belong to A. (A(x) is therefore the degree to which x does not belong to cA.) Let a complement cA be defined by a function c : [0,1] → [0,1] c(A(x)) = cA(x)

Axioms for fuzzy complements
Axiom c1. Boundary condition c(0) = 1 and c(1) = 0 Axiom c2. Monotonicity For all a, b ∈ [0, 1], if a < b, then c(a) ≥ c(b) Axiom c3. Continuity c is continuous function. Axiom c4. Involutions c is an involution, which means that c(c(a)) = a for each a ∈ [0,1]

Fuzzy intersections
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]. (A ∩ B)(x) = i[A(x), B(x)] for all x.

Axioms for fuzzy intersection
Axiom i1. Boundary condition i(a, 1) = a Axiom i2. Monotonicity

b). Superidempotency u(a. u(b. (A ∪ B)(x) = u[A(x). b) = i(b. Monotonicity b ≤ d implies u(a. b). a) Axiom u4. Continuity u is a continuous function Axiom u6. Associativity u(a.Fuzzy set operations b ≤ d implies i(a. Continuity i is a continuous function Axiom i6. d) Axiom i3. B(x)] for all x Axioms for fuzzy union Axiom u1. 0) =u(0 .1]×[0. Associativity i(a. b) ≤ i(a. d) Axiom i5. d) Axiom u3.a) = a Axiom u2. a) ≤ a 2 Fuzzy unions 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. Commutativity i(a. a) Axiom i4.1]. b) ≤ u(a. b) = u(b. d) Axiom u5. Strict monotonicity a1 < a2 and b1 < b2 implies u(a1. Subidempotency i(a. d)) = i(i(a. d)) = u(u(a. i(b.1] → [0. Boundary condition u(a. a) ≥ a Axiom u7. Commutativity u(a. b1) < u(a2. b2) .

a2.Fuzzy set operations 3 Aggregation operations Aggregation operations on fuzzy sets are operations by which several fuzzy sets are combined in a desirable way to produce a single fuzzy set. if ai ≤ bi for all i ∈ Nn.. pdf . .. an> and <b1.. 1965 [1] References [1] http:/ / www-bisc. bi ∈ [0. Boundary condition h(0. 1) = 1 Axiom h2. 8:338–353. a2.. then h(a1.... .an) ≤ h(b1. ... External References • L. bn). 0.1]n → [0. cs.. Axiom h3. berkeley.. b2.. . Continuity h is a continuous function. h is monotonic increasing in all its arguments.A.. Zadeh... b2. 1. .. edu/ Zadeh-1965. Monotonicity For any pair <a1.. 0) = 0 and h(1.1] for all i ∈ Nn. Information and Control. . bn> of n-tuples such that ai. Fuzzy sets.1] Axioms for aggregation operations fuzzy sets Axiom h1.. that is. Aggregation operation on n fuzzy set (2 ≤ n) is defined by a function h:[0.

Tanber. Pepsidrinka.wikipedia. Gregbard.Article Sources and Contributors 4 Article Sources and Contributors Fuzzy set operations  Source: http://en.org/licenses/by-sa/3. LBehounek. Woohookitty.php?oldid=458128796  Contributors: Beetstra. Charles Matthews. 22 anonymous edits License Creative Commons Attribution-Share Alike 3. GrayFullbuster. Drwu82. Mailer diablo. Michael Hardy.0 Unported //creativecommons. Predictor. Pearle. Jon Awbrey.org/w/index. Konerak.0/ . Quietly. R'n'B.