Idempotent weighted aggregation based on binary aggregation trees

Dujmović, Jozo and Beliakov, Gleb 2017, Idempotent weighted aggregation based on binary aggregation trees, International journal of intelligent systems, vol. 32, no. 1, pp. 31-50, doi: 10.1002/int.21828.

Attached Files
Name Description MIMEType Size Downloads

Title Idempotent weighted aggregation based on binary aggregation trees
Author(s) Dujmović, Jozo
Beliakov, GlebORCID iD for Beliakov, Gleb
Journal name International journal of intelligent systems
Volume number 32
Issue number 1
Start page 31
End page 50
Total pages 20
Publisher John Wiley & Sons
Place of publication Hoboken, N.J.
Publication date 2017-01
ISSN 0884-8173
Keyword(s) Science & Technology
Computer Science, Artificial Intelligence
Computer Science
Summary 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.
Language eng
DOI 10.1002/int.21828
Field of Research 080108 Neural, Evolutionary and Fuzzy Computation
Socio Economic Objective 970101 Expanding Knowledge in the Mathematical Sciences
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2016, Wiley Periodicals
Persistent URL

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 6 times in TR Web of Science
Scopus Citation Count Cited 9 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 359 Abstract Views, 1 File Downloads  -  Detailed Statistics
Created: Thu, 18 Aug 2016, 13:24:49 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact