Abstract
The use of aggregation operators that require ordering of the data brings a problem when the structures to be aggregated are multi-valued, since there may be several admissible orders. To addressing this problem, the concept of admissible permutation was introduced for intervals. In this paper we extend this concept to vector domain. However, the problem of selecting the best possible permutation is still an open problem. In this paper we present a novel concept in order to choose the best admissible permutation for vectors: the degree of totalness. This concept allows us to represent to which degree the admissible permutation reorder given vectors as a chain with respect to the partial order. Finally, from the best admissible permutation we construct the Choquet integral.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have