RT Journal Article
T1 Computable aggregations of random variables
A1 Baz, Juan
A1 Díaz, Irene
A1 Garmendia Salvador, Luis
A1 Gómez González, Daniel
A1 Magdalena, Luis
A1 Montes, Susana
A2 Pedrycz, Witold
AB Aggregation theory is devoted to the fusing of several values into a unique output that summarizes the given information. Typically, the aggregation process is formalized in terms of an increasing mathematical function that maps the input values to the result, fulfilling some boundary conditions. However, this formalization can be too restrictive for some scenarios. In some cases, the inputs can be seen as observations of random variables, the aggregation result being also a random variable. In others, the aggregation process can be identified as a program that performs the aggregation rather than a mathematical function. In this direction, the concepts of aggregation of random variables and computable aggregation have been defined in the literature. This paper is devoted to the definition of computable aggregation of random variables, which are computer programs, not functions, that aggregate random variables, not numbers. Special attention is given to different possible alternatives to modelize random variables and monotonicity. The implementation of some examples is also provided.
PB Elsevier
SN 0020-0255
YR 2024
FD 2024
LK https://hdl.handle.net/20.500.14352/104589
UL https://hdl.handle.net/20.500.14352/104589
LA eng
NO Juan Baz, Irene Díaz, Luis Garmendia, Daniel Gómez, Luis Magdalena, Susana Montes, Computable aggregations of random variables, Information Sciences, Volume 654, 2024, 119842.
NO Programa Severo Ochoa del Principado de Asturias
NO Gobierno de España. Ministerio de  Ciencia e Innovación
NO Comunidad de Madrid
DS Docta Complutense
RD 6 abr 2025