Aggregation procedures in intelligent systems

  • Authors:
  • Imre J. Rudas;János Fodor

  • Affiliations:
  • Budapest Tech., Institute of Intelligent Systems, Budapest, Hungary;Budapest Tech., Institute of Intelligent Systems, Budapest, Hungary

  • Venue:
  • MACMESE'07 Proceedings of the 9th WSEAS international conference on Mathematical and computational methods in science and engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of aggregating information represented by fuzzy sets in a meaningful way has been of central interest since the late 1970s. In most cases, the aggregation operators are defined on a pure axiomatic basis and are interpreted either as logical connectives (such as t-norms and t-conorms) or as averaging operators allowing a compensation effect (such as the arithmetic mean). On the other hand, it can be observed by some empirical tests that the above-mentioned classes of operators differ from those ones that people use in practice. Therefore, it is important to find operators that are, in a sense, mixtures of the previous ones, and allow some degree of compensation. This paper summarizes the research results of the authors that have been carried out in recent years on generalization of conventional aggregation operators. This includes, but is not limited to, the class of uninorms and nullnorms, absorbing norms, distance- and entropy-based operators, quasi-conjunctions and nonstrict means.