Ordered Weighted Averaging Aggregation Operator

In applied mathematics, specifically in fuzzy logic, the ordered weighted averaging (OWA) operators provide a parameterized class of mean type aggregation operators. They were introduced by Ronald R. Yager.Yager, R. R., "On ordered weighted averaging aggregation operators in multi-criteria decision making," IEEE Transactions on Systems, Man, and Cybernetics 18, 183–190, 1988.
Many notable mean operators such as the max, arithmetic average, median and min, are members of this class. They have been widely used in computational intelligence because of their ability to model linguistically expressed aggregation instructions.

Definition

An OWA operator of dimension $\ n$ is a mapping $F: \mathbb^n \rightarrow \mathbb$ that has an associated collection of weights \ W = _1, \ldots, w_n lying in the unit interval and summing to one and with

:$F(a_1, \ldots , a_n) = \sum_^n w_j b_j$

where $b_j$ is the ''j''^th largest of the $a_i$.

By choosing different ''W'' one can implement different aggregation operators. The OWA operator is a non-linear operator as a result of the process of determining the ''b''_''j''.

Notable OWA operators

:$\ F(a_1, \ldots, a_n) = \max(a_1, \ldots, a_n)$ if $\ w_1 = 1$ and $\ w_j = 0$ for $j \ne 1$

:$\ F(a_1, \ldots, a_n) = \min(a_1, \ldots, a_n)$ if $\ w_n = 1$ and $\ w_j = 0$ for $j \ne n$
:
:$\ F(a_1, \ldots, a_n) = \mathrm(a_1, \ldots, a_n)$ if $\ w_j = \frac$ for all $j \in$, n

Properties

The OWA operator is a mean operator. It is bounded, monotonic, symmetric, and idempotent, as defined below.

Characterizing features

Two features have been used to characterize the OWA operators. The first is the attitudinal character, also called ''orness''. This is defined as
:$A-C(W)= \frac \sum_^n (n - j) w_j.$

It is known that $A-C(W) \in$, 1.

In addition ''A'' − ''C''(max) = 1, A − C(ave) = A − C(med) = 0.5 and A − C(min) = 0. Thus the A − C goes from 1 to 0 as we go from Max to Min aggregation. The attitudinal character characterizes the similarity of aggregation to OR operation(OR is defined as the Max).

The second feature is the dispersion. This defined as

:$H(W) = -\sum_^n w_j \ln (w_j).$

An alternative definition is $E(W) = \sum_^n w_j^2 .$ The dispersion characterizes how uniformly the arguments are being used.

Type-1 OWA aggregation operators

The above Yager's OWA operators are used to aggregate the crisp values. Can we aggregate fuzzy sets in the OWA mechanism? The
Type-1 OWA operators have been proposed for this purpose.

So the type-1 OWA operators provides us with a new 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 type-1 OWA operator is defined according to the alpha-cuts of fuzzy sets as follows:

Given the ''n'' linguistic weights $\left\_^n$ in the form of fuzzy sets defined on the domain of discourse U = ,\;\;1/math>, then for each \alpha \in ,\;1/math>, an $\alpha$-level type-1 OWA operator with $\alpha$-level sets $\left\_^n$ to aggregate the $\alpha$-cuts of fuzzy sets $\left\_^n$ is given as

: $\Phi_\alpha \left( \right) =\left\$

where $W_\alpha ^i= \, A_\alpha ^i=\$, and $\sigma :\ \to \$ is a permutation function such that $a_ \ge a_ ,\;\forall \;i = 1, \ldots ,n - 1$, i.e., $a_$ is the $i$th largest
element in the set $\left\$.

The computation of the type-1 OWA output is implemented by computing the left end-points and right end-points of the intervals $\Phi _\alpha \left( \right)$:
$\Phi _\alpha \left( \right)_$ and $\Phi _\alpha \left( \right)_ ,$
where A_\alpha ^i= _^i, A_^i W_\alpha ^i= _^i, W_^i/math>. Then membership function of resulting aggregation fuzzy set is:

:$\mu _ (x) = \mathop \vee _ \alpha$

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

:$\Phi _\alpha \left( \right)_ = \min\limits_ \sum\limits_^n$

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

:$\Phi _\alpha \left( \right)_ = \max\limits_ \sum\limits_^n$

This paper has presented a fast method to solve two programming problem so that the type-1 OWA aggregation operation can be performed efficiently.

OWA for committee voting

Amanatidis, Barrot, Lang, Markakis and Ries present voting rules for multi-issue voting, based on OWA and the Hamming distance. Barrot, Lang and Yokoo study the manipulability of these rules.

References

{{reflist
* Liu, X., "The solution equivalence of minimax disparity and minimum variance problems for OWA operators," International Journal of Approximate Reasoning 45, 68–81, 2007.
* Torra, V. and Narukawa, Y., Modeling Decisions: Information Fusion and Aggregation Operators, Springer: Berlin, 2007.
* Majlender, P., "OWA operators with maximal Rényi entropy," Fuzzy Sets and Systems 155, 340–360, 2005.
* Szekely, G. J. and Buczolich, Z., " When is a weighted average of ordered sample elements a maximum likelihood estimator of the location parameter?" Advances in Applied Mathematics 10, 1989, 439–456.

Logic in computer science
Fuzzy logic
Information retrieval techniques