On Lipschitz properties of generated aggregation functions

This article discusses Lipschitz properties of generated aggregation functions. Such generated functions include triangular norms and conorms, quasi-arithmetic means, uninorms, nullnorms and continuous generated functions with a neutral element. The Lipschitz property guarantees stability of aggregation operations with respect to input inaccuracies, and is important for applications. We provide verifiable sufficient conditions to determine when a generated aggregation function holds the k-Lipschitz property, and calculate the Lipschitz constants of power means. We also establish sufficient conditions which guarantee that a generated aggregation function is not Lipschitz. We found the only 1-Lipschitz generated function with a neutral element e &isin;]0, 1[.<br /

Some results on Lipschitz quasi-arithmetic means

We present in this paper some properties of k-Lipschitz quasi-arithmetic means. The Lipschitz aggregation operations are stable with respect to input inaccuracies, what is a very important property for applications. Moreover, we provide sufficient conditions to determine when a quasi&ndash;arithemetic mean holds the k-Lipschitz property and allow us to calculate the Lipschitz constant k.<br /

Quasi-arithmetic means and OWA functions in interval-valued and Atanassov's intuitionistic fuzzy set theory

In this paper we propose an extension of the well-known OWA functions introduced by Yager to interval-valued (IVFS) and Atanassov’s intuitionistic (AIFS) fuzzy set theory. We first extend the arithmetic and the quasi-arithmetic mean using the arithmetic operators in IVFS and AIFS theory and investigate under which conditions these means are idempotent. Since on the unit interval the construction of the OWA function involves reordering the input values, we propose a way of transforming the input values in IVFS and AIFS theory to a new list of input values which are now ordered

Generalized Bonferroni mean operators in multi-criteria aggregation

In this paper we provide a systematic investigation of a family of composed aggregation functions which generalize the Bonferroni mean. Such extensions of the Bonferroni mean are capable of modeling the concepts of hard and soft partial conjunction and disjunction as well as that of k-tolerance and k-intolerance. There are several interesting special cases with quite an intuitive interpretation for application

Aggregating T-equivalence relations

This contribution deals with the problem of aggregating Tequivalence relations, in the sense that we are looking for functions that preserve reflexivity, symmetry, and transitivity with respect to a given t-norm T. We obtain a complete description of those functions in terms of that we call T-triangular triplets. Any extra condition on the t-norm is assumed.Postprint (published version

Absorbent tuples of aggregation operators

We generalize the notion of an absorbent element of aggregation operators. Our construction involves tuples of values that decide the result of aggregation. Absorbent tuples are useful to model situations in which certain decision makers may decide the outcome irrespective of the opinion of the others. We examine the most important classes of aggregation operators in respect to their absorbent tuples, and also construct new aggregation operators with predefined sets of absorbent tuples.<br /

Aggregation functions based on penalties

This article studies a large class of averaging aggregation functions based on minimizing a distance from the vector of inputs, or equivalently, minimizing a penalty imposed for deviations of individual inputs from the aggregated value. We provide a systematization of various types of penalty based aggregation functions, and show how many special cases arise as the result. We show how new aggregation functions can be constructed either analytically or numerically and provide many examples. We establish connection with the maximum likelihood principle, and present tools for averaging experimental noisy data with distinct noise distributions.<br /

Aggregation functions: Means

The two-parts state-of-art overview of aggregation theory summarizes the essential information concerning aggregation issues. Overview of aggregation properties is given, including the basic classification of aggregation functions. In this first part, the stress is put on means, i.e., averaging aggregation functions, both with fixed arity (n-ary means) and with open arity (extended means).