Article ID Journal Published Year Pages File Type
4969089 Information Fusion 2018 29 Pages PDF
Abstract
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.
Related Topics
Physical Sciences and Engineering Computer Science Computer Vision and Pattern Recognition
Authors
, ,