Order compatible fuzzy relations and their elicitation from general fuzzy partitions

Authors:
Sandra Sandri;Flávia Toledo Martins-Bedé
Affiliations:
INPE, S. J. Campos, S.P., Brazil;INPE, S. J. Campos, S.P., Brazil
Venue:
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Year:
2011

Citing 12
Cited 1

Searching for flexible repeated patterns using a non-transitive similarity relation

Pattern Recognition Letters
T -partitions

Fuzzy Sets and Systems
Fuzzy tolerance relation, fuzzy tolerance space and basis

Fuzzy Sets and Systems
Modelling a linguistic variable as a hierarchical family of partitions induced by an indistinguishability operator

Fuzzy Sets and Systems
Pattern Recognition with Fuzzy Objective Function Algorithms

Pattern Recognition with Fuzzy Objective Function Algorithms
A Generalized Definition of Rough Approximations Based on Similarity

IEEE Transactions on Knowledge and Data Engineering
Restoring Consistency in Systems of Fuzzy Gradual Rules Using Similarity Relations

SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Classification of Schistosomiasis Prevalence Using Fuzzy Case-Based Reasoning

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Practical inference with systems of gradual implicative rules

IEEE Transactions on Fuzzy Systems
Similarity relations and fuzzy orderings

Information Sciences: an International Journal
Interpolation of fuzzy data: Analytical approach and overview

Fuzzy Sets and Systems
Aggregation of monotone reciprocal relations with application to group decision making

Fuzzy Sets and Systems

A method for deriving order compatible fuzzy relations from convex fuzzy partitions

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a special kind of fuzzy relations capable of modeling that two elements in the universe of discourse are similar to the extend that they are close to each other with respect to a given scale. These relations are reflexive and symmetric but not necessarily T-transitive. We study the requirements to construct such relations from a large class of fuzzy partitions that obey some useful but not severely constraining requirements. We give some formal results, including a lower bound (in terms of fuzzy sets inclusion) on the relations from this class that can be derived from the general class of fuzzy partitions.