๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Least-squared ordered weighted averaging operator weights

โœ Scribed by Byeong Seok Ahn; Haechurl Park


Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
161 KB
Volume
23
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

โœฆ Synopsis


The ordered weighted averaging (OWA) operator by Yager (IEEE Trans Syst Man Cybern 1988; 18; 183-190) has received much more attention since its appearance. One key point in the OWA operator is to determine its associated weights. Among numerous methods that have appeared in the literature, we notice the maximum entropy OWA (MEOWA) weights that are determined by taking into account two appealing measures characterizing the OWA weights. Instead of maximizing the entropy in the formulation for determining the MEOWA weights, a new method in the paper tries to obtain the OWA weights that are evenly spread out around equal weights as much as possible while strictly satisfying the orness value provided in the program. This consideration leads to the least-squared OWA (LSOWA) weighting method in which the program is to obtain the weights that minimize the sum of deviations from the equal weights since entropy is maximized when all the weights are equal. Above all, the LSOWA method allocates the positive and negative portions to the equal weights that are identical but opposite in sign from the middle point in the number of criteria. Furthermore, interval LSOWA weights can be constructed when a decision maker specifies his or her orness value in uncertain numerical bounds and we present a method, with those uncertain interval LSOWA weights, for prioritizing alternatives that are evaluated by multiple criteria.


๐Ÿ“œ SIMILAR VOLUMES


The ordered weighted geometric averaging
โœ Z. S. Xu; Q. L. Da ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 75 KB

The ordered weighted averaging (OWA) operator was introduced by Yager. 1 The fundamental aspect of the OWA operator is a reordering step in which the input arguments are rearranged in descending order. In this article, we propose two new classes of aggregation operators called ordered weighted geome

Density-induced ordered weighted averagi
โœ Feng-Mei Ma; Ya-Jun Guo ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 472 KB

We provide a special type of induced ordered weighted averaging (OWA) operator called densityinduced OWA (DIOWA) operator, which takes the density around the arguments as the inducing variables to reorder the arguments. The density around the argument, which can measure the degree of similarity betw

Ranking of alternatives with ordered wei
โœ M. Teresa Lamata ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 92 KB

Multiattribute decision making is an important part of the decision process for both individual and group problems. We incorporate the fuzzy set theory and the basic nature of subjectivity due to ambiguity to achieve a flexible decision approach suitable for uncertain and fuzzy environments. Let us

Majority additiveโ€“ordered weighting aver
โœ J. I. Pelรกez; J. M. Doรฑa ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB

A problem that we had encountered in the aggregation process is how to aggregate the elements that have cardinality greater than one. The most common operators used in the aggregation process produce reasonable results, but, at the same time, when the items to aggregate have cardinality greater than

Multiple priorities in an induced ordere
โœ H. B. Mitchell; P. A. Schaefer ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 91 KB ๐Ÿ‘ 1 views

The ordered weighted averaging OWA operator of Yager was introduced to provide a method for nonlinearly aggregating a set of input arguments a . A fundamental aspect of i the OWA operator is a reordering step in which the input arguments are rearranged according to their values. Recently, an induced

Solution of large-scale weighted least-s
โœ Venansius Baryamureeba ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 467 KB

## Abstract A sequence of leastโ€squares problems of the form min~__y__~โˆฅ__G__^1/2^(__A__^T^ __y__โˆ’__h__)โˆฅ~2~, where __G__ is an __n__ร—__n__ positiveโ€definite diagonal weight matrix, and __A__ an __m__ร—__n__ (__m__โฉฝ__n__) sparse matrix with some dense columns; has many applications in linear program