Aggregation via Clone Theory Approach

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F19%3A73597555" target="_blank" >RIV/61989592:15310/19:73597555 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-19494-9_23" target="_blank" >http://dx.doi.org/10.1007/978-3-030-19494-9_23</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-19494-9_23" target="_blank" >10.1007/978-3-030-19494-9_23</a>

Result language
angličtina
Original language name
Aggregation via Clone Theory Approach
Original language description
It was observed that the set of aggregation functions (on any bounded poset) contains all the projections and it is composition-closed. These classes of functions, called clones, are very intensively studied for decades in many different branches of mathematics. The aim of our paper is to give an extended overview of results concerning certain important clones of aggregation functions on bounded lattices. In particular, we focus on the full clone of aggregation functions, the clone of idempotent aggregation functions, the clone of Sugeno integrals and the clone of polynomial functions.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA18-06915S" target="_blank" >GA18-06915S: New approaches to aggregation operators in analysis and processing of data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)