Sökning: onr:"swepub:oai:DiVA.org:his-14605" >
Decomposition theor...
Decomposition theorems and extension principles for hesitant fuzzy sets
-
- Alcantud, Jose Carlos R. (författare)
- BORDA Research Unit and Multidisciplinary Institute of Enterprise (IME), University of Salamanca, Salamanca, Spain
-
- Torra, Vicenç (författare)
- Högskolan i Skövde,Institutionen för informationsteknologi,Forskningscentrum för Informationsteknologi,Skövde Artificial Intelligence Lab (SAIL)
-
(creator_code:org_t)
- Elsevier, 2018
- 2018
- Engelska.
-
Ingår i: Information Fusion. - : Elsevier. - 1566-2535 .- 1872-6305. ; 41, s. 48-56
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We prove a decomposition theorem for hesitant fuzzy sets, which states that every typical hesitant fuzzy set on a set can be represented by a well-structured family of fuzzy sets on that set. This decomposition is expressed by the novel concept of hesitant fuzzy set associated with a family of hesitant fuzzy sets, in terms of newly defined families of their cuts. Our result supposes the first representation theorem of hesitant fuzzy sets in the literature. Other related representation results are proven. We also define two novel extension principles that extend crisp functions to functions that map hesitant fuzzy sets into hesitant fuzzy sets.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Hesitant fuzzy set
- Cut set
- Decomposition theorem
- Representation theorem
- Extension principle
- Skövde Artificial Intelligence Lab (SAIL)
- Skövde Artificial Intelligence Lab (SAIL)
- INF301 Data Science
- INF301 Data Science
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas