Abstract
We address a special kind of fuzzy relations capable of modeling that two elements in the universe of discourse are similar to the extent that they are close to each other with respect to a given total order. These order compatible fuzzy relations are reflexive and symmetric but not necessarily T-transitive. We address the requirements to construct such relations from a large class of fuzzy partitions that obey some requirements from the fuzzy sets in the partition, such as convexity, that are useful but not severely constraining. We also propose a new method to obtain those fuzzy relations from these partitions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
