Type-1 OWA operators explained

Type-1 OWA operators are a set of aggregation operators that generalise the Yager's OWA (ordered weighted averaging) operators) in the interest of aggregating fuzzy sets rather than crisp values in soft decision making and data mining.

These operators provide a mathematical 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

\alpha -cuts of fuzzy sets. The two definitions lead to equivalent results.

Definitions

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

\left\{ {W ^{i}} \right\} ^{n} _{i =1} in the form of fuzzy sets defined on the domain of discourse U = [ 0 , 1 ] , a type-1 OWA operator is a mapping, \Phi ,\Phi \colon F(X) x … x F(X) \longrightarrow F(X) (A ^{1} , … ,A ^{n)} \mapsto Y

such that

\mu _{Y} (y) = \displaystyle \sup _{\displaystyle \sum ^{n} _{k =1} \bar {w} _{i} a _{\sigma} = y }\left({\begin{array}{*{ 1 }l}\mu ^{W ^{1}} (w _{1} )\wedge … \wedge \mu _{W ^{n}} (w _{n} )\wedge \mu ^{A ^{1}} (a _{1} )\wedge … \wedge \mu ^{A ^{n}} (a _{n} )\end{array}}\right)

where

\bar {w} _{i} = (w _{i})/(\sum ^{n} _{i =1} {w _{i}) } , and \sigma \colon \{ 1 , … ,n\} \longrightarrow \{ 1 , … ,n\} is a permutation function such that a _{\sigma} \geq a _{\sigma} , \forall i = 1 , … ,n - 1 , i.e., a _{\sigma(i)} is the i th highest element in the set \left\{ {a _{1} , … ,a _{n} } \right\} .

Definition 2

Using the alpha-cuts of fuzzy sets:

Given the n linguistic weights

\left\{ {W ^{i}} \right\} ^{n} _{i =1} in the form of fuzzy sets defined on the domain of discourse U = [ 0 , 1 ] , then for each \alpha \in [ 0 , 1 ] , an \alpha -level type-1 OWA operator with \alpha -level sets \left\{ {W ^{i} _{\alpha} } \right\} ^{n} _{i =1} to aggregate the \alpha -cuts of fuzzy sets \left\{ {A ^{i}} \right\} ^{n} _{i =1} is:\Phi _{\alpha} \left( {A ^{1} _{\alpha} , \ldots ,A ^{n} _{\alpha} } \right) = \left\{ { (\sum\limits ^{n} _{i =1} {w _{i} a _{\sigma})/(}{\sum\limits) ^{n} ^{i =1} {w _{i} } }\left| {w _{i} \in W ^{i} _{\alpha} , a _{i} } \right. \in A ^{i} _{\alpha} , i = 1 , \ldots ,n} \right\}

where

W ^{i =} _{\alpha} \{w| \mu _{W _{i}} (w) \geq \alpha \}, A ^{i = \{} _{\alpha} x| \mu ^{A _{i}} (x)\geq \alpha \} , and \sigma :\{ 1 , … ,n \} \to \{ 1 , … ,n \} is a permutation function such that a _{\sigma} \ge a _{\sigma} , \forall i = 1 , … ,n - 1 , i.e., a _{\sigma} is the i th largest element in the set \left\{ {a _{1} , … ,a _{n} } \right\} .

Representation theorem of Type-1 OWA operators

Given the n linguistic weights

\left\{ {W ^{i}} \right\} ^{n} _{i =1} 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 thatY = 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

\alpha -level type-1 OWA operators. In practice, this series of \alpha -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 \Phi _{\alpha} \left( {A ^{1} _{\alpha} , … ,A ^{n} _{\alpha} } \right) . Then, the resulting aggregation fuzzy set is constructed with the membership function as follows:\mu _{G} (x) = \operatorname{ v ee} \limits _{\alpha :x \in \Phi _{\alpha} \left( {A ^{1} _{\alpha} , … ,A ^{n} _{\alpha}} \right) _{\alpha} } \alpha

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

\Phi _{\alpha} \left( {A ^{1} _{\alpha} , … ,A ^{n} _{\alpha} } \right) _{-} = \operatorname { min }\limits _{\begin{array} {l} W ^{i} _{\alpha -} \le w _{i} \le W ^{i} _{\alpha +} A ^{i} _{\alpha -} \le a _{i} \le A ^{i} _{\alpha +} \end{array}} \sum\limits ^{n} _{i =1} {w _{i} a _{\sigma} / \sum\limits ^{n} _{i =1} {w _{i} } }

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

\Phi _{\alpha} \left( {A ^{1} _{\alpha} , … , A ^{n} _{\alpha} } \right) _{+} = \operatorname { max }\limits _{\begin{array} {l} W ^{i} _{\alpha -} \le w _{i} \le W ^{i} _{\alpha +} A ^{i} _{\alpha -} \le a _{i} \le A ^{i} _{\alpha +} \end{array}} \sum\limits ^{n} _{i =1} {w _{i} a _{\sigma} / \sum\limits ^{n} _{i = 1} {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

\alpha - level resolution in [0, 1].

• Step 2 - For each

\alpha \in [ 0 , 1 ] ,

• Step 2.1 - To calculate

\rho _{\alpha} ^{i ^{\ast} _{0}}

1. Let

i _{0} = 1 ;

1. If

\rho _{\alpha} ^{i _{0}} \ge A ^{\sigma (i _{0} )} _{\alpha +} , stop, \rho _{\alpha} ^{i _{0}} is the solution; otherwise go to Step 2.1-3.i _{0} \leftarrow i _{0} + 1 , go to Step 2.1-2.

• Step 2.2 To calculate

\rho _{\alpha} ^{i ^{\ast} _{0}}

1. Let

i _{0} = 1 ;

1. If

\rho _{\alpha} ^{i _{0}} \ge A ^{\sigma (i _{0} )} _{\alpha -} , stop, \rho _{\alpha} ^{i _{0}} is the solution; otherwise go to Step 2.2-3.i _{0} \leftarrow 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 \left[ {\rho _{\alpha} ^{i ^{\ast} _{0}} , \rho _{\alpha} ^{i ^{\ast} _{0}} } \right] :\mu _{G} (x) = \operatorname v ee \limits _{\alpha :x \in \left[ {\rho _{\alpha} ^{i ^{\ast} _{0}} , \rho _{\alpha} ^{i ^{\ast} _{0}}} \right]} \alpha

Some Examples

• The type-1 OWA operator with the weights shown in the top figure is used to aggregate the fuzzy sets (solide lines) in the bottom figure, and the dashed line is the aggregation result.

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.

Applications

Type-1 OWA operators have been applied to different domains for soft decision making.

• Improved efficiency of computing approach ;
• Type reduction of type-2 fuzzy sets ;
• Group decision making ;
• Credit risk evaluation ;
• Information fusion ;
• Linguistic expressions and symbolic translation ;
• Sentiment analysis ;
• Route selection in uncertain environments ;
• Recommendations on eCommerce .