RT Book, Section
T1 A discussion on consistency of global aggregation operators
A1 Gómez González, Daniel
A1 Montero De Juan, Francisco Javier
A2 Calvo, T.
A2 Garcia, E.
A2 Lazaro, J.
AB 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.
PB Universidad de Alcalá
SN 8481385700
YR 2003
FD 2003
LK https://hdl.handle.net/20.500.14352/60923
UL https://hdl.handle.net/20.500.14352/60923
LA eng
NO International Summer School on Aggregation Operators and their Applications 2003 Alcalá de Henares, España  Editor:University of Alcalá
NO Gobierno de España
DS Docta Complutense
RD 5 abr 2025