Universidad Complutense de Madrid
E-Prints Complutense

Computable Aggregations



Downloads per month over past year

Montero, Javier and Gonzalez del Campo, Ramon and Garmendia, Luis and Gómez, D. and Rodríguez, Juan Tinguaro (2017) Computable Aggregations. Information Sciences . ISSN 0020-0255

[thumbnail of Montero280Preprint.pdf]

Official URL: http://www.sciencedirect.com/science/article/pii/S0020025517310058


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.

Item Type:Article
Uncontrolled Keywords:Aggregation operator; Aggregation function; Aggregation rule
Subjects:Sciences > Mathematics > Probabilities
ID Code:45076
Deposited On:18 Oct 2017 09:41
Last Modified:07 Oct 2019 23:01

Origin of downloads

Repository Staff Only: item control page