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.

Constructions of aggregation operators that preserve ordering of the data

We address the issue of identifying various classes of aggregation operators from empirical data, which also preserves the ordering of the outputs. It is argued that the ordering of the outputs is more important than the numerical values, however the usual data fitting methods are only concerned with fitting the values. We will formulate preservation of the ordering problem as a standard mathematical programming problem, solved by standard numerical methods.

Guest editorial: foreword to the special issue on aggregation operators

The fourteen papers in this special section are devoted to aggregation operators with respect to knowledge based systems.

Fitting aggregation operators to data

Theoretical advances in modelling aggregation of information produced a wide range of aggregation operators, applicable to almost every practical problem. The most important classes of aggregation operators include triangular norms, uninorms, generalised means and OWA operators.
With such a variety, an important practical problem has emerged: how to fit the parameters/ weights of these families of aggregation operators to observed data? How to estimate quantitatively whether a given class of operators is suitable as a model in a given practical setting? Aggregation operators are rather special classes of functions, and thus they require specialised regression techniques, which would enforce important theoretical properties, like commutativity or associativity. My presentation will address this issue in detail, and will discuss various regression methods applicable specifically to t-norms, uninorms and generalised means. I will also demonstrate software implementing these regression techniques, which would allow practitioners to paste their data and obtain optimal parameters of the chosen family of operators.

Interpolatory type construction of general aggregation operators

In this chapter we examine a number of methods to construct aggregation operators of interpolatory type for specific applications. The construction is based on the desired values of the aggregation operator at certain prototypical points, and on other desired properties, such as, conjuctive, disjunctive or averaging behaviour, symmetry and marginals.

Identification of weights in aggregation operators

This chapter provides a review of various techniques for identification of weights in generalized mean and ordered weighted averaging aggregation operators, as well as identification of fuzzy measures in Choquet integral based operators. Our main focus is on using empirical data to compute the weights. We present a number of practical algorithms to identify the best aggregation operator that fits the data.

Consistency and stability in aggregation operators : an application to missing data problems

In this work we analyze the key issue of the relationship that should hold between the operators in a family {An} of aggregation operators in order to understand they properly define a consistent whole. Here we extend some of the ideas about stability of a family of aggregation operators into a more general framework, formally defining the notions of i – L and j – R strict stability for families of aggregation operators. The notion of strict stability of order k is introduced as well. Finally, we also present an application of the strict stability conditions to deal with missing data problems in an information aggregation process. For this analysis, we have focused in the weighted mean family and the quasi-arithmetic weighted means families.

Lipschitz compact operators

We introduce the notion of Lipschitz compact (weakly compact, finite-rank, approximable) operators from a pointed metric space X into a Banach space E. We prove that every strongly Lipschitz p-nuclear operator is Lipschitz compact and every strongly Lipschitz p-integral operator is Lipschitz weakly compact. A theory of Lipschitz compact (weakly compact, finite-rank) operators which closely parallels the theory for linear operators is developed. In terms of the Lipschitz transpose map of a Lipschitz operator, we state Lipschitz versions of Schauder type theorems on the (weak) compactness of the adjoint of a (weakly) compact linear operator.

Construction of k-Lipschitz triangular norms and conorms from empirical data

This paper examines the practical construction of k-Lipschitz triangular norms and conorms from empirical data. We apply a characterization of such functions based on k-convex additive generators and translate k-convexity of piecewise linear strictly decreasing functions into a simple set of linear inequalities on their coefficients. This is the basis of a simple linear spline-fitting algorithm, which guarantees k-Lipschitz property of the resulting triangular norms and conorms.

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 ∈]0, 1[.

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.

Learning weights in the generalized OWA operators

This paper discusses identification of parameters of generalized ordered weighted averaging (GOWA) operators from empirical data. Similarly to ordinary OWA operators, GOWA are characterized by a vector of weights, as well as the power to which the arguments are raised. We develop optimization techniques which allow one to fit such operators to the observed data. We also generalize these methods for functional defined GOWA and generalized Choquet integral based aggregation operators.

Fitting ST-OWA operators to empirical data

The OWA operators gained interest among researchers as they provide a continuum of aggregation operators able to cover the whole range of compensation between the minimum and the maximum. In some circumstances, it is useful to consider a wider range of values, extending below the minimum and over the maximum. ST-OWA are able to surpass the boundaries of variation of ordinary compensatory operators. Their application requires identification of the weighting vector, the t-norm, and the t-conorm. This task can be accomplished by considering both the desired analytical properties and empirical data.

Handling neutral and absorbent information in aggregation processes

We generalize the concepts of neutral and absorbent elements of aggregation operators. We introduce two types of tuples of values: the neutral tuples and the absorbent tuples. the neutral tuples are useful in situations in which information from different sources, or preferences of several decision makers, cancel each other. Absorbent tuples are useful in 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 neutral and absorbent tuples.