Ramón González del Campo

Some New Measures of k-Specificity

Measures of k-specificity are generalizations of Yager’s measures of specificity to measure the tranquility when choosing k elements from the universe of discourse.

Comparing families of measures of k-specificity. measure of crispness

Measures of k-specificity are generalizations of Yagers measures of specificity of fuzzy sets or possibility distribution to measure the tranquility when choosing one element, extended to the case when choosing k elements from the universe of discourse. In this paper a new measure of κ-specificity is defined, and an axiomatic definition of measure of crispness is provided. Specificity and entropy has been shown to be inversely related.

Hesitant fuzzy sets and relations using lists

Hesitant Fuzzy Sets are useful to represent the information given by several experts. However, this possibility usually require to deal with sets of values with different cardinality and the necessity to compare them, it is, not all experts evaluate all the elements in the universe. In this paper it is proposed a new nomenclature for Hesitant Fuzzy Sets called Hesitant Fuzzy Sets using Lists. It is proposed a new partial order relation between lists of membership degrees. This partial order relation allows to handle lists with different lengths. In addition, Hesitant Fuzzy Relations on Lists operations are defined and the T-transitive closure of a Hesitant Fuzzy Relation is given. It is proved this T-transitive closure always exists and it is unique. Finally, an algorithm to compute the T-transitive closure of a Hesitant Fuzzy Relation is proposed and several examples are given.

Expansible Computable Aggregation Rules

The aggregation operator have been considered from a computable point of view. The important condition that the computation is friendly when portions of data are inserted o deleted to the list of values to aggregate is considered.