RT Journal Article
T1 Computable Aggregations
A1 Montero, Javier
A1 Gonzalez del Campo, Ramon
A1 Garmendia, Luis
A1 Gómez, D.
A1 Rodríguez, Juan Tinguaro
AB In this paper, we postulate computation as a key element in assuring the consistency of a family of aggregation functions so that such a family of operators can be considered an aggregation rule. In particular, we suggest that the concept of an aggregation rule should be defined from a computational point of view, focusing on the computational properties of such an aggregation, i.e., on the manner in which the aggregation values are computed. The new algorithmic definition of aggregation we propose provides an operational approach to aggregation, one that is based upon lists of variable length and that produces a solution even when portions of data are inserted or deleted. Among other advantages, this approach allows the construction of different classifications of aggregation rules according to the programming paradigms used for their computation or according to their computational complexity.
PB Elsevier  Science Inc
SN 0020-0255
YR 2017
FD 2017-10-07
LK https://hdl.handle.net/20.500.14352/18168
UL https://hdl.handle.net/20.500.14352/18168
LA eng
NO Ministerio de Economía y Competitividad (MINECO)
NO Comunidad de Madrid
NO Universidad Complutense de Madrid
DS Docta Complutense
RD 30 nov 2023