1,348 research outputs found
On Sugeno integral as an aggregation function
The Sugeno integral, for a given fuzzy measure, is studied under the viewpoint of aggregation. In particular, we give some equivalent expressions of it. We also give an axiomatic characterization of the class of all the Sugeno integrals. Some particular subclasses, such as the weighted maximum and minimum functions are investigated as well
Characterizations of discrete Sugeno integrals as polynomial functions over distributive lattices
We give several characterizations of discrete Sugeno integrals over bounded
distributive lattices, as particular cases of lattice polynomial functions,
that is, functions which can be represented in the language of bounded lattices
using variables and constants. We also consider the subclass of term functions
as well as the classes of symmetric polynomial functions and weighted minimum
and maximum functions, and present their characterizations, accordingly.
Moreover, we discuss normal form representations of these functions
Invariant functionals on completely distributive lattices
In this paper we are interested in functionals defined on completely
distributive lattices and which are invariant under mappings preserving
{arbitrary} joins and meets. We prove that the class of nondecreasing invariant
functionals coincides with the class of Sugeno integrals associated with
-valued capacities, the so-called term functionals, thus extending
previous results both to the infinitary case as well as to the realm of
completely distributive lattices. Furthermore, we show that, in the case of
functionals over complete chains, the nondecreasing condition is redundant.
Characterizations of the class of Sugeno integrals, as well as its superclass
comprising all polynomial functionals, are provided by showing that the
axiomatizations (given in terms of homogeneity) of their restriction to
finitary functionals still hold over completely distributive lattices. We also
present canonical normal form representations of polynomial functionals on
completely distributive lattices, which appear as the natural extensions to
their finitary counterparts, and as a by-product we obtain an axiomatization of
complete distributivity in the case of bounded lattices
Axiomatizations of quasi-polynomial functions on bounded chains
Two emergent properties in aggregation theory are investigated, namely
horizontal maxitivity and comonotonic maxitivity (as well as their dual
counterparts) which are commonly defined by means of certain functional
equations. We completely describe the function classes axiomatized by each of
these properties, up to weak versions of monotonicity in the cases of
horizontal maxitivity and minitivity. While studying the classes axiomatized by
combinations of these properties, we introduce the concept of quasi-polynomial
function which appears as a natural extension of the well-established notion of
polynomial function. We give further axiomatizations for this class both in
terms of functional equations and natural relaxations of homogeneity and median
decomposability. As noteworthy particular cases, we investigate those
subclasses of quasi-term functions and quasi-weighted maximum and minimum
functions, and provide characterizations accordingly
Weighted lattice polynomials
We define the concept of weighted lattice polynomial functions as lattice
polynomial functions constructed from both variables and parameters. We provide
equivalent forms of these functions in an arbitrary bounded distributive
lattice. We also show that these functions include the class of discrete Sugeno
integrals and that they are characterized by a median based decomposition
formula.Comment: Revised version (minor changes
Pseudo-polynomial functions over finite distributive lattices
In this paper we consider an aggregation model f: X1 x ... x Xn --> Y for
arbitrary sets X1, ..., Xn and a finite distributive lattice Y, factorizable as
f(x1, ..., xn) = p(u1(x1), ..., un(xn)), where p is an n-variable lattice
polynomial function over Y, and each uk is a map from Xk to Y. The resulting
functions are referred to as pseudo-polynomial functions. We present an
axiomatization for this class of pseudo-polynomial functions which differs from
the previous ones both in flavour and nature, and develop general tools which
are then used to obtain all possible such factorizations of a given
pseudo-polynomial function.Comment: 16 pages, 2 figure
Weighted lattice polynomials of independent random variables
We give the cumulative distribution functions, the expected values, and the
moments of weighted lattice polynomials when regarded as real functions of
independent random variables. Since weighted lattice polynomial functions
include ordinary lattice polynomial functions and, particularly, order
statistics, our results encompass the corresponding formulas for these
particular functions. We also provide an application to the reliability
analysis of coherent systems.Comment: 14 page
- …