• Publications
  • Influence
A note on the superadditive and the subadditive transformations of aggregation functions
  • A. Siposová
  • Computer Science, Mathematics
  • Fuzzy Sets Syst.
  • 30 December 2015
TLDR
We expand the theoretical background of the recently introduced superadditive and subadditive transformations of aggregation functions. Expand
  • 12
  • 3
A generalization of the discrete Choquet and Sugeno integrals based on a fusion function
TLDR
We present an approach to generalization of the discrete Choquet and Sugeno integrals by replacing the product operator by a fusion function. Expand
  • 16
  • 1
Approximation of super- and sub-additive transformations of aggregation functions
Super- and sub-additive transformations of aggregation functions are defined by means of suprema and infima ranging over simplices with potentially unbounded dimension. Determination of exact valuesExpand
  • 5
  • 1
Weighted scalarization related to Lp-metric and pareto optimality
TLDR
The problem of finding “simultaneous maxima” of a family of real functions fi (1 ≤ i ≤ m) over a set X is well known as multicriteria optimization problem. Expand
  • 1
  • 1
On some Transformations of Fuzzy Measures
Abstract In this paper, some transformations of fuzzy measures are reviewed. Then, based on them, two new transformations are introduced and their properties are investigated. Also, some examples areExpand
  • 5
Integration Based on Fusion Functions
In this paper, we present an approach to data aggregation  based on a generalization of the discrete  Choquet integral by means of fusion functions. Inspired by \cite{MKB}, we merge informationExpand
  • 4
Aggregation functions with given super-additive and sub-additive transformations
TLDR
Aggregation functions and their transformations have found numerous applications in various kinds of systems as well as in economics and social science. Expand
  • 9
  • PDF
On the existence of aggregation functions with given super-additive and sub-additive transformations
TLDR
We prove that if A ⁎ has a slightly stronger property of being strictly directionally convex, then A = A ⍎ and A ⌎ is linear; dually, we prove that A ↦ A ⎎ is also linear. Expand
  • 8
Super- and subadditive constructions of aggregation functions
TLDR
We introduce two construction methods for aggregation functions based on a restricted a priori known decomposition set and decomposition weighing function are introduced and studied. Expand
  • 3
  • PDF
...
1
2
3
...