K-minitive capacities and k-minitive aggregation functions
Version 2 2024-06-06, 04:28Version 2 2024-06-06, 04:28
Version 1 2019-10-03, 08:45Version 1 2019-10-03, 08:45
journal contribution
posted on 2024-06-06, 04:28 authored by Jianzhang WuJianzhang Wu, Gleb BeliakovGleb Beliakov© 2019 - IOS Press and the authors. All rights reserved. The main aim of this paper is to evoke more attentions on the dual concepts of k-maxitive capacity and k-maxitive aggregation, called k-minitive capacity and k-minitive aggregation by convention. We point out that possibility and necessity capacities, and k-tolerant and k-intolerant capacities are special cases of k-maxitive and k-minitive capacities. We also discuss some properties of k-minitive aggregation dual to those of the k-maxitive aggregation functions. For the purport of advocating the application of k-minitive and k-maxitive capacities, we finally present the mixed integer programming based identification method and illustrate its steps and results through an example.
History
Journal
Journal of Intelligent and Fuzzy SystemsVolume
37Pagination
2797-2808Location
Amsterdam, The NetherlandsPublisher DOI
ISSN
1064-1246eISSN
1875-8967Language
engPublication classification
C1 Refereed article in a scholarly journalIssue
2Publisher
IOS PressPublication URL
Usage metrics
Keywords
Licence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC