Premium
Hierarchies of aggregation operators
Author(s) -
Cutello Vincenzo,
Montero Javier
Publication year - 1994
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.4550091104
Subject(s) - computer science , hierarchical organization , cover (algebra) , hierarchical database model , point (geometry) , hierarchical control system , key (lock) , theoretical computer science , hierarchical clustering , artificial intelligence , data mining , mathematics , cluster analysis , control (management) , computer security , mechanical engineering , geometry , management , engineering , economics
This article deals with hierarchies of operators. In particular, we will analyze the problem of amalgamating individual opinions into a single group opinion, based upon hierarchical intensity aggregation rules. Our main goal is to decide whether hierarchical amalgamations are supported from an ethical and rational point of view. We will consider two different hierarchical procedures: cover‐based hierarchical aggregations and ordered hierarchical aggregations, focusing here our attention to ordered hierarchical aggregations of OWA operators. In particular, we will obtain that basic key properties propagate under both hierarchical amalgamation rules, in the sense that the procedure itself will verify such properties whenever they are assumed for every partial amalgamation defining such a hierarchical procedure. © 1994 John Wiley & Sons, Inc.