Pointwise construction of Lipschitz aggregation operators

This paper establishes tight upper and lower bounds on Lipschitz aggregation operators considering their diagonal, opposite diagonal and marginal sections. Also we provide explicit formulae to determine the bounds. These are useful for construction of these type of aggregation operators, especially using interpolation schemata.<br /

Pointwise construction of Lippschitz aggregation operators with specific properties

This paper describes an approach to pointwise construction of general aggregation operators, based on monotone Lipschitz approximation. The aggregation operators are constructed from a set of desired values at certain points, or from empirically collected data. It establishes tight upper and lower bounds on Lipschitz aggregation operators with a number of different properties, as well as the optimal aggregation operator, consistent with the given values. We consider conjunctive, disjunctive and idempotent n-ary aggregation operators; p-stable aggregation operators; various choices of the neutral element and annihilator; diagonal, opposite diagonal and marginal sections; bipolar and double aggregation operators. In all cases we provide either explicit formulas or deterministic numerical procedures to determine the bounds. The findings of this paper are useful for construction of aggregation operators with specified properties, especially using interpolation schemata.<br /

A new family of trivariate proper quasi-copulas

summary:In this paper, we provide a new family of trivariate proper quasi-copulas. As an application, we show that $W^{3}$ – the best-possible lower bound for the set of trivariate quasi-copulas (and copulas) – is the limit member of this family, showing how the mass of $W^3$ is distributed on the plane $x+y+z=2$ of $[0,1]^3$ in an easy manner, and providing the generalization of this result to $n$ dimensions

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 /

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 /

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 /

Construction of aggregation operators with noble reinforcement

This paper examines disjunctive aggregation operators used in various recommender systems. A specific requirement in these systems is the property of noble reinforcement: allowing a collection of high-valued arguments to reinforce each other while avoiding reinforcement of low-valued arguments. We present a new construction of Lipschitz-continuous aggregation operators with noble reinforcement property and its refinements. <br /