Puneet Varma (Editor)

Type 1 OWA operators

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

The Yager's OWA (ordered weighted averaging) operators are used to aggregate the crisp values in decision making schemes (such as multi-criteria decision making, multi-expert decision making and multi-criteria/multi-expert decision making). It is widely accepted that Fuzzy sets are more suitable for representing preferences of criteria in decision making.

Contents

The type-1 OWA operators have been proposed for this purpose. The type-1 OWA operators provides a technique for directly aggregating uncertain information with uncertain weights via OWA mechanism in soft decision making and data mining, where these uncertain objects are modelled by fuzzy sets.

The two definitions for type-1 OWA operators are based on Zadeh's Extension Principle and α -cuts of fuzzy sets. The two definitions lead to equivalent results.

Definition 1

Let F ( X ) be the set of fuzzy sets with domain of discourse X , a type-1 OWA operator is defined as follows:

Given n linguistic weights { W i } i = 1 n in the form of fuzzy sets defined on the domain of discourse U = [ 0 , 1 ] , a type-1 OWA operator is a mapping, Φ ,

Φ : F ( X ) × ⋯ × F ( X ) ⟶ F ( X ) ( A 1 , ⋯ , A n ) ↦ Y

such that

μ Y ( y ) = sup ∑ k = 1 n w ¯ i a σ ( i ) = y ( μ W 1 ( w 1 ) ∧ ⋯ ∧ μ W n ( w n ) ∧ μ A 1 ( a 1 ) ∧ ⋯ ∧ μ A n ( a n ) )

where w ¯ i = w i ∑ i = 1 n w i ,and σ : { 1 , ⋯ , n } ⟶ { 1 , ⋯ , n } is a permutation function such that a σ ( i ) ≥ a σ ( i + 1 ) ,   ∀ i = 1 , ⋯ , n − 1 , i.e., a σ ( i ) is the i th highest element in the set { a 1 , ⋯ , a n } .

Definition 2

Using the alpha-cuts of fuzzy sets:

Given the n linguistic weights { W i } i = 1 n in the form of fuzzy sets defined on the domain of discourse U = [ 0 , 1 ] , then for each α ∈ [ 0 , 1 ] , an α -level type-1 OWA operator with α -level sets { W α i } i = 1 n to aggregate the α -cuts of fuzzy sets { A i } i = 1 n is:

Φ α ( A α 1 , … , A α n ) = { ∑ i = 1 n w i a σ ( i ) ∑ i = 1 n w i | w i ∈ W α i , a i ∈ A α i , i = 1 , … , n }

where W α i = { w | μ W i ( w ) ≥ α } , A α i = { x | μ A i ( x ) ≥ α } , and σ : { 1 , ⋯ , n } → { 1 , ⋯ , n } is a permutation function such that a σ ( i ) ≥ a σ ( i + 1 ) , ∀ i = 1 , ⋯ , n − 1 , i.e., a σ ( i ) is the i th largest element in the set { a 1 , ⋯ , a n } .

Representation theorem of Type-1 OWA operators

Given the n linguistic weights { W i } i = 1 n in the form of fuzzy sets defined on the domain of discourse U = [ 0 , 1 ] , and the fuzzy sets A 1 , ⋯ , A n , then we have that

Y = G

where Y is the aggregation result obtained by Definition 1, and G is the result obtained by in Definition 2.

Programming problems for Type-1 OWA operators

According to the Representation Theorem of Type-1 OWA Operators, a general type-1 OWA operator can be decomposed into a series of α -level type-1 OWA operators. In practice, this series of α -level type-1 OWA operators is used to construct the resulting aggregation fuzzy set. So we only need to compute the left end-points and right end-points of the intervals Φ α ( A α 1 , ⋯ , A α n ) . Then, the resulting aggregation fuzzy set is constructed with the membership function as follows:

μ G ( x ) = ⋁ α : x ∈ Φ α ( A α 1 , ⋯ , A α n ) α ⁡ α

For the left end-points, we need to solve the following programming problem:

Φ α ( A α 1 , ⋯ , A α n ) − = min W α − i ≤ w i ≤ W α + i A α − i ≤ a i ≤ A α + i ⁡ ∑ i = 1 n w i a σ ( i ) / ∑ i = 1 n w i

while for the right end-points, we need to solve the following programming problem:

Φ α ( A α 1 , ⋯ , A α n ) + = max W α − i ≤ w i ≤ W α + i A α − i ≤ a i ≤ A α + i ⁡ ∑ i = 1 n w i a σ ( i ) / ∑ i = 1 n w i

A fast method has been presented to solve two programming problem so that the type-1 OWA aggregation operation can be performed efficiently, for details, please see the paper.

Alpha-level approach to Type-1 OWA operation

Three-step process:

  • Step 1—To set up the α - level resolution in [0, 1].
  • Step 2—For each α ∈ [ 0 , 1 ] ,
  • Step 2.1—To calculate ρ α + i 0 ∗
    1. Let i 0 = 1 ;
    2. If ρ α + i 0 ≥ A α + σ ( i 0 ) , stop, ρ α + i 0 is the solution; otherwise go to Step 2.1-3.
    3. i 0 ← i 0 + 1 , go to Step 2.1-2.
  • Step 2.2 To calculate ρ α − i 0 ∗
    1. Let i 0 = 1 ;
    2. If ρ α − i 0 ≥ A α − σ ( i 0 ) , stop, ρ α − i 0 is the solution; otherwise go to Step 2.2-3.
    3. i 0 ← i 0 + 1 , go to step Step 2.2-2.
  • Step 3—To construct the aggregation resulting fuzzy set G based on all the available intervals [ ρ α − i 0 ∗ , ρ α + i 0 ∗ ] :
    • μ G ( x ) = ⋁ α : x ∈ [ ρ α − i 0 ∗ , ρ α + i 0 ∗ ] ⁡ α

    Special cases

  • Any OWA operators, like maximum, minimum, mean operators;
  • Join operators of (type-1) fuzzy sets, i.e., fuzzy maximum operators;
  • Meet operators of (type-1) fuzzy sets, i.e., fuzzy minimum operators;
  • Join-like operators of (type-1) fuzzy sets;
  • Meet-like operators of (type-1) fuzzy sets.

    • Generalizations

    Type-2 OWA operators have been suggested to aggregate the type-2 fuzzy sets for soft decision making.

    References

    Type-1 OWA operators Wikipedia
    (Text) CC BY-SA