Super- and subadditive constructions of aggregation functions

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F17%3AA1701KV2" target="_blank" >RIV/61988987:17610/17:A1701KV2 - isvavai.cz</a>
Alternative codes found
RIV/61988987:17610/17:A2301KV2
Result on the web
<a href="http://dx.doi.org/10.1016/j.inffus.2016.06.006" target="_blank" >http://dx.doi.org/10.1016/j.inffus.2016.06.006</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.inffus.2016.06.006" target="_blank" >10.1016/j.inffus.2016.06.006</a>

Result language
angličtina
Original language name
Super- and subadditive constructions of aggregation functions
Original language description
Two construction methods for aggregation functions based on a restricted a priori known decomposition set and decomposition weighing function are introduced and studied. The outgoing aggregation functions are either superadditive or subadditive. Several examples, including illustrative figures, show the potential of the introduced construction methods. Our approach generalizes several known constructions and optimization methods, including decomposition and superdecomposition integrals. We present also an economic applications of the introduced concepts.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)