We first investigate the issue of obtaining the weights associated with the OWA aggregation in the situation when we have observed data on the arguments and the aggregated value. We next introduce a family of OWA operators called exponential OWA operators. Finally, we look at a simple procedure for
On obtaining minimal variability OWA operator weights
✍ Scribed by Robert Fullér; Péter Majlender
- Book ID
- 104291400
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 232 KB
- Volume
- 136
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
One of the key issues in the theory of ordered-weighted averaging (OWA) operators is the determination of their associated weights. To this end, numerous weighting methods have appeared in the literature, with their main difference occurring in the objective function used to determine the weights. A
The methods for determining OWA operator weights have aroused wide attention. We first review the main existing methods for determining OWA operator weights. We next introduce the principle of maximum entropy for setting up probability distributions on the basis of partial knowledge and prove that X
Conventional fuzzy cognitive maps ~FCMs! can only represent monotonic or symmetric causal relationships and cannot simulate the AND/OR combinations of the antecedent nodes. The rulebased fuzzy cognitive maps ~RBFCMs! usually suffer from the well-known combinatorial rule explosion problem. A hybrid f