Idempotent weighted aggregation based on binary aggregation trees
Data(s) |
27/05/2016
|
---|---|
Resumo |
We propose weighted aggregation algorithms for creating general idempotent weighted aggregators of n variables derived from related symmetric idempotent aggregators of two variables. This computational method, together with interpolative aggregation, can be used for the development of general idempotent logic aggregators that satisfy a variety of conditions necessary for building decision models in the area of weighted compensative logic. |
Identificador | |
Idioma(s) |
eng |
Publicador |
John Wiley & Sons |
Relação |
http://dro.deakin.edu.au/eserv/DU:30085248/beliakov-idempotent-inpress-2016.pdf http://www.dx.doi.org/10.1002/int.21828 |
Direitos |
2016, Wiley Periodicals |
Tipo |
Journal Article |