2026-07-25T23:36:12Zhttps://docta.ucm.es/rest/oai/requestoai:docta.ucm.es:20.500.14352/609232024-11-26T14:01:17Zcom_20.500.14352_14col_20.500.14352_21
Docta Complutense
author
Gómez González, Daniel
author
Montero De Juan, Francisco Javier
editor
Calvo, T.
editor
Garcia, E.
editor
Lazaro, J.
2023-06-20T21:11:24Z
2023-06-20T21:11:24Z
2003
8481385700
https://hdl.handle.net/20.500.14352/60923
Several authors have introduced global aggregation operators as families of aggregation operators fTngn, being each one of these Tn the n-ary operator in charge of aggregation, if and only if the number of items being actually aggregated is n. But according to this general de¯nition, it is clear that operators within the same family may be not related at all. In this paper we shall point out the absolute need of an additional condition allowing some kind of consistency for such a family of operators, in order to be considered an aggregation rule. In particular, we shall discuss some advantages and limits of the concept of recursiveness, which basically assumes that the aggregation can be worked out by means of a recursive process. A comparative analysis with some alternative consistency conditions is also presented.
eng
A discussion on consistency of global aggregation operators
book part
URL
https://docta.ucm.es/bitstreams/5867547e-c683-4637-9e17-8e6eee8463c4/download
File
MD5
577aadbb5aa62f86e176c7b1ef6a59e9
109480
application/pdf
Montero185.pdf
URL
https://docta.ucm.es/bitstreams/f6aae05d-243c-48f9-9b94-360ec5a9a878/download
File
MD5
9b064cd812717f5c741ab228de3b9993
16222
text/plain
Montero185.pdf.txt