.png){kind=icon}
.png){kind=icon}
Return
Stochastically ordered aggregation operators
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2023.109110.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In aggregation theory, there exists a large number of aggregation functions that are defined in terms of rearrangements in increasing order of the arguments. Prominent examples are the Ordered Weighted Operator and the Choquet and Sugeno integrals. Following a probability approach, ordering random variables by means of stochastic orders can be also a way to define aggregations of random variables. However, stochastic orders are not total orders, thus pairs of incomparable distributions can appear. This paper is focused on the definition of aggregations of random variables that take into account the stochastic ordination of the components of the input random vectors. Three alternatives are presented, the first one by using expected values and admissible permutations, then a modification for multivariate Gaussian random vectors and a third one that involves a transformation of the initial random vectors in new ones whose components are ordered with respect to the usual stochastic order. A deep theoretical study of the properties of all the proposals is made. A practical example regarding temperature prediction is provided
Keywords:
Aggregation operators
Stochastic orders
Aggregation of random variables
Copulas
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
2.9K
Citations:
5.1K