Abstract
In this paper, a new class for data classification in rough set theory is defined as an overlap of successor classes. This kind of rough approximation is proposed via fuzzy soft relations. Depending on the class of fuzzy soft relation, this paper defines the upper and lower rough approximations of a soft set. At this point, the fundamental of rough soft sets and definable soft sets is proposed. Then, some related theories are proved. In the aftermath, the notion of accuracy and roughness measures of soft sets in terms of rough set theory is studied combined with the concept of distance measures.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
1 Introduction
For a given non-empty universal set \(V\) and an equivalence relation \(E\) on \(V,\) a pair \((V,E)\) is denoted as a Pawlak’s approximation space, and \(\left[ v \right]_E\) is denoted as an equivalence class of \(v \in V\) induced by \(E.\) Now, let \((V,E)\) be a given Pawlak’s approximation space and let \(X\) be a subset of \(V.\) The set
is said to be an upper approximation of \(X\) within \((V,E).\) The set
is said to be a lower approximation of \(X\) within \((V,E).\) A difference \(\overline{E}(X) - \underline E (X)\) is said to be a boundary region of \(X\) within \((V,E).\) Three sets are obtained the following interpretation.
-
The upper approximation \(\overline{E}(X)\) of \(X\) contains all objects which possibly belong to \(X.\) At this point, a complement of \(\overline{E}(X)\) is said to be a negative region of \(X\) within \((V,E).\)
-
The lower approximation \(\underline E (X)\) of \(X\) consists of all objects which surely belong to \(X.\) In this way, such the set is said to be a positive region of \(X\) within \((V,E).\)
-
\(\overline{E}(X) - \underline E (X)\) is a set of all objects, which can be classified neither as \(X\) nor as non-\(X\) using \(E.\)
In what follows, a pair \((\overline{E}(X),\underline E (X))\) is said to be a rough set of \(X\) within \((V,E)\) if \(\overline{E}(X) - \underline E (X)\) is a non-empty set. In this way, \(X\) is said to be a rough set. \(X\) is said to be a definable (or an exact) set within \((V,E)\) if \(\overline{E}(X) - \underline E (X)\) is an empty set.
As mentioned above, it is a classical theory proposed by Pawlak [1] in 1982. Observe that the notion of a Pawlak’s rough set theory is classified by all equivalence classes via an equivalence relation. At this point, it has been extended to arbitrary binary relations and fuzzy relations. In 2019, Prasertpong and Siripitukdet [2] proposed the fundamental of rough sets induced by fuzzy serial relations. It is classified by overlaps of successor classes with respect to level in a closed unit interval under a fuzzy serial relation. This class is defined as follows. Let \(R\) be a fuzzy serial relation from \(V\) to \(W\) and \(\alpha \in [0,1]\) \([0,1]\). For an element \(v \in V,\) the set
is said to be a successor class of \(v\) with respect to \(\alpha\)–level based on \(R.\) For \(v \in V,\)
is called an overlap of the successor class of \(v\) with respect to \(\alpha\)–level based on \(R.\)
As an extension of Zadeh’s fuzzy relations [3], the notion of Zhang’s fuzzy soft relations [4] is a mathematical tool for dealing with uncertainty problems. Then, in this research, an overlap of the successor class is considered in terms of fuzzy soft relations to rough approximations. In Sect. 3, the contributions of the section are as follows.
-
We extend the concept of fuzzy serial relations by the sense of fuzzy soft relations. That is, a fuzzy soft serial relation over two universes is proposed. An overlap of successor classes via fuzzy soft serial relations is defined. Some related properties are investigated.
-
We propose the notion of upper and lower rough approximations of a soft set based on overlaps of successor classes. We introduce the concept of rough soft sets and definable soft sets, and a corresponding example is provided. The relationships between such the softs and fuzzy soft relations are verified.
-
As a novel rough soft set theory of the section, we further study the argument to accuracy and roughness measures of soft sets in terms of Pawlak’s rough set theory. The relationship between a roughness measure and a distance measure is discussed.
In the end, the work is summarized in Sect. 4.
2 Preliminaries
In this section, let us first review some basic concepts which wi/ll be necessary for subsequent sections. Throughout this paper, \(K,V,\) and \(W\) denote non-empty sets.
2.1 Some Basic Notions of Fuzzy Sets
Definition 2.1.1
[5]. \(f\) is said to be a fuzzy subset (or fuzzy set) of \(V\) if it is a function from \(V\) to the closed unit interval \([0,1].\) In this way, \(FP(V)\) is denoted as a collection of all fuzzy subsets of \(V.\)
Definition 2.1.2
[5]. Let \(f\) and \(g\) be fuzzy subsets of \(V.\) \(f \prec g\) is denoted by meaning \(f(v) \le g(v)\) for all \(v \in V.\)
Definition 2.1.3
[3]. An element in \(FP(V \times W)\) is said to be a fuzzy relation from \(V\) to \(W.\) An element in \(FP(V \times V)\) is a fuzzy relation on \(V\) if \(W\) is replaced by \(V.\) Given a fuzzy relation \(R\) from \(V\) to \(W\) and \(v \in V,w \in W,\) the value \(R(v,w)\) in \([0,1]\) is the membership grade of the relation between \(v\) and \(w\) based on \(R.\) If \(R\) is a given fuzzy relation from \(V\) to \(W,\) where \(V = \left\{ {v_1 ,v_2 ,v_3 , \ldots ,v_p } \right\}\) and \(W = \left\{ {w_1 ,w_2 ,w_3 , \ldots ,w_q } \right\},\) then every membership grade under \(R\) is represented by the \(p \times q\) matrix form as
Definition 2.1.4
[6]. Let \(R \in FP(V \times W).\) \(R\) is said to be a fuzzy serial relation if for all \(v \in V,\) there exists \(w \in W\) such that \(R(v,w) = 1.\)
Definition 2.1.5
[3]. Let \(R \in FP(V \times V).\)
-
(1)
\(R\) is said to be a fuzzy reflexive relation if \(R(v,v) = 1\) for all \(v \in V.\)
-
(2)
\(R\) is said to be a fuzzy transitive relation if it satisfies \(R(v_1 ,v_2 ) = \sup_{v \in V} (R(v_1 ,v) \wedge R(v,v_2 ))\) for all \(v_1 ,v_2 \in V.\)
-
(3)
\(R\) is said to be a fuzzy symmetric relation if \(R(v_1 ,v_2 ) = R(v_2 ,v_1 )\) for all \(v_1 ,v_2 \in V.\)
-
(4)
\(R\) is said to be a fuzzy equivalence relation if it is a fuzzy reflexive relation, a fuzzy transitive relation, and a fuzzy symmetric relation.
Definition 2.1.6
[7]. Let \(R \in FP(V \times V).\) \(R\) is said to be a fuzzy antisymmetric relation if for all \(v_1 ,v_2 \in V,R(v_1 ,v_2 ) > 0\) and \(R(v_2 ,v_1 ) > 0\) imply \(v_1 = v_2 .\)
2.2 Some Basic Notions of Soft Sets and Fuzzy Soft Relations
Definition 2.2.1
[8]. Throughout this work, \(P(V)\) denotes a power set of \(V.\) Let \(A\) be a non-empty subset of \(K.\) If \(F\) is a mapping from \(A\) to \(P(V),\) then \((F,A)\) is said to be a soft set over \(V\) with respect to \(A.\) As the understanding of the soft set, \(V\) is said to be a universe of all alternative objects of \((F,A),\) and \(K\) is said to be a set of all parameters of \((F,A),\) where the parameter is an attribute, a characteristic or a statement of the alternative object of \(V.\) For any element \(a \in A,\) \(F(a)\) is considered as a set of \(a\)-approximate elements (or \(a\)-alternative objects) of \((F,A).\)
Definition 2.2.2
[9]. Let \(A\) be a non-empty subset of \(K.\)
-
(1)
A relative null soft set over \(V\) with respect to \(A\) is denoted by \({\mathcal{N}}_{\emptyset_A } : = (\emptyset_A ,A)\), where \(\emptyset_A\) is a set valued-mapping given by \(\emptyset_A (a) = \emptyset\) for all \(a \in A.\)
-
(2)
For a soft set \({\mathscr{F}}: = (F,A)\) over \(V\) with respect to \(A,\) a support of \({\mathscr{F}}\) is denoted by \(Supp({\mathcal{F}),}\) where \(Supp({\mathcal{F})}: = \left\{ {a \in A:F(a) \ne \emptyset } \right\}.\)
-
(3)
A relative whole soft set over \(V\) with respect to \(A\) is denoted by \({\mathcal{V}}_{V_A } : = (V_A ,A)\), where \(V_A\) is a set valued-mapping given by \(V_A (a) = V\) for all \(a \in A.\)
Definition 2.2.3
[9]. Let \({\mathscr{F}}: = (F,A)\) and \({\mathcal{G}}: = (G,B)\) be two soft sets over a common alternative universe with respect to non-empty subsets \(A\) and \(B\) of \(K,\) respectively. \({\mathscr{F}}\) is a soft subset of \({\mathcal{G}}\) if \(A \subseteq B\) and \(F(a) \subseteq G(a)\) for all \(a \in A.\) We denote by \({\mathcal{F} \Subset \mathcal{G}}.\)
Definition 2.2.4
[9]. Let \({\mathscr{F}}: = (F,A)\) and \({\mathcal{G}}: = (G,B)\) be two soft sets over a common alternative universe with respect to non-empty subsets \(A\) and \(B\) of \(K,\) respectively.
-
(1)
A restricted intersection of \({\mathscr{F}}\) and \({\mathcal{G}},\) denoted by \({\mathscr{F}} \cap_r {\mathcal{G}}\) is defined as a soft set \((H,C),\) where \(C = A \cap B\) and \(H(c) = F(c) \cap G(c)\) for all \(c \in C.\)
-
(2)
A restricted union of \({\mathscr{F}}\) and \({\mathcal{G}},\) denoted by \({\mathscr{F}} \cup_r {\mathcal{G}}\) is defined as a soft set \((H,C),\) where \(C = A \cap B\) and \(H(c) = F(c) \cup G(c)\) for all \(c \in C.\)
-
(3)
An extended intersection of \({\mathscr{F}}\) and \({\mathcal{G}},\) denoted by \({\mathscr{F}} \cap_e {\mathcal{G}}\) is defined as a soft set \((H,C),\) where \(C = A \cup B\) and \(H\left( c \right) = \left\{ \begin{gathered} F\left( c \right)\,\,\,\,\,\,\,\,\,if\,\,\,\,c \in A - B \hfill \\ G\left( c \right)\,\,\,\,\,\,\,\,\,if\,\,\,\,c \in B - A \hfill \\ F\left( c \right) \cap G(c)\,\,\,\,\,\,\,\,\,if\,\,\,\,c \in A \cap B \hfill \\ \end{gathered} \right.\) for all \(c \in C.\)
-
(4)
An extended union of \({\mathscr{F}}\) and \({\mathcal{G}},\) denoted by \({\mathscr{F}} \cup_e {\mathcal{G}}\) is defined as a soft set \((H,C),\) where \(C = A \cup B\) and \(H\left( c \right) = \left\{ \begin{gathered} F\left( c \right)\,\,\,\,\,\,\,\,\,if\,\,\,\,c \in A - B \hfill \\ G\left( c \right)\,\,\,\,\,\,\,\,\,if\,\,\,\,c \in B - A \hfill \\ F\left( c \right) \cup G(c)\,\,\,\,\,\,\,\,\,if\,\,\,\,c \in A \cap B \hfill \\ \end{gathered} \right.\) for all \(c \in C.\)
-
(5)
A restricted difference of \({\mathscr{F}}\) and \({\mathcal{G}},\) denoted by \({\mathscr{F}} -_r {\mathcal{G}}\) is defined as a soft set \((H,C),\) where \(C = A \cap B\) and \(H(c) = F(c) - G(c)\) for all \(c \in C.\)
Definition 2.2.5
[10]. Let \(A\) be a non-empty subset of \(K.\) If \(F\) is a mapping from \(A\) to \(FP(V),\) then \((F,A)\) is said to be a fuzzy soft set over \(V\) with respect to \(A.\)
Definition 2.2.6
[10]. Let \({\mathscr{F}}: = (F,A)\) and \({\mathscr{F}}: = (G,B)\) be two fuzzy soft sets over a common alternative universe with respect to non-empty subsets \(A\) and \(B\) of \(K,\) respectively. \({\mathscr{F}}\) is a fuzzy soft subset of \({\mathcal{G}}\) if \(A \subseteq B\) and \(F(a) \prec G(a)\) for all \(a \in A.\)
Definition 2.2.7
[4]. Let \(A\) be a non-empty subset of \(K.\) If \(F\) is a mapping from \(A\) to \(FP(V \times W),\) then \((F,A)\) is said to be a fuzzy soft relation over \(V \times W.\)
Definition 2.2.8
[4]. Let \(A\) be a non-empty subset of \(K,\) and let \({\mathcal{R}}: = (R,A)\) be a fuzzy soft relation over \(V \times V.\)
-
(1)
\({\mathcal{R}}\) is called a fuzzy soft reflexive relation if \(R(a)\) is a fuzzy reflexive relation for all \(a \in A.\)
-
(2)
\({\mathcal{R}}\) is called a fuzzy soft transitive relation if \(R(a)\) is a fuzzy transitive relation for all \(a \in A.\)
-
(3)
\({\mathcal{R}}\) is called a fuzzy soft symmetric relation if \(R(a)\) is a fuzzy symmetric relation for all \(a \in A.\)
-
(4)
\({\mathcal{R}}\) is called a fuzzy soft equivalence relation if it is a fuzzy soft reflexive relation, a fuzzy soft transitive relation, and a fuzzy soft symmetric relation.
3 Main Results
In this section, we propose the concept of a successor class and an overlap of the successor classes based on fuzzy soft relations. The related theories are verified. Then, upper and lower rough approximations of a soft set are proposed under the classification of all overlaps of the successor classes. Of course, the notion of rough soft set is defined. A corresponding example is provided. Furthermore, the measurement issue is discussed via rough set theory.
Throughout this section, the set \(A\) and \(B\) denote two non-empty subsets of \(V.\)
3.1 Overlaps of Successor Classes via Fuzzy Soft Relations
In this subsection, we construct a new class for rough approximations of a soft set. Such the class is called the overlaps of successor classes based on fuzzy soft relations.
Definition 3.1.1
Let \({\mathcal{R}}: = (R,A)\) be a fuzzy soft relation over \(V \times W\) and \(\alpha \in [0,1].\) For an element \(v \in V,\) the set
is called a successor class of \(v\) with respect to \(\alpha\)–level based on \({\mathcal{R}}\). We denote by \(\left[ V \right]_{{\mathcal{R}},\,\alpha }^S\) the collection of \(\left[ v \right]_{{\mathcal{R}},\,\alpha }^S\) for all \(v \in V.\)
Example 3.1.1
Let \(V = \left\{ {v_i \in {\mathbb{R}}:i \in {\mathbb{N}},\,\,1 \le i \le 6} \right\}\) and \(W = \left\{ {w_i \in {\mathbb{R}}:i \in {\mathbb{N}}{, }1 \le i \le 5} \right\}.\) We define a fuzzy relation \(\theta \in FP(V \times W)\) by the matrix representation as
Suppose that \({\mathcal{R}}: = (R,A)\) is a fuzzy soft relation over \(V \times W\) defined by \(R(a) = \theta\) for all \(a \in A.\) Then, the successor class of each element in \(V\) with respect to \(0.5\)–level based on \(R\) is presented by
\(\left[ {v_4 } \right]_{{\mathcal{R}}\,,\,0.5}^S = \left\{ {w_2 } \right\},\) \(\left[ {v_5 } \right]_{{\mathcal{R}}\,,\,0.5}^S = \left\{ {w_2 } \right\},\) and \(\left[ {v_6 } \right]_{{\mathcal{R}}\,,\,0.5}^S = \left\{ {w_5 } \right\}.\) This is a corresponding example of Definition 3.1.1.
Definition 3.1.2
Let \({\mathcal{R}}: = (R,A)\) be a fuzzy soft relation over \(V \times W.\) \({\mathcal{R}}\) is called a fuzzy soft serial relation if \(R(a)\) is a fuzzy serial relation for all \(a \in A.\)
Remark 3.1.1
A fuzzy soft serial relation over \(V \times V\) is a generalization concept of a fuzzy soft reflexive relation over \(V \times V.\)
Proposition 3.1.1
If \({\mathcal{R}}: = (R,A)\) is a fuzzy soft serial relation over \(V \times W\) and \(\alpha \in [0,1],\) then \(\left[ v \right]_{{\mathcal{R}},\,\alpha }^S \ne \emptyset\) for all \(v \in V.\)
Proof.
Assume that \({\mathcal{R}}\) is a fuzzy soft serial relation over \(V \times W\) and \(\alpha \in [0,1].\) Now, we let \(v \in V.\) Then, there exists \(w \in W\) such that
for all \(a \in A.\) Therefore \(w \in \left[ v \right]_{{\mathcal{R}},\,\alpha }^S .\) It follows that \(\left[ v \right]_{{\mathcal{R}},\,\alpha }^S \ne \emptyset .\)
Definition 3.1.3
Let \({\mathcal{R}}: = (R,A)\) be a fuzzy soft serial relation over \(V \times W\) and \(\alpha \in [0,1].\) For an element \(v \in V,\) the set
is called an overlap of successor class of \(v\) with respect to \(\alpha\)–level based on \({\mathcal{R}}\) We shall denote by \(\left[ V \right]_{{\mathcal{R}},\,\alpha }^{OS}\) the collection of \(\left[ v \right]_{{\mathcal{R}},\,\alpha }^{OS}\) for all \(v \in V.\)
Example 3.1.2
Based on Example 3.1.1, we observe that
\(\left[ {v_4 } \right]_{{\mathcal{R}},0.5}^{OS} = \left\{ {v_4 ,v_5 } \right\},\) \(\left[ {v_5 } \right]_{{\mathcal{R}},0.5}^{OS} = \left\{ {v_4 ,v_5 } \right\},\) and \(\left[ {v_6 } \right]_{{\mathcal{R}},0.5}^{OS} = \left\{ {v_6 } \right\}.\) Observe that it is a corresponding example of Definition 3.1.3.
Proposition 3.1.2
If \({\mathcal{R}}: = (R,A)\) is a fuzzy soft serial relation over \(V \times W\) and \(\alpha \in [0,1],\) then \(v \in \left[ v \right]_{{\mathcal{R}},\,\alpha }^{OS}\) for all \(v \in V.\)
Proof.
Suppose that \({\mathcal{R}}\) is a fuzzy soft serial relation over \(V \times W\) and \(\alpha \in [0,1].\) Then, by Proposition 3.1.1, we have \(\left[ v \right]_{{\mathcal{R}},\alpha }^S \ne \emptyset\) for all \(v \in V.\) Let \(v \in V.\) Then \(\left[ v \right]_{{\mathcal{R}},\alpha }^S \cap \left[ v \right]_{{\mathcal{R}}\,\alpha }^S \ne \emptyset .\) This implies that \(v \in \left[ v \right]_{{\mathcal{R}},\alpha }^{OS} .\)
Proposition 3.1.3
Let \({\mathcal{R}}: = (R,A)\) be a fuzzy soft serial relation over \(V \times V\) and \(\alpha \in [0,1].\) If \({\mathcal{R}}\) is a fuzzy soft reflexive relation, then \(\left[ v \right]_{{\mathcal{R}},\alpha }^S \subseteq \left[ v \right]_{{\mathcal{R}},\alpha }^{OS}\) for all \(v \in V.\)
Proof.
Suppose that \({\mathcal{R}}\) is a fuzzy soft reflexive relation and \(v \in V.\) Assume that \(v^{\prime} \in \left[ v \right]_{{\mathcal{R}},\alpha }^S .\) Then, we get that \(v^{\prime} \in V.\) Thus \(R(a)(v^{\prime},v^{\prime}) = 1 \ge \alpha\) for all \(a \in A.\) Whence \(v^{\prime} \in \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^S .\) Hence \(\left[ v \right]_{{\mathcal{R}},\alpha }^S \cap \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^S \ne \emptyset .\) Then \(v^{\prime} \in \left[ v \right]_{{\mathcal{R}},\alpha }^{OS} .\) It follows that \(\left[ v \right]_{{\mathcal{R}},\alpha }^S \subseteq \left[ v \right]_{{\mathcal{R}},\alpha }^{OS} .\)
Proposition 3.1.4
If \({\mathcal{R}}: = (R,A)\) is a fuzzy soft equivalence relation over \(V \times V\) and \(\alpha \in [0,1],\) then \(\left[ v \right]_{{\mathcal{R}},\alpha }^S\) and \(\left[ v \right]_{{\mathcal{R}},\alpha }^{OS}\) are identical for all \(v \in V.\)
Proof.
By Proposition 3.1.3, we obtain that \(\left[ v \right]_{{\mathcal{R}},\alpha }^S\) is a subset of \(\left[ v \right]_{{\mathcal{R}},\alpha }^{OS}\) for all \(v \in V.\) Let \(v \in V\) be given. Suppose that \(v^{\prime} \in \left[ v \right]_{{\mathcal{R}},\alpha }^{OS} .\) Then \(\left[ v \right]_{R,\alpha }^S \cap \left[ {v^{\prime}} \right]_{R,\alpha }^S \ne \emptyset .\) Thus, there exists \(v^{\prime \prime} \in V\) such that \(v^{\prime \prime} \in \left[ v \right]_{{\mathcal{R}},\alpha }^S \cap \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^S .\) It is true that \(R(a)(v,v^{\prime \prime}) \ge \alpha\) and \(R(a)(v^{\prime},v^{\prime \prime}) \ge \alpha\) for all \(a \in A.\) Since \({\mathcal{R}}\) is a fuzzy soft symmetric relation, we have \(R(a)(v^{\prime \prime},v^{\prime}) \ge \alpha\) for all \(a \in A.\) Since \({\mathcal{R}}\) is a fuzzy soft transitive relation, we get that
for all \(a \in A.\) Hence \(v^{\prime} \in \left[ v \right]_{{\mathcal{R}},\alpha }^S .\) Thus \(\left[ v \right]_{{\mathcal{R}},\alpha }^{OS} \subseteq \left[ v \right]_{{\mathcal{R}},\alpha }^S .\) Hence \(\left[ v \right]_{{\mathcal{R}},\alpha }^S = \left[ v \right]_{{\mathcal{R}},\alpha }^{OS} .\)
Next, we shall introduce the notion of fuzzy soft antisymmetric relations in terms of fuzzy soft relations on a single universe.
Definition 3.1.4
Let \({\mathcal{R}}: = (R,A)\) be a fuzzy soft relation over \(V \times V.\) \({\mathcal{R}}\) is called a fuzzy soft antisymmetric relation if \(R(a)\) is a fuzzy antisymmetric relation for all \(a \in A.\)
Example 3.1.3
Let \(V = \left\{ {v_i \in {\mathbb{R}}:i \in {\mathbb{N}}\,\,{\text{and}}\,\,1 \le i \le 6} \right\}.\) Suppose that \(\theta \in FP(V \times V)\) is a fuzzy relation defined by the square matrix representation as.
Assume that \({\mathcal{R}}: = (R,A)\) is a fuzzy soft relation over \(V \times V\) defined by \(R(a) = \theta\) for all \(a \in A.\) Then, it is easy to check that \({\mathcal{R}}\) is a fuzzy soft antisymmetric relation over \(V \times V.\) In fact, for all \(a \in A,v,v^{\prime} \in V,R(a)(v,v^{\prime}) > 0\) and \(R(a)(v^{\prime},v) > 0\) imply \(v = v^{\prime}.\) This is a corresponding example of Definition 3.1.4.
Proposition 3.1.5
Let \({\mathcal{R}}: = (R,A)\) be a fuzzy soft serial relation over \(V \times V\) and \(\alpha \in (0,1].\) If \(\left[ V \right]_{R,\,\alpha }^S\) is the partition of \(V\) and \({\mathcal{R}}\) is a fuzzy soft reflexive relation and a fuzzy soft antisymmetric relation over \(V \times V,\) then the following statements are equivalent.
-
(1)
\(v = v^{\prime}\) for all \(v,v^{\prime} \in V.\)
-
(2)
\(\left[ v \right]_{{\mathcal{R}},\alpha }^{OS} = \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^{OS}\) for all \(v,v^{\prime} \in V.\)
-
(3)
\(v \in \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^{OS}\) for all \(v,v^{\prime} \in V.\)
Proof.
It is clear that (1) implies (2). According to Proposition 3.3, we obtain that (2) implies (3). In order to prove that (3) implies (1), we let \(v,v^{\prime} \in V\) be such that \(v \in \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^{OS} .\) Then \(\left[ v \right]_{{\mathcal{R}},\alpha }^S \cap \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^S \ne \emptyset .\) Hence \(\left[ v \right]_{{\mathcal{R}},\alpha }^S = \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^S .\) Since \({\mathcal{R}}\) is a fuzzy soft reflexive relation, it is easy to prove that \(v \in \left[ v \right]_{{\mathcal{R}},\alpha }^S\) and \(v^{\prime} \in \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^S .\) Thus \(v \in \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^S\) and \(v^{\prime} \in \left[ v \right]_{{\mathcal{R}},\alpha }^S .\) Therefore \(R(a)(v^{\prime},v) \ge \,\alpha > 0\) and \(R(a)(v,v^{\prime}) \ge \,\alpha > 0\) for all \(a \in A.\) As \({\mathcal{R}}\) is a fuzzy soft antisymmetric relation, we obtain that \(v = v^{\prime}.\)
3.2 Rough Soft Sets Based on Overlaps of Successor Classes
As rough set theory based on a non-partition classification, in this subsection, the foundation of roughness of soft sets induced by all overlaps of successor classes is proposed via fuzzy soft relations. This concept is generated by upper and lower rough approximations. That is, it is constructed by two distinct classes classified by all overlaps of successor classes. Then, some related properties are investigated under the novel notion.
Definition 3.2.1
If \(\alpha \in [0,1]\) and \({\mathcal{R}}: = (R,K)\) is a fuzzy soft relation over \(V \times W\) related to \(\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} ,\) then \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} )\) is called an approximation space based on \(\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} .\)
Definition 3.2.2
Let \((V,W,\left[ V \right]_{{\mathcal{R}}: = (R,K),\,\alpha }^{OS} )\) be a given approximation space, and let \({\mathscr{F}}: = (F,A)\) be a soft set over \(V.\) An upper rough approximation of \({\mathscr{F}}\) within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} )\) is denoted by \(\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} : = (\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} ,A),\) where
for all \(a \in A.\) A lower rough approximation of \({\mathscr{F}}\) within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} )\) denoted by \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} : = (\left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} ,A),\) where
for all \(a \in A.\) A boundary region of \({\mathscr{F}}\) within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} )\) is denoted by \(\left. {\mathscr{F}} \right]_{{\mathcal{R}},\alpha }^{OS} : = (\left. F \right]_{{\mathcal{R}},\alpha }^{OS} ,A),\) where
As introduced above, such sets are obtained the following interpretation.
-
(1)
\(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a)\) is a set of all elements, which can be possibly classified as \(F(a)\) using \({\mathcal{R}}\) (are possibly in view of \({\mathcal{R}}\)) for all \(a \in A.\) In this way, a complement of \(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a)\) is said to be a negative region of \(F(a)\) within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} )\) for all \(a \in A.\)
-
(2)
\(\left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a)\) is a set of all elements, which can be certain classified as \(F(a)\) using \({\mathcal{R}}\) (are certainly \(F(a)\) in view of \({\mathcal{R}}\)) for all \(a \in A.\) In this way, such the set is said to be a positive region of \(F(a)\) within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} )\) for all \(a \in A.\)
-
(3)
\(\left. F \right]_{{\mathcal{R}},\alpha }^{OS} (a)\) is a set of all elements, which can be classified neither as \(F(a)\) nor as non-\(F(a)\) using \({\mathcal{R}}\) for all \(a \in A.\)
As introduced above, for all \(a \in A,\) if \(\left. F \right]_{{\mathcal{R}},\alpha }^{OS} (a) \ne \emptyset ,\) then \((\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a),\left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a))\) is called a rough (or an inexact) set of \(F(a)\) within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} )\) and we call \(F(a)\) a rough set. For all \(a \in A,\) if \(\left. F \right]_{{\mathcal{R}},\alpha }^{OS} (a) = \emptyset ,\) then \(F(a)\) is called a definable (or an exact) set within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} ).\) The soft set \({\mathscr{F}}\) is called a definable soft set within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} )\) if \(\left. {\mathscr{F}} \right]_{{\mathcal{R}},\alpha }^{OS} = {\mathcal{N}}_{\emptyset_A }\); otherwise \({\mathscr{F}}\) is called a rough soft set within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} ).\)
In the following, we shall introduce a corresponding example of Definition 3.2.2.
Example 3.2.1
Define an approximation space \((V,W,\left[ V \right]_{{\mathcal{R}}: = (R,K),\,0.5}^{OS} )\) based on the data from Example 3.1.1, where \({\mathcal{R}}: = (R,K) = (R,A).\) Suppose that \({\mathscr{F}}: = (F,A)\) is a soft set over \(V\) defined by.
for all \(a \in A.\) Then, by Example 3.1.2, it is true that
for all \(a \in A.\) Therefore \({\mathscr{F}}\) is a rough soft set within \((V,W,\left[ V \right]_{{\mathcal{R}},0.5}^{OS} ).\) Observe that upper and lower approximations are necessary for approximated soft sets. In addition, negative and positive regions exist in \((V,W,\left[ V \right]_{{\mathcal{R}}: = (R,K),\,0.5}^{OS} )\).
Remark 3.2.1
Let \((V,W,\left[ V \right]_{{\mathcal{R}}: = (R,K),\,\alpha }^{OS} )\) be a given approximation space, and let \({\mathscr{F}}: = (F,A)\) be a soft set over \(V.\) Then, it is easy to see that \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset \mathcal{F} \Subset }\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\) This is a relationship between upper and lower approximations in general.
The following three results are a straightforward consequence of Definition 3.2.2.
Proposition 3.2.1
Let \((V,W,\left[ V \right]_{{\mathcal{R}}: = (R,K),\,\alpha }^{OS} )\) be a given approximation space. If \({\mathscr{F}}: = (F,A)\) is a soft set over \(V,\) then we have the following statements.
-
(1)
If \({\mathscr{F}} = {\mathcal{V}}_{V_A } ,\) then \({\mathscr{F}}\) is equal to \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS}\) and \(\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\) Moreover, \({\mathscr{F}}\) is a definable soft set within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} ).\)
-
(2)
If \({\mathscr{F}} = {\mathcal{N}}_{\emptyset_A } ,\) then \({\mathscr{F}}\) is equal to \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS}\) and \(\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\) Moreover, \({\mathscr{F}}\) is a definable soft set within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} ).\)
Proposition 3.2.2
Let \((V,W,\left[ V \right]_{{\mathcal{R}}: = (R,K),\,\alpha }^{OS} )\) be a given approximation space, and let \({\mathscr{F}}: = (F,A)\) and \({\mathcal{G}}: = (G,B)\) be soft sets over \(V.\) Then, we have the following statements.
-
(1)
\(\left. {\overline {\, {{\mathscr{F}} \cup_r {\mathcal{G}}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} = \left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathscr{F}},\alpha }^{OS} \cup_r \left. {\overline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\)
-
(2)
\(\left. {\overline {\, {{\mathscr{F}} \cup_e {\mathcal{G}}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} = \left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \cup_e \left. {\overline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\)
-
(3)
\(\left. {\underline {\, {{\mathscr{F}} \cap_r {\mathcal{G}}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} = \left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \cap_r \left. {\underline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\)
-
(4)
\(\left. {\underline {\, {{\mathscr{F}} \cap_e {\mathcal{G}}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} = \left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \cap_e \left. {\underline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\)
-
(5)
\(\left. {\overline {\, {{\mathscr{F}} \cap_r {\mathcal{G}}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset }\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \cap_r \left. {\overline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\)
-
(6)
\(\left. {\overline {\, {{\mathscr{F}} \cap_e {\mathcal{G}}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset }\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \cap_e \left. {\overline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\)
-
(7)
\(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \cup_r \left. {\underline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset }\left. {\underline {\, {{\mathscr{F}} \cup_r G} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\)
-
(8)
\(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \cup_e \left. {\underline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset }\left. {\underline {\, {{\mathscr{F}} \cup_e {\mathcal{G}}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\)
Proposition 3.2.3
Let \((V,W,\left[ V \right]_{{\mathcal{R}}: = (R,K),\,\alpha }^{OS} )\) be a given approximation space, and let \({\mathscr{F}}: = (F,A)\) and \({\mathcal{G}}: = (G,B)\) be soft sets over \(V.\) If \({\mathcal{F} \Subset \mathcal{G}},\) then \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset }\left. {\underline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS}\) and \(\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset }\left. {\overline {\, {\mathcal{G}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\)
Proposition 3.2.4
Let \((V,W,\left[ V \right]_{{\mathcal{R}}\,: = (R,K),\,\alpha }^{OS} )\) and let \((V,W,\left[ V \right]_{{\mathcal{S}}\,: = \,(S,K),\,\beta }^{OS} )\) be given two approximation spaces with property that \({\mathcal{R} \Subset \mathcal{S}}\) and that \(\alpha \ge \beta .\) If \({\mathscr{F}}: = (F,A)\) is a soft set over \(V,\) then \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{S}}\,,\,\beta }^{OS} \rm{ \Subset }\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS}\) and \(\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset }\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{S}},\beta }^{OS} .\)
Proof.
Suppose that \({\mathscr{F}}\) is a soft set over \(V.\) We shall show that \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{S}},\beta }^{OS} \rm{ \Subset }\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\) Let \(a \in A\) be given. Suppose \(v \in \left. {\underline {\, F \,}}\! \right|_{{\mathcal{S}},\beta }^{OS} (a).\) Then \(\left[ v \right]_{{\mathcal{S}},\beta }^{OS} \subseteq F(a).\) Now, we must to prove that \(\left[ v \right]_{{\mathcal{R}},\alpha }^{OS} \subseteq \left[ v \right]_{{\mathcal{S}},\beta }^{OS} .\) Assume that \(v^{\prime} \in \left[ v \right]_{{\mathcal{R}},\,\alpha }^{OS} .\) Then \(\left[ v \right]_{{\mathcal{R}}\,\alpha }^S \cap \left[ {v^{\prime}} \right]_{{\mathcal{R}}\,\alpha }^S \ne \emptyset .\) There exists \(v^{\prime \prime} \in V\) such that \(v^{\prime \prime} \in \left[ v \right]_{{\mathcal{R}},\alpha }^S \cap \left[ {v^{\prime}} \right]_{{\mathcal{R}},\alpha }^S .\) Whence \(R(k)(v,v^{\prime \prime}) \ge \alpha\) and \(R(k)(v^{\prime},v^{\prime \prime}) \ge \alpha\) for all \(k \in K.\) From the hypothesis, we get that.
and
for all \(k \in K.\) It follows that \(v^{\prime \prime} \in \left[ v \right]_{{\mathcal{S}},\beta }^S \cap \left[ {v^{\prime}} \right]_{{\mathcal{S}},\beta }^S .\) Then \(\left[ v \right]_{{\mathcal{S}},\beta }^S \cap \left[ {v^{\prime}} \right]_{{\mathcal{S}},\beta }^S \ne \emptyset .\) Thus \(v^{\prime} \in \left[ v \right]_{{\mathcal{S}},\beta }^{OS} .\) Hence \(\left[ v \right]_{{\mathcal{R}},\alpha }^{OS} \subseteq \left[ v \right]_{{\mathcal{S}},\beta }^{OS} \subseteq F(a).\) Therefore \(v \in \left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a).\) Thus \(\left. {\underline {\, F \,}}\! \right|_{{\mathcal{S}},\beta }^{OS} (a) \subseteq \left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a).\) This implies that \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{S}},\beta }^{OS} \rm{ \Subset }\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\,\alpha }^{OS} .\) The remain argument is straightforward, so we omit it.
Proposition 3.2.5
Let \((V,V,\left[ V \right]_{{\mathcal{R}}\, = \,(R,K),\,\alpha }^{OS} )\) be a given approximation space with property that \(\alpha \in (0,1],\) \(\left[ V \right]_{{\mathcal{R}},\alpha }^S\) is the partition of \(V,\) and \({\mathcal{R}}\) is a fuzzy soft reflexive relation and a fuzzy soft antisymmetric relation. If \({\mathscr{F}}: = (F,A)\) is a soft set over \(V,\) then \({\mathscr{F}}\) is a definable soft set within \((V,W,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} ).\)
Proof.
Assume that \({\mathscr{F}}\) is a soft set over V. Then, by Remark 3.2.1, we obtain that \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset }\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\) Let \(a \in A.\) Suppose that \(v \in \left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}}\,,\,\alpha }^{OS} (a).\) Then \(\left[ v \right]_{{\mathcal{R}},\,\alpha }^{OS} \cap F(a) \ne \emptyset .\) Thus, there exists \(v^{\prime} \in V\) such that \(v^{\prime} \in \left[ v \right]_{{\mathcal{R}},\,\alpha }^{OS}\) and \(v^{\prime} \in F(a).\) By Proposition 3.1.5, we have \(v = v^{\prime}\). We must prove that \(\left[ v \right]_{{\mathcal{R}},\,\alpha }^{OS} \subseteq F(a).\) Let \(v^{\prime \prime} \in \left[ v \right]_{{\mathcal{R}},\alpha }^{OS} .\) From Proposition 3.1.5, we have \(v = v^{\prime \prime}.\) Hence \(v^{\prime \prime} = v^{\prime} \in F(a),\) which implies that \(\left[ v \right]_{{\mathcal{R}},\alpha }^{OS} \subseteq F(a).\) Therefore \(v \in \left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a).\) Thus, it is true that \(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a) \subseteq \left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a).\) It follows that \(\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} \rm{ \Subset }\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\) Thus \(\left. {\underline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS}\) is equal to \(\left. {\overline {\, {\mathscr{F}} \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} .\) Consequently, \({\mathscr{F}}\) is a definable soft set within \((V,V,\left[ V \right]_{{\mathcal{R}},\alpha }^{OS} ).\)
3.3 Measurement Issues
In this subsection, we shall study to accuracy and roughness measures of soft sets in terms of Pawlak’s rough set theory [1]. Now, let \(X\) be a subset of \(V.\)
An accuracy measure of \(X\) based on \((V,E),\) denoted by \(X|_E ,\) is defined by
A roughness measure of \(X\) based on \((V,E),\) denoted by \(X||_E ,\) is defined by
In what follows, the concept of rough set theory-based accuracy and roughness measurements via fuzzy soft relation is proposed below.
Definition 3.3.1
Let \((V,W,\left[ V \right]_{{\mathcal{R}}\,: = (R,K),\,\alpha }^{OS} )\) be an approximation space, and let \({\mathscr{F}}: = (F,A)\) be a soft set over \(V.\) For \(a \in A,\) an accuracy measure of \(F(a)\) based on \((V,W,\left[ V \right]_{{\mathcal{R}}\,: = (R,K),\,\alpha }^{OS} ),\) denoted by \(F(a)|_{{\mathcal{R}},\alpha }^{OS} ,\) is defined by
In generality, observe that \(F(a)|_{{\mathcal{R}},\alpha }^{OS} \in [0,1]\) for all \(a \in A\). Then, for all \(a \in A,\) a roughness measure of \(F(a)\) based on \((V,W,\left[ V \right]_{{\mathcal{R}}\,: = (R,K),\,\alpha }^{OS} ),\) denoted by \(F(a)||_{{\mathcal{R}}\,,\,\alpha }^{OS} ,\) is defined by
Example 3.3.1
Based on Example 3.2.1, we compute that
and
for all \(a \in A,\) i.e., the accuracy measure of \(F(a)\) is 0.2 and the roughness measure of \(F(a)\) is 0.8 for all \(a \in A.\)
Proposition 3.3.1
Let \((V,W,\left[ V \right]_{{\mathcal{R}}: = \,(R,K),\,\alpha }^{OS} )\) and Let \((V,V,\left[ V \right]_{{\mathcal{S}}: = \,(S,K),\,\beta }^{OS} )\) be given two approximation spaces with property that \({\mathcal{R} \Subset \mathcal{S}}\) and that \(\alpha \ge \beta .\) If \({\mathscr{F}}: = (F,A)\) is a soft set over \(V,\) then \(F(a)|_{{\mathcal{R}},\alpha }^{OS} \ge F(a)|_{{\mathcal{S}},\beta }^{OS}\) for all \(a \in Supp({\mathscr{F}}).\)
Proof.
Suppose that \({\mathscr{F}}: = (F,A)\) is a soft set over \(V\) and \(a \in Supp({\mathscr{F}}).\) Then, by Remark 3.2.1, we have \(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}},\alpha }^{OS} (a) \ne \emptyset .\) From Proposition 3.2.4, it follows that
Now
Proposition 3.3.2
\((V,V,\left[ V \right]_{{\mathcal{R}}: = \,(R,K),\,\alpha }^{OS} )\) be a given approximation space with property that \(\alpha \in (0,1],\) \(\left[ V \right]_{{\mathcal{R}}\,\alpha }^S\) is the partition of \(V,\) and \({\mathcal{R}}\) is a fuzzy soft reflexive relation and a fuzzy soft antisymmetric relation. If \({\mathscr{F}}: = (F,A)\) is a soft set over \(V,\) then \(F(a)|_{{\mathcal{R}}\,,\,\alpha }^{OS} = 1\) for all \(a \in Supp({\mathscr{F}}).\) Furthermore, \(F(a)||_{{\mathcal{R}},\alpha }^{OS} = 0\) for all \(a \in Supp({\mathscr{F}}).\)
Proof.
Suppose that \({\mathscr{F}}: = (F,A)\) is a soft set over \(V\) and \(a \in Supp({\mathscr{F}}).\) Then \(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}},\,\alpha }^{OS} (a) \ne \emptyset\) due to Remark 3.2.1. From Proposition 3.2.5, it follows that \(card(\left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}}\,,\,\alpha }^{OS} (a)) = card(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}}\,,\,\alpha }^{OS} (a)).\) Thus \(F(a)|_{{\mathcal{R}},\alpha }^{OS} : = \frac{{card(\left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}},\,\alpha }^{OS} (a))}}{{card(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}},\,\alpha }^{OS} (a))}} = 1.\) It is true that \(F(a)||_{{\mathcal{R}},\alpha }^{OS} : = 1 - F(a)|_{{\mathcal{R}},\alpha }^{OS} = 1 - 1 = 0.\)
In the following, we further consider the fact related to the distance measurement of Marczewski and Steinhaus [11]. Let \(X\) and \(Y\) be given subsets of \(V.\) The distance measure of \(X\) and \(Y\) is defined as follows.
A symmetric difference between \(X\) and \(Y,\) denoted by \(X\vartriangle Y,\) is defined by
A distance measure of \(X\) and \(Y,\) denoted by \(DM(X,Y),\) is defined by
As mentioned above, we further study the argument under the relationship between distance measures and roughness measures as the following.
Proposition 3.3.3
Let \((V,W,\left[ V \right]_{{\mathcal{R}}: = (R,K),\,\alpha }^{OS} )\) be a given approximation space. If \({\mathscr{F}}: = (F,A)\) is a soft set over \(V,\) then \(DM(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}}\,,\,\alpha }^{OS} (a),\left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}}\,,\,\alpha }^{OS} (a)) = F(a)||_{{\mathcal{R}}\,,\,\alpha }^{OS} .\) For all \(a \in Supp({\mathscr{F}}).\)
Proof.
Suppose that \({\mathscr{F}}: = (F,A)\) is a soft set over \(V\) and \(a \in Supp({\mathcal{F})}\rm{.}\) Then, by Remark 3.2.1, we have \(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}}\,,\,\alpha }^{OS} (a) \ne \emptyset .\) Now
as required.
Example 3.3.2
According to Example 3.2.1, we observe that
Then, we compute that \(DM(\left. {\overline {\, F \,}}\! \right|_{{\mathcal{R}},0.5}^{OS} (a),\left. {\underline {\, F \,}}\! \right|_{{\mathcal{R}},0.5}^{OS} (a)) = F(a)||_{{\mathcal{R}},0.5}^{OS} .\) In fact,
due to Example 3.3.1.
As mentioned above, we observe that the notion of these measurements is related to the novel rough soft set model in the previous subsection. Moreover, we see that the distance measure of upper and lower approximations is a roughness measure. It is exhibited in Example 3.3.2.
4 Conclusions
The concept of fuzzy soft serial relations was defined. Then, an overlap of successor classes was proposed as a new class. We introduced a new rough soft set theory. That is, upper and lower rough approximations of a soft set were provided via all overlaps of successor classes under fuzzy soft serial relations. Then, we got that a soft set is definable if a fuzzy soft relation is reflexive and antisymmetric. Finally, we obtained that a roughness measure and a distance measure are identical.
As the novel rough soft set theory, in the future, we shall further study the notion to deal with decision-making problems.
References
Pawlak, Z.: Rough sets. Int. J. Inf. Comput. Secur. 11, 341–356 (1982)
Prasertpong, R., Siripitukdet, M.: Rough set models induced by serial fuzzy relations approach in semigroups. Eng. Lett. 27, 216–225 (2019)
Zadeh, L.A.: Similarity relations and fuzzy orderings. Inf. Sci. 3, 117–200 (1971)
Zhang, Y.H., Yuan, X.H.: Soft relation and fuzzy soft relation. In: Cao, B.Y., Nasseri, H. (eds) Fuzzy Information & Engineering and Operations Re-search & Management. Advances in Intelligent Systems and Computing, vol 211. Springer, Berlin, Heidelberg (2014)
Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)
Wu, W.Z., Mi, J.S., Zhang, W.X.: Generalized fuzzy rough sets. Inf. Sci. 151, 263–282 (2003)
Chakraborty, M.K., Sarkar, S.: Fuzzy antisymmetry and order. Fuzzy Sets Syst. 21, 169–182 (1987)
Molodtsov, D.: Soft set theory-first results. Comput. Math. Appl. 37, 19–31 (1999)
Ali, M.I., Feng, F., Liu, X.Y., Min, W.K., Shabir, M.: On some new operations in soft set theory. Comput. Math. Appl. 57, 1547–1553 (2009)
Maji, P.K., Biswas, R., Roy, A.R.: Fuzzy soft sets. Journal of Fuzzy Mathematics 9, 589–602 (2001)
Marczewski, E., Steinhaus, H.: On a certain distance of sets and the corresponding distance of functions. Colloq. Math. 6, 319–327 (1958)
Acknowledgments
We would like to thank the editor-in-chief and reviewers for their helpful suggestions. We would like to thank supporter organizations like Division of Mathematics and Statistics, Faculty of Science and Technology, Nakhon Sawan Rajabhat University, Thailand. We would also like to thank supporter organizations like Fuzzy Algebras and Decision-Making Problems Research Unit, Department of Mathematics, School of Science, University of Phayao, Thailand.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Iampan, A., Prasertpong, R. (2022). Fuzzy Soft Relations-Based Rough Soft Sets Classified by Overlaps of Successor Classes with Measurement Issues. In: Surinta, O., Kam Fung Yuen, K. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2022. Lecture Notes in Computer Science(), vol 13651. Springer, Cham. https://doi.org/10.1007/978-3-031-20992-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-20992-5_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-20991-8
Online ISBN: 978-3-031-20992-5
eBook Packages: Computer ScienceComputer Science (R0)