The problem of aggregating multiple criteria to form an overall measure is of considerable importance in many disciplines. The ordered weighted averaging (OWA) aggregation, introduced by Yager, uses weights assigned to the ordered values rather than to the specific criteria. This allows one to model various aggregated preferences, preserving simultaneously the impartiality (neutrality) with res...

This paper is devoted to the determination of wellbalanced solutions in search problems involving multiple cost functions. After indicating various contexts in which the ordered weighted averaging operator (with decreasing weights) is natural to express the preferences between solutions, we propose a search algorithm to determine the OWA-optimal solution. More precisely, we show how to embed th...

The type-1 ordered weighted averaging (T1OWA) operator has demonstrated the capacity for directly aggregating multiple sources of linguistic information modeled by fuzzy sets rather than crisp values. Yager's (OWA) operators possess properties idempotence, monotonicity, compensativeness, and commutativity. This article aims to address whether or not T1OWA these when inputs associated weights ar...

In this paper a class of single machine scheduling problems is discussed. It is assumed that job parameters, such as processing times, due dates, or weights are uncertain and their values are specified in the form of a discrete scenario set. The Ordered Weighted Averaging (OWA) aggregation operator is used to choose an optimal schedule. The OWA operator generalizes traditional criteria in decis...

Ranking decision making units (DMUs) is one of the most important applications of data envelopment analysis (DEA). In this paper, we exploit the power of individual appreciativeness in developing a methodology that combines crossevaluation, preference voting and ordered weighted averaging (OWA). We show that each stage of the proposed methodology enhances discrimination among DMUs while offerin...

We utilize the dynamical renormalization group formalism to calculate the real space trajectory of a compact binary inspiral for long times via a systematic resummation of secularly growing terms. This method generates closed form solutions without orbit averaging, and the accuracy can be systematically improved. The expansion parameter is v5νΩðt − t0Þ where t0 is the initial time, t is the tim...

In this paper, we discuss a framework for weighted combination of classifiers for word sense disambiguation (WSD). This framework is essentially based on DempsterShafer theory of evidence (Dempster, 1967; Shafer, 1976) and ordered weighted averaging (OWA) operators (Yager, 1988). We first determine various kinds of features which could provide complementarily linguistic information for the cont...

We study a stochastic model of influence where agents have “yes” or “no” inclinations on some issue, and opinions may change due to mutual influence among the agents. Each agent independently aggregates the opinions of the other agents and possibly herself. We study influence processes modelled by ordered weighted averaging operators, which are anonymous: they only depend on how many agents sha...

Ordered Weighted Averaging (OWA) operators have been integrated in Convolutional Neural Networks (CNNs) for image classification through the OWA layer. This layer lets CNN integrate global information about early stages, where most architectures only allow exploitation of local information. As a side effect this integration, becomes practical method determination operator weights, which is usua...