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 /

Induced aggregation operators in decision making with the Dempster-Shafer belief structure

We study the induced aggregation operators. The analysis begins with a revision of some basic concepts such as the induced ordered weighted averaging (IOWA) operator and the induced ordered weighted geometric (IOWG) operator. We then analyze the problem of decision making with Dempster-Shafer theory of evidence. We suggest the use of induced aggregation operators in decision making with Dempster-Shafer theory. We focus on the aggregation step and examine some of its main properties, including the distinction between descending and ascending orders and different families of induced operators. Finally, we present an illustrative example in which the results obtained using different types of aggregation operators can be seen.aggregation operators, dempster-shafer belief structure, uncertainty, iowa operator, decision making

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 /

Homogeneous aggregation operators

summary:Recently, the utilization of invariant aggregation operators, i.e., aggregation operators not depending on a given scale of measurement was found as a very current theme. One type of invariantness of aggregation operators is the homogeneity what means that an aggregation operator is invariant with respect to multiplication by a constant. We present here a complete characterization of homogeneous aggregation operators. We discuss a relationship between homogeneity, kernel property and shift-invariance of aggregation operators. Several examples are included

Identification of general and double aggregation operators using monotone smoothing

Aggregation operators model various operations on fuzzy sets, such as conjunction, disjunction and averaging. Recently double aggregation operators have been introduced; they model multistep aggregation process. The choice of aggregation operators depends on the particular problem, and can be done by fitting the operator to empirical data. We examine fitting general aggregation operators by using a new method of monotone Lipschitz smoothing. We study various boundary conditions and constraints which determine specific types of aggregation.<br /

Aggregation, non-contradiction ans excluded-middle

This paper investigates the satisfaction of the Non-Contradiction (NC) and Excluded-Middle (EM) laws within the domain of aggregation operators. It provides characterizations both for those aggregation operators that satisfy NC/EM with respect to (w.r.t.) some given strong negation, as well as for those satisfying them w.r.t. any strong negation. The results obtained are applied to some of the most important known classes of aggregation operators

Aggregation operators on partially ordered sets and their categorical foundations

summary:In spite of increasing studies and investigations in the field of aggregation operators, there are two fundamental problems remaining unsolved: aggregation of $L$-fuzzy set-theoretic notions and their justification. In order to solve these problems, we will formulate aggregation operators and their special types on partially ordered sets with universal bounds, and introduce their categories. Furthermore, we will show that there exists a strong connection between the category of aggregation operators on partially ordered sets with universal bounds (Agop) and the category of partially ordered groupoids with universal bounds (Pogpu). Moreover, the subcategories of Agop consisting of associative aggregation operators, symmetric and associative aggregation operators and associative aggregation operators with neutral elements are, respectively, isomorphic to the subcategories of Pogpu formed by partially ordered semigroups, commutative partially ordered semigroups and partially ordered monoids in the sense of Birkhoff. As a justification of the present notions and results, some relevant examples for aggregations operators on partially ordered sets are given. Particularly, aggregation process in probabilistic metric spaces is also considered

Handling of neutral information by aggregation operators

We generalize the notion of a neutral element of aggregation operators. Our construction involves tuples of values that are neutral with respect to the result of aggregation. Neutral tuples are useful to model situations in which information from different sources, or preferences of several decision makers, cancel each other. We examine many popular classes of aggregation operators in respect to their neutral sets, and also construct new aggregation operators with predefined neutral sets<br /

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 /

Generalized Hamacher aggregation operators for intuitionistic uncertain linguistic sets: Multiple attribute group decision making methods

© 2019 by the authors. In this paper, we consider multiple attribute group decision making (MAGDM) problems in which the attribute values take the form of intuitionistic uncertain linguistic variables. Based on Hamacher operations, we developed several Hamacher aggregation operators, which generalize the arithmetic aggregation operators and geometric aggregation operators, and extend the algebraic aggregation operators and Einstein aggregation operators. A number of special cases for the two operators with respect to the parameters are discussed in detail. Also, we developed an intuitionistic uncertain linguistic generalized Hamacher hybrid weighted average operator to reflect the importance degrees of both the given intuitionistic uncertain linguistic variables and their ordered positions. Based on the generalized Hamacher aggregation operator, we propose a method for MAGDM for intuitionistic uncertain linguistic sets. Finally, a numerical example and comparative analysis with related decision making methods are provided to illustrate the practicality and feasibility of the proposed method