The direct and inverse problem of the matching of fuzzy sets depending on fuzziness

Abstract

Addresses the problem of matching two fuzzy sets. Proposes a matching method that considers the extent to which both fuzzy sets have the same meaning. For a given degree of similarity between two sets, the same meaning decreases as the fuzziness increases and, in particular, for equal fuzzy sets the degree of matching is a function of the fuzziness only. A complete matching of two sets is obtained only when they are equal and crisp. Finally, the inverse problem is studied, of characterizing one of the sets used in the match when knowing the other set and the result of the matching.

Citation

Gasos, J. and Ralescu, A. (1995), "The direct and inverse problem of the matching of fuzzy sets depending on fuzziness", Kybernetes, Vol. 24 No. 1, pp. 9-17. https://doi.org/10.1108/03684929510079250