Number of the records: 1  

Universal integrals based on copulas

  1. 1.
    SYSNO ASEP0432228
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleUniversal integrals based on copulas
    Author(s) Klement, E.P. (AT)
    Mesiar, Radko (UTIA-B) RID, ORCID
    Spizzichino, F. (IT)
    Stupňanová, A. (SK)
    Number of authors4
    Source TitleFuzzy Optimization and Decision Making - ISSN 1568-4539
    Roč. 13, č. 3 (2014), s. 273-286
    Number of pages14 s.
    Publication formPrint - P
    Languageeng - English
    CountryUS - United States
    Keywordscapacity ; copula ; universal integral
    Subject RIVBA - General Mathematics
    R&D ProjectsGAP402/11/0378 GA ČR - Czech Science Foundation (CSF)
    Institutional supportUTIA-B - RVO:67985556
    UT WOS000339889600002
    DOI10.1007/s10700-014-9182-4
    AnnotationA hierarchical family of integrals based on a fixed copula is introduced and discussed. The extremal members of this family correspond to the inner and outer extension of integrals of basic functions, the copula under consideration being the corresponding multiplication. The limits of the members of the family are just copula-based universal integrals as recently introduced in Klement et al. (IEEE Trans Fuzzy Syst 18:178–187, 2010). For the product copula, the family of integrals considered here contains the Choquet and the Shilkret integral, and it belongs to the class of decomposition integrals proposed in Even and Lehrer (Econ Theory, 2013) as well as to the class of superdecomposition integrals introduced in Mesiar et al. (Superdecomposition integral, 2013). For the upper Fréchet-Hoeffding bound, the corresponding hierarchical family contains only two elements: all but the greatest element coincide with the Sugeno integral.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2015
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.