[Paper Review] Fuzzy Rough Relations

T. K. Samanta, Biswajit Sarkar|arXiv (Cornell University)|Sep 6, 2011

Rough Sets and Fuzzy Logic2 references3 citations

TL;DR

This paper introduces fuzzy rough relations on a set, defining their algebraic properties and closure under operations like algebraic sum and product. It establishes that the collection of fuzzy rough relations is closed under max-min composition, and investigates reflexivity, symmetry, and transitivity in this context, contributing a formal framework for fuzzy rough set theory in relational structures.

ABSTRACT

In this paper, the definition of fuzzy rough relation on a set will be introduced and then it would be proved that the collection of such relations is closed under different binary compositions such as, algebraic sum, algebraic product etc. Also the definitions of reflexive, symmetric and transitive fuzzy rough relations on a set are given and a few properties of them will be investigated. Lastly, we define a operation, which is a composition of two fuzzy rough relations, with the help of maxmin relation and thereafter it is shown that the collection of such relations is closed under the operation.

Motivation & Objective

• To formalize the concept of fuzzy rough relations on a set, extending classical rough set theory to fuzzy environments.
• To investigate closure properties of fuzzy rough relations under various binary compositions, including algebraic sum and product.
• To define and analyze fundamental relational properties—reflexivity, symmetry, and transitivity—within the fuzzy rough framework.
• To introduce a max-min composition operation between fuzzy rough relations and prove closure under this operation.
• To establish a foundational algebraic structure for fuzzy rough relations, enabling further theoretical and applied developments.

Proposed method

• Proposes a definition of fuzzy rough relations as fuzzy relations on a set, based on lower and upper approximation operators.
• Applies algebraic operations such as algebraic sum and product to fuzzy rough relations, proving closure under these operations.
• Defines reflexive, symmetric, and transitive fuzzy rough relations by extending classical relation properties to the fuzzy rough setting.
• Introduces a max-min composition operation between two fuzzy rough relations, using the standard max-min matrix multiplication approach.
• Demonstrates that the set of all fuzzy rough relations is closed under the max-min composition, ensuring structural consistency.
• Uses formal mathematical reasoning and set-theoretic arguments to prove closure and property preservation under operations.

Experimental results

Research questions

• RQ1 How can fuzzy rough relations be formally defined on a set, and what are their foundational properties?
• RQ2 Are fuzzy rough relations closed under standard binary operations such as algebraic sum and product?
• RQ3 How do classical relational properties—reflexivity, symmetry, and transitivity—behave in the context of fuzzy rough relations?
• RQ4 Is there a meaningful composition operation for fuzzy rough relations, and is the set closed under it?
• RQ5 What algebraic structure do fuzzy rough relations form under the proposed operations?

Key findings

• The collection of all fuzzy rough relations on a set is closed under algebraic sum and product operations.
• Fuzzy rough relations can be reflexive, symmetric, or transitive, and these properties are preserved under specific conditions.
• The max-min composition of two fuzzy rough relations results in another fuzzy rough relation, proving closure under this operation.
• The paper establishes that fuzzy rough relations form a well-defined algebraic structure under the defined operations.
• The theoretical framework supports the extension of rough set theory into fuzzy environments with consistent relational operations.
• The results provide a basis for further research in fuzzy rough logic, decision-making, and information systems using relational models.