In applied mathematics – specifically in fuzzy logic – the ordered weighted averaging operators provide a parameterized class of mean type aggregation operators. They were introduced by Ronald R. Yager. 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
Formally an OWA operator of dimension is a mapping that has an associated collection of weights lying inthe unit interval and summing to one and with where is the jth largest of the. 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 bj.
Two features have been used to characterize the OWA operators. The first is the attitudinal character. This is defined as It is known that. In addition A − C = 1, A − C = A − C = 0.5 and A − C = 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. The second feature is the dispersion. This defined as An alternative definition is 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 in the form of fuzzy sets defined on the domain of discourse, then for each, an -level type-1 OWA operator with -level sets to aggregate the -cuts of fuzzy sets is given as where, and is a permutation function such that, i.e., is the th largest element in the set. The computation of the type-1 OWA output is implemented by computing the left end-points and right end-points of the intervals : and where. Then membership function of resulting aggregation fuzzy set is: For the left end-points, we need tosolve the following programming problem: while for the right end-points, we need to solve the following programming problem: has presented a fast method to solve two programming problem so that the type-1 OWA aggregation operation can be performed efficiently.
