Next Article in Journal
Insect Fluctuating Asymmetry: An Example in Bolivian Peridomestic Populations of Triatoma infestans (Klug, 1834) (Hemiptera: Reduviidae)
Previous Article in Journal
Investigation of the Drag-Reduction Phenomenon on Plasma-Modified Surface
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Linear Diophantine Fuzzy Rough Sets: A New Rough Set Approach with Decision Making

1
Department of Mathematics, Quaid-i-Azam University, Islamabad 45320, Pakistan
2
Department of Mathematics, University of the Punjab, Lahore 54590, Pakistan
3
Military Academy, University of Defence in Belgrade, 11000 Belgrade, Serbia
4
Faculty of Mechanical Engineering, University of Nis, 18000 Nis, Serbia
5
Faculty of Mechanical Engineering and Transport Systems, TU Berlin, 10623 Berlin, Germany
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(3), 525; https://doi.org/10.3390/sym14030525
Submission received: 24 January 2022 / Revised: 11 February 2022 / Accepted: 23 February 2022 / Published: 4 March 2022
(This article belongs to the Section Mathematics)

Abstract

:
In this article, a new hybrid model named linear Diophantine fuzzy rough set (LDFRS) is proposed to magnify the notion of rough set (RS) and linear Diophantine fuzzy set (LDFS). Concerning the proposed model of LDFRS, it is more efficient to discuss the fuzziness and roughness in terms of linear Diophantine fuzzy approximation spaces (LDFA spaces); it plays a vital role in information analysis, data analysis, and computational intelligence. The concept of ( < p , p > , < q , q > ) -indiscernibility of a linear Diophantine fuzzy relation (LDF relation) is used for the construction of an LDFRS. Certain properties of LDFA spaces are explored and related results are developed. Moreover, a decision-making technique is developed for modeling uncertainties in decision-making (DM) problems and a practical application of fuzziness and roughness of the proposed model is established for medical diagnosis.

1. Introduction

Due to the growing interest in the development of computational intelligence techniques, classical set theory has been generalized to many beneficial theories and models. Some of the worthwhile set theoretic models are fuzzy sets (FSs) [1], intuitionistic fuzzy sets (IFSs) [2,3], bipolar fuzzy sets (BFSs) [4], rough sets (RSs) [5,6], soft sets (SSs) [7], etc. In 1965, Zadeh [1] introduced the conceptualization of FSs, one of the most successful extensions among the above-mentioned theories. FSs assign grades to all objects of the universal set which lie in the unit interval [ 0 , 1 ] on the basis of their characteristics, instead of only { 0 , 1 } as in classical set theory. In other words, the elements may have the property of belonging partially to the universal set. For example, we cannot segregate all the patients into two specific classes, i.e., either somebody is ill or not, because an individual’s illness may not be at its earliest or extreme level. In FS theory, an individual who is nauseated could have a degree of illness near to 0.889. In contrast, if somebody has a degree of illness 0.124, this intimates that he has nearly recovered from poor health. Since 1965, FSs have been studied extensively by various authors and innovative mathematical extensions have been developed such as m-polar fuzzy set (mFS) [8], Pythagorean fuzzy set (PFS) [9,10], orthopair fuzzy set (OFS) [11], q-rung orthopair fuzzy set (q-ROFS) [12], and Pythagorean m-polar fuzzy set (PmFS) [13,14].
One of the most recent and an important generalization of FS is LDFS, originated by Riaz and Hashmi [15] in 2019. LDFS is the most convenient mathematical model concerning modeling vagueness in real-life complications. LDFS removes all the restrictions related to the association and non-alignment grades of the prevailing concepts as mentioned above, by the adoption of corresponding control parameters. For DM, multi-attribute decision-making (MADM), engineering, artificial intelligence (AI) and the medical sort, LDFS is the most suitable mathematical structure, where the decision makers have freedom to assign membership grades (MGs) and non-membership grades (NMGs) [15]. Nowadays, LDFSs involve a massive number of vibrant researchers and the study of this paradigm is growing rapidly. Some of the remarkable applications of LDFSs concerning algebraic structures, soft rough sets model, binary relations, and q-linear Diophantine fuzzy are found in [16,17,18].
The binary relation performance is quite influential in distinctive fields of pure and applied sciences. In 1971, Zadeh [19] established the conception of a fuzzy relation (F relation). F relations are very useful for modeling situations, where interactions among various objects are more or less strong. FSs and F relations have voluminous applications in pure and applied sciences. A particular study on FSs and F relations is presented by Wang et al. in [20]. In 1983, Atanassov [21] proposed the idea of intuitionistic fuzzy relation (IF relation) by promulgating the constraint that the sum of association and disassociation grades should not be greater than 1. Recently, Ayub et al. [22], proposed a beautiful extension of the IF relation, named linear Diophantine fuzzy relation (LDF relation), with a robust application in decision-making, by the influence of the novel concepts of LDFSs. Hashmi et al. [23] suggested the conceptualization of m-polar neutrosophic topology with applications to MADM.
Pawlak in 1982 put forward an approach of rough set (RS) in order to cope with the vagueness and incompleteness in information systems. RS theory is also a development of classical set theory, where the objects are analyzed by means of lower and upper approximation spaces. These approximation spaces revealed the obscured awareness in the information system. In RS theory, it is assumed that we have some additional enlightenment about the features of a set. Let us clarify this notion with an example. In the current pandemic situation, we consider a group of some patients of corona virus. In order to investigate corona, one must see its disparate symptoms, for instance, fever, dry cough, tiredness, sore throat, loss of taste or smell, difficulty breathing. Patients exhibiting similar symptoms are equivalent with respect to the available knowledge and form elementary granules of data. RS theory has successful applications to computer sciences, cognitive sciences, artificial intelligence, machine learning, conflict analysis and data analysis.
Since RS theory has been developed, many robust generalizations of RS have been established in various directions. For instance, binary relations [24,25], tolerance relations [26], similarity relations [27], soft binary relations [28,29], soft equivalence relations [30], set valued maps [31], two equivalence relations [32], normal soft group [33], etc. Recently, Shiekh et al. [34] proposed the solution of matrix games with rough interval pay-offs and its application in the telecom market share problem. Shiekh et al. [35] suggested an alternative approach for solving fuzzy matrix games. Ruidas et al. [36] developed a production-repairing inventory model considering demand and the proportion of defective items as rough intervals. They developed two independent models by using the rough interval. The first model concerned demand of the product and the second model concerned both the demand and the defective rate. In the information systems, where attribute values are not numerical, an excessive number of vibrant mathematicians investigated hybridization of FSs and RSs. Cock et al. [37] proposed an innovative model of fuzzy rough sets and developed some forgotten step of roughness. Maji and Garai [38] introduced the notion of IT2 fuzzy rough sets and max-relevance significance criterion with application to attribute selection. Mahmood et al. [39] proposed the lower and upper approximations in quotient groups and homomorphisms between lower and upper approximations. Mahmood et al. [40] studied group homomorphism-based comparison between lower and upper approximations. Tsang et al. [41] developed a new attribute reduction approach based on fuzzy rough sets. Yao et al. [42] introduced a novel variable precision ( θ , σ ) -fuzzy rough set approach towards fuzzy granules and granular computing. Dubois and H. Prade et al. [43] introduced novel concepts of fuzzy rough sets and rough fuzzy sets. They unveiled a constructive approach, where the approximations are constructed by means of an F relation to be more useful, from an application point of view. Akram et al. [44] suggested a novel hybrid decision-making approach based on intuitionistic fuzzy N-soft rough sets. Shabir and Shaheen [45] explored a new technique to fuzzify a RS when the objects are discernible up to a certain degree α . To deal with uncertainty and bipolarity as well in many situations, Malik and Shabir [46] produced fuzzy bipolar soft sets (FBSSs) with utilization in DM. In [47], Gul and Shabir introduced a new idea of roughness of a crisp set based on ( α , β ) -indiscernibilty of a bipolar fuzzy relation (BF relation).
Shabir et al. [48] proposed a new approach to discuss roughness and soft rough sets. Ayub et al. [49] developed some applications of roughness in soft-intersection groups and their approximation spaces. Chen et al. [50] suggested a study of roughness in modules of fractions. Zhang et al. [51] introduced novel classes of fuzzy soft β -covering-based fuzzy rough sets with applications to MCDM. They developed some results for two different fuzzy soft β -coverings having the same upper (lower) approximation operators. Ouyang et al. [52] developed tolerance relations for fuzzy rough sets and developed certain interesting results. Sun and Ma [53] suggested a model for fuzzy rough set with applications towards two different universes. Yang and Li [54] introduced the bipolar fuzzy rough set model with applications to two different universes.
Feng et al. [55,56] proposed novel concepts of soft rough set, soft set, and rough sets to analyze certain characteristics of information systems. Zhang et al. [57,58] introduced the notion of the IFS-rough set and interval-valued hesitant fuzzy rough approximation operators. Zhou and Wu [59] developed certain properties of rough set approximations in Atanassov IFS theory. Zhan and Alcantud [60] proposed an algorithm survey of parameter reduction of soft sets. Hussain et al. [61,62] proposed Pythagorean fuzzy soft rough sets, q-Rung orthopair fuzzy soft average aggregation operators and their applications in decision-making. Pamucar [63] proposed a normalized weighted geometric Dombi Bonferroni mean operator with interval grey numbers with application in MCDM. Ali et al. [64] developed Einstein geometric aggregation operators using a novel complex interval-valued Pythagorean fuzzy setting with application in green supplier chain management. Božanic [65] discussed a hybrid LBWA-IR-MAIRCA multi-criteria decision-making model for determination of constructive elements of weapons. Agarwal et al.’s [66] study involved a parametric analysis of a grinding process using the rough sets theory.
Let ϝ be the universe of discourse. Let μ , ν : ϝ [ 0 , 1 ] be the membership function (MF) and non-membership function (NMF). Then for any ϝ , the terms μ ( ) and ν ( ) represent the membership grade (MG) and non-membership grade (NMG). The following three different representations of a linear Diophantine fuzzy number (LDFN) were used in [15,16,22,67]
N = ( μ ( ) , ν ( ) ) , ( α ( ) , β ( ) ) = < μ ( ) , ν ( ) > , < α ( ) , β ( ) > = ( μ ( ) , ν ( ) ) , ( α ( ) , β ( ) )
where μ ( ) , ν ( ) , α ( ) , β ( ) [ 0 , 1 ] and
0 α ( ) μ ( ) + β ( ) ν ( ) ) 1
This involves one ordered pair ( μ ( ) , ν ( ) ) containing a pair of MGs and NMGs and a second ordered pair ( α ( ) , β ( ) ) containing reference parameters. A LDFN provides freedom to the decision makers in the selection of MGs and NMGs. Figure 1 and Table 1 demonstrates that the space for LDFNs is broader than the space for IFNs, PFNs and q-ROFNs.
Motivated by robust features of RS and LDFS, this work is mainly concerned with the hybridization of these models. Main objectives of this paper are as follows.
  • The main objective of this article is to magnify the notion of LDFS and RS for intelligent information processing. The proposed model of LDFRS provides a broader space for the selection of membership and non-membership grades than existing models (FS, IFS, BFS, q-ROFS), to discuss fuzziness and roughness in terms of LDFA spaces. LDFRSs provide freedom to decision makers for assigning membership grades (MGs) and non-membership grades (NMGs).
  • The idea of the LDF relation with the addition of control parameters is more efficient for roughness approximation than the existing F relation, IF relation, and BF relation.
  • In this paper, we aim to produce an advanced technique for approximation of roughness of a crisp set by using an LDF relation from a universe to another universe based on ( < p , p > , < q , q > ) -indiscernible objects, that is, the components which do not have completely the same attributes. However, they are similar up to certain degrees p , q , p and q (say) and involve the fuzziness of the information system if the attribute values are linguistic. Using the above concepts, approximation spaces are then formalized, for approximating the subsets of two universes.
  • The abstractions of linear Diophantine fuzzy approximation spaces (LDFA spaces) are defined and related results are explored. Concerning the proposed model of LDFRS, it is more efficient to discuss the fuzziness and roughness in terms of LDFA spaces; it plays a vital role in information analysis and decision analysis.
  • Moreover, a decision-making technique is developed for modeling uncertainties in decision-making (DM) problems and a practical application of fuzziness and roughness of proposed model is established for medical diagnosis.
For smooth study of this article, the remainder has the following pattern: In Section 2, a reflection of preliminary abstractions of the RS, LDFS and LDF relation are presented. In Section 3, the concept of Linear diophantine fuzzified rough set (LDFRS) is proposed by employing ( < p , p > , < q , q > ) -indiscernibility. Some remarkable results related to LDFRS are proved with useful examples. Section 4 presents the intuitions of accuracy measure and roughness measure for ( < p , p > , < q , q > LDFRS. Section 5 presents a utilization of LDFRSs in medical diagnosis with a comparison of Yang et al.’s [54] method. Finally, Section 6 consists of the culmination of this article.

2. Preliminaries

In this subdivision, the ground rules of LDFS, LDF relation and RS are recalled, which are indispensable for the construction of a new hybrid model called Linear Diophantine fuzzy rough set (LDFRS). Throughout this article, ϝ , ϝ 1 and ϝ 2 will be signified as the universes, unless expressed as something else.
Definition 1
([6]).Let E be an equivalence relation on ϝ. Then, the pair ( ϝ , E ) is known as an approximation space (A space). For any subset W of ϝ, the lower approximation W ̲ E and the upper approximation W ¯ E are described as follows:
W ̲ E = { ϝ : [ ] E W } a n d W ¯ E = { ϝ : [ ] E W }
where [ ] E represents the equivalence class of ϝ determined by E. The boundary region is represented and expressed as below:
B R ( W ) = W ¯ E W ̲ E
If B R ( W ) , then W is called a rough set; otherwise it is crisp or definable. Note that:
W ̲ E is known as a positive region of W, which contains the definite members;
ϝ W ¯ E is known as a negative region of W, which contains the definite non-members;
B R ( W ) contains doubtful members of W, which may or may not contain the members of W.
Definition 2
([15]).An LDFS on ϝ is an object specified as bellow:
Ω D = ( , < μ ( ) , ν ( ) > , < α ( ) , β ( ) > ) : ϝ
where
μ , ν : ϝ [ 0 , 1 ]
are membership and non-membership functions and α ( ) , β ( ) [ 0 , 1 ] are the reference/control parameters of μ ( ) , ν ( ) , respectively,with 0 α ( ) μ ( ) + β ( ) ν ( ) 1 and 0 α ( ) + β ( ) 1 for all ϝ . The dubiety part is prescribed as Ψ D ( ) Λ D ( ) = 1 ( α ( ) μ ( ) + β ( ) ν ( ) ) , where Ψ D ( ) is known to be the degree of indeterminacy of ℏ to Ω D and Λ D ( ) is the reference parameter related to the degree of indeterminacy. A number of the form ( < μ ( ) , ν ( ) > , < α ( ) , β ( ) > ) is called linear Diophantine fuzzy number (LDFN).
Recently, Ayub et al. [22] extended the notion of IF relation [21] to LDF relation by making use of reference parameters corresponding to the membership and non-membership grades in the stimulation of Riaz and Hashmi [15].
Definition 3
([22]).An LDF relation R from ϝ 1 to ϝ 2 is an expression of the following form:
R = { ( ( 1 , 2 ) , < μ R ( 1 , 2 ) , ν R ( 1 , 2 ) > , < α ( 1 , 2 ) , β ( 1 , 2 ) > ) : 1 ϝ 1 , 2 ϝ 2 }
where the mappings
μ R , ν R : ϝ 1 × ϝ 2 [ 0 , 1 ]
denote the affiliation and non-membership F relations from ϝ 1 to ϝ 2 , respectively, and α ( 1 , 2 ) , β ( 1 , 2 ) [ 0 , 1 ] are the reference parameters corresponding to μ R ( 1 , 2 ) and ν R ( 1 , 2 ) , respectively. These affiliation and non-membership F relations obey the constraint 0 α ( 1 , 2 ) μ R ( 1 , 2 ) + β ( 1 , 2 ) ν R ( 1 , 2 ) 1 , for all ( 1 , 2 ) ϝ 1 × ϝ 2 with 0 α ( 1 , 2 ) + β ( 1 , 2 ) 1 . The hesitation part is described as follows:
( 1 , 2 ) ( 1 , 2 ) = 1 ( α ( 1 , 2 ) μ R ( 1 , 2 ) + β ( 1 , 2 ) ν R ( 1 , 2 ) )
where ( 1 , 2 ) is an index (a degree) of hesitation whether 1 and 2 are in the relation R or not and ( 1 , 2 ) is the reference parameter of degree of hesitation. For simplicity, we shall use R = ( < μ R ( 1 , 2 ) , ν R ( 1 , 2 ) > , < α ( 1 , 2 ) , β ( 1 , 2 ) > ) for an LDF relation from ϝ 1 to ϝ 2 . We shall represent the set of all LDF relations from ϝ 1 to ϝ 2 by LDFR ( ϝ 1 × ϝ 2 ) .
In the case of finite universes ϝ 1 and ϝ 2 , the matrix notation of an LDF relation is described below.
Definition 4
([22]).Let R = ( < μ R ( i , j ) , ν R ( i , j ) > , < α ( i , j ) , β ( i , j ) > ) be an LDF relation from ϝ 1 to ϝ 2 , where ϝ 1 = { 1 , 2 , . . . , m } and ϝ 2 = { 1 , 2 , . . . , n } . Consider μ R ( i , j ) = ( ð i j ) m × n , ν R ( i , j ) = ( ð i j ) m × n and α ( i , j ) = ( i j ) m × n , β ( i , j ) = ( i j ) m × n , with 0 i j + i j 1 and 0 i j ð i j + i j ð i j 1 for all i , j , where 1 i m and 1 j n . Then, an LDF relation R can be symbolized in the following four matrices:
μ R = ( ð i j ) m × n = ð 11 ð 12 . . . ð 1 n ð 21 ð 22 . . . ð 2 n . . . . . . . . . . . . . . . . . . ð m 1 ð m 2 . . . ð m n ,   ν R = ( ð i j ) m × n = ð 11 ð 12 . . . ð 1 n ð 21 ð 22 . . . ð 2 n . . . . . . . . . . . . . . . . . . ð m 1 ð m 2 . . . ð m n
and
α = ( i j ) m × n = 11 12 . . . 1 n 21 22 . . . 2 n . . . . . . . . . . . . . . . . . . m 1 m 2 . . . m n ,   β = ( i j ) m × n = 11 12 . . . 1 n 21 22 . . . 2 n . . . . . . . . . . . . . . . . . . m 1 m 2 . . . m n
Some fundamental operations on LDF relations are described as follows.
Definition 5
([22]).Let R 1 = ( < ϑ R 1 M ( 1 , 2 ) , ϑ R 1 N ( 1 , 2 ) > , < α 1 ( 1 , 2 ) , β 1 ( 1 , 2 ) > ) and R 2 = ( < ϑ R 2 M ( 1 , 2 ) , ϑ R 2 N ( 1 , 2 ) > , < α 2 ( 1 , 2 ) , β 2 ( 1 , 2 ) > ) be two LDF relations from ϝ 1 to ϝ 2 . Then,
(1) 
R 1 R 2 if and only if
μ R 1 ( 1 , 2 ) μ R 2 ( 1 , 2 ) a n d ϑ R 1 N ( 1 , 2 ) ϑ R 2 N ( 1 , 2 ) ,
α 1 ( 1 , 2 ) α 2 ( 1 , 2 ) a n d β 1 ( 1 , 2 ) β 2 ( 1 , 2 )
for all ( 1 , 2 ) ϝ 1 × ϝ 2 .
(2) 
R 1 R 2 = ( < ( μ R 1 μ R 2 ) ( 1 , 2 ) , ( ϑ R 1 N ϑ R 2 N ) ( 1 , 2 ) > ,
< α 1 ( 1 , 2 ) α 2 ( 1 , 2 ) , β 1 ( 1 , 2 ) β 2 ( 1 , 2 ) > ) , where
( μ R 1 μ R 2 ) ( 1 , 2 ) = μ R 1 ( 1 , 2 ) μ R 2 ( 1 , 2 ) a n d
( ϑ R 1 N ϑ R 2 N ) ( 1 , 2 ) = ϑ R 1 N ( 1 , 2 ) ϑ R 2 N ( 1 , 2 )
for all ( 1 , 2 ) ϝ 1 × ϝ 2 .
(3) 
R 1 R 2 = ( < ( μ R 1 μ R 2 ) ( 1 , 2 ) , ( ϑ R 1 N ϑ R 2 N ) ( 1 , 2 ) > ,
< α 1 ( 1 , 2 ) α 2 ( 1 , 2 ) , β 1 ( 1 , 2 ) β 2 ( 1 , 2 ) > ) , where
( μ R 1 μ R 2 ) ( 1 , 2 ) = μ R 1 ( 1 , 2 ) μ R 2 ( 1 , 2 ) a n d
( ϑ R 1 N ϑ R 2 N ) ( 1 , 2 ) = ϑ R 1 N ( 1 , 2 ) ϑ R 2 N ( 1 , 2 )
for all ( 1 , 2 ) ϝ 1 × ϝ 2 .
(4) 
R 1 c = ( < ϑ R 1 N ( 1 , 2 ) , μ R 1 ( 1 , 2 ) > , < β 1 ( 1 , 2 ) , α 1 ( 1 , 2 ) > ) .
Definition 6
([22]).Let R be an LDF relation on ϝ. Then, R is known as a reflexive LDF relation, if:
μ R ( , ) = 1 , ν R ( , ) = 0 a n d α ( , ) = 1 , β ( , ) = 0
for all ϝ .
In the case of finite ϝ , R = ( < ( ð i j ) n × n , ( ð i j ) n × n > , < ( i j ) n × n , ( i j ) n × n > ) . Then, R is reflexive, if
i i = ð i i = 1 , and i i = ð i i = 0 , where i , j = 1 , 2 , . . . , n .
Now, we shall define the ( < p , p > , < q , q > ) -level cut relation of R according to the encouragement of Riaz et al. [16].
Definition 7.
Let R = { ( ( 1 , 2 ) , < μ R ( 1 , 2 ) , ν R ( 1 , 2 ) > , < α ( 1 , 2 ) , β ( 1 , 2 ) > ) : 1 ϝ 1 , 2 ϝ 2 } be an LDF relation from ϝ 1 to ϝ 2 . For any constants p , q , p , q [ 0 , 1 ] such that 0 p q + p q 1 with 0 p + q 1 , define the ( < p , p > , < q , q > ) -level cut relation of R as follows:
R < p , p > < q , q >
= { ( 1 , 2 ) ϝ 1 × ϝ 2 : μ R ( 1 , 2 ) p , α ( 1 , 2 ) p , ν R ( 1 , 2 ) q , β ( 1 , 2 ) q }
where,
R < p , p > = { ( 1 , 2 ) ϝ 1 × ϝ 2 : μ R ( 1 , 2 ) p , α ( 1 , 2 ) p }
is said to be the < p , p > -level cut relation of R, and
R < q , q > = { ( 1 , 2 ) ϝ 1 × ϝ 2 : ν R ( 1 , 2 ) q , β ( 1 , 2 ) q }
is called the < q , q > -level cut relation of R.
Next, we define the indiscernibility criteria of the objects in the case of the LDF relation.
Definition 8.
Let R = ( < μ R ( 1 , 2 ) , ν R ( 1 , 2 ) > , < α ( 1 , 2 ) , β ( 1 , 2 ) > ) be an LDF relation from ϝ 1 to ϝ 2 and p , p ( 0 , 1 ] , q , q [ 0 , 1 ) . Then, the objects 1 ϝ 1 and 2 ϝ 2 are said to be ( < p , p > , < q , q > ) -indiscernible, if:
μ R ( 1 , 2 ) p , α ( 1 , 2 ) p a n d ν R ( 1 , 2 ) q , β ( 1 , 2 ) q .
which means that the objects 1 ϝ 1 and 2 ϝ 2 are related up to a relational degree p and its parametric degree p and non-relational degree q and the corresponding parametric degree q , respectively.
If R LDF ( ϝ 1 × ϝ 2 ) , then the triplet ✠ = ( ϝ 1 , ϝ 2 , R ) is called a linear diophantine fuzzified approximation space (LDFA space).

3. Linear Diophantine Rough Approximations for ( < p , p > , < q , q > )-Indiscernible Objects

In [45], Shabir and Shaheen initiated the conception of rough approximations of a set based on the α -indiscernibility of a compatible (reflexive and symmetric) F relation. More recent, this notion was extended by Gul and Shabir in [47] by using a compatible BF relation on a universe. In this section, we extend these models to a more general concept of LDFRS with the help of an LDF relation [22] without any extra condition on two variant universes. For this objective, the notions of linear Diophantine fuzzified approximation spaces (LDFA spaces) for any subsets W of ϝ 1 and J of ϝ 2 are defined by employing an LDF relation R from ϝ 1 to ϝ 2 . Some structural properties related to these LDFA spaces are studied in detail; however, some of the properties are not satisfied in the absence of these extra conditions. We shall discuss all these with illustrative examples.
Definition 9.
Let = ( ϝ 1 , ϝ 2 , R ) be LDFA space. For p , p ( 0 , 1 ] and q , q [ 0 , 1 ) , define the < p , p > -lower, -upper and < q , q > -lower, -upper LDFA spaces of any subset J ϝ 2 as follows:
R ( J ) ̲ < p , p > = { 1 ϝ 1 : ϑ R M ( 1 , 2 ) < p , α ( 1 , 2 ) < p , for all 2 J c }
R ( J ) ¯ < p , p > = { 1 ϝ 1 : ϑ R M ( 1 , 2 ) p , α ( 1 , 2 ) p , for some 2 J }
R ( J ) ̲ < q , q > = { 1 ϝ 1 : ϑ R N ( 1 , 2 ) q , β ( 1 , 2 ) q , for some 2 J }
R ( J ) ¯ < q , q > = { 1 ϝ 1 : ϑ R N ( 1 , 2 ) > q , β ( 1 , 2 ) > q , for all 2 J c }
Further, for any subset W ϝ 1 , define < p , p > -lower, -upper and < p , q > -lower, -upper LDFA spaces as follows:
( W ) R ̲ < p , p > = { 2 ϝ 2 : ϑ R M ( 1 , 2 ) < p , α ( 1 , 2 ) < p , for all 1 W c }
( W ) R ¯ < p , p > = { 2 ϝ 2 : ϑ R M ( 1 , 2 ) p , α ( 1 , 2 ) p , for some 1 W }
( W ) R ̲ < q , q > = { 2 ϝ 2 : ϑ R N ( 1 , 2 ) q , β ( 1 , 2 ) q , for some 1 W }
( W ) R ¯ < q , q > = { 2 ϝ 2 : ϑ R N ( 1 , 2 ) > q , β ( 1 , 2 ) > q , for all 1 W c }
Note that all the LDFA spaces defined above for J ϝ 2 are the crisp subsets of ϝ 1 and for W ϝ 1 the LDFA spaces are the crisp subsets of ϝ 2 . Moreover, in Definition 9, for any subset W ϝ 1 ,
( W ) R ¯ < p , p > = { 2 ϝ 2 : ϑ R M ( 1 , 2 ) < p , α ( 1 , 2 ) < p , for all 1 W c } = { 2 ϝ 2 : ( ϑ R M ) T ( 2 , 1 ) < p , ( α ) T ( 2 , 1 ) < p , for all 1 W c }
where T denotes the transpose of the matrices μ R and α . Similarly, we can calculate ( W ) R ¯ < q , q > , ( W ) R ̲ < q , q > and ( W ) R ¯ < q , q > .
In the sequel of this manuscript, ✠ = ( ϝ 1 , ϝ 2 , R ) is supposed to be an LDFA space.
Definition 10.
With the same notion as in Definition 9, suppose J ϝ 2 and W ϝ 1 . Then, we define the following four pairs:
L D F ̲ ( J ) = ( R ( J ) ̲ < p , p > , R ( J ) ̲ < q , q > )
L D F ¯ ( J ) = ( R ( J ) ¯ < p , p > , R ( J ) ¯ < q , q > )
( W ) L D F ̲ = ( ( W ) R ̲ < p , p > , ( W ) R ̲ < q , q > ) ,
( W ) L D F ̲ = ( ( W ) R ¯ < p , p > , ( W ) R ¯ < q , q > )
are known as ( < p , p > , < q , q > ) -LDF approximations of J and W, respectively, with respect to ✠. Moreover, the following sets are then defined:
(1) 
L D F P ( J ) = ( R ( J ) ̲ < p , p > , R ( J ) ¯ < q , q > ) ,
(2) 
L D F N ( J ) = ϝ 2 L D F ¯ ( J ) = ( ( R ( J ) ¯ < p , p > ) c , ( R ( J ) ̲ < q , q > ) c ) ,
(3) 
L D F B ( J ) = L D F ¯ ( J ) L D F ̲ ( J ) = ( R ( J ) ¯ < p , p > R ( J ) ̲ < p , p > , R ( J ) ̲ < q , q > R ( J ) ¯ < q , q > ) .
These are known as positive, negative and boundary parts of J ϝ 2 . Similar notions can be defined for W ϝ 1 .
From Definition 9, we deduce the following result.
Lemma 1.
With the same notations as in Definition 9, assume that W ϝ 1 and J ϝ 2 . Then,
(1) 
R ( J ) ̲ < p , p > = R ( J ) ̲ p R ( J ) ̲ p .
(2) 
R ( J ) ¯ < p , p > = R ( J ) ¯ p R ( J ) ¯ p .
(3) 
R ( J ) ̲ < q , q > = R ( J ) ̲ q R ( J ) ̲ q .
(4) 
R ( J ) ¯ < q , q > = R ( J ) ¯ q R ( J ) ¯ q .
(5) 
( W ) R ̲ < p , p > = ( W ) R ̲ p ( W ) R ̲ p .
(6) 
( W ) R ¯ < p , p > = ( W ) R ¯ p ( W ) R ¯ p .
(7) 
( W ) R ̲ < q , q > = ( W ) R ̲ q ( W ) R ̲ q .
(8) 
( W ) R ¯ < q , q > = ( W ) R ¯ q ( W ) R ¯ q .
Proof. 
We shall prove only (1). First, we shall define R ( J ) ̲ p and R ( J ) ̲ p .
R ( J ) ̲ p = { 1 ϝ 1 : ϑ R M ( 1 , 2 ) < p , for all 2 J c }
R ( J ) ̲ p = { 1 ϝ 1 : α ( 1 , 2 ) < p , for all 2 J c }
Now, by Definition 9,
R ( J ) ̲ < p , p > = { 1 ϝ 1 : ϑ R M ( 1 , 2 ) < p , α ( 1 , 2 ) < p , for all 2 J c } = { 1 ϝ 1 : ϑ R M ( 1 , 2 ) < p , for all 2 J c } { 1 ϝ 1 : α ( 1 , 2 ) < p , for all 2 J c } = R ( J ) ̲ p R ( J ) ̲ p .
The remaining parts can be proved in a similar way. □
To explain our new concept given in Definition 9, an example is under consideration.
Example 1.
Let ϝ 1 = { c 1 , c 2 , c 3 , c 4 } and ϝ 2 = { c 1 , c 2 , c 3 } . Construct an LDF relation R from ϝ 1 to ϝ 2 in the form of the following matrices:
μ R = 0.75 0.58 0.65 0.56 0.42 0.46 0.68 0.35 0.43 0.41 0.45 0.44 , ν R = 0.70 0.42 0.55 0.88 0.75 0.45 0.54 0.32 0.21 0.46 0.45 0.25 , and
α = 0.50 0.50 0.60 0.45 0.38 0.30 0.54 0.39 0.38 0.50 0.44 0.45 , β = 0.50 0.45 0.40 0.54 0.60 0.56 0.46 0.58 0.54 0.49 0.32 0.35 .
Let J = { c 1 , c 3 } ϝ 2 . Then, for p = 0.58 , p = 0.50 and q = 0.42 , q = 0.45 , ( < 0.58 , 0.50 > , < 0.42 , 0.45 > ) -LDF approximations are given as below:
R ( J ) ̲ < 0.58 , 0.50 > = { c 2 , c 3 , c 4 } , R ( J ) ¯ < 0.58 , 0.50 > = { c 1 , c 3 }
R ( J ) ̲ < 0.42 , 0.45 > = { c 4 } , R ( J ) ¯ < 0.42 , 0.45 > = { c 2 }
Hence, R ( J ) ̲ < 0.58 , 0.50 > R ( J ) ¯ < 0.58 , 0.50 > and R ( J ) ¯ < 0.42 , 0.45 > R ( J ) ̲ < 0.42 , 0.45 > . Now, for a subset W of ϝ 1 , we take first the transpose of the above matrices:
( μ R ) T = 0.75 0.56 0.68 0.41 0.58 0.42 0.35 0.45 0.65 0.46 0.43 0.44 , ( ν R ) T = 0.70 0.88 0.54 0.46 0.42 0.75 0.32 0.45 0.55 0.45 0.21 0.25 , and,
( α ) T = 0.50 0.45 0.54 0.50 0.50 0.38 0.39 0.44 0.60 0.30 0.38 0.45 , ( β ) T = 0.50 0.54 0.46 0.50 0.45 0.60 0.58 0.32 0.40 0.56 0.54 0.35 .
Suppose that W = { c 2 , c 3 , c 4 } . Then, for p = 0.65 , p = 0.50 and q = 0.55 , q = 0.40 , the ( < 0.65 , 0.50 > , < 0.55 , 0.40 > ) -LDF approximations are:
( W ) R ̲ < 0.65 , 0.50 > = { c 2 } , ( W ) R ¯ < 0.65 , 0.50 > = { c 1 }
( W ) R ̲ < 0.55 , 0.40 > = { c 2 , c 3 } , ( W ) R ¯ < 0.55 , 0.40 > = { c 1 }
Thus, ( W ) R ̲ < 0.65 , 0.50 > ( W ) R ¯ < 0.65 , 0.50 > and ( W ) R ¯ < 0.55 , 0.40 > ( W ) R ̲ < 0.55 , 0.40 > .
Further, for ϝ 2 and ϝ 2 , assume that p = 0.58 , p = 0.50 , q = 0.42 , q = 0.45 ; then, the ( < 0.58 , 0.50 > , < 0.42 , 0.45 > ) -LDF approximations are as below:
R ( ) ̲ < 0.58 , 0.50 > = { c 4 } , R ( ) ¯ < 0.58 , 0.50 > = { c 2 } ,
R ( ) ̲ < 0.42 , 0.45 > = { c 2 } , R ( ) ¯ < 0.42 , 0.45 > = { c 4 } ,
R ( ϝ 2 ) ̲ < 0.58 , 0.50 > = { c 1 , c 3 } , R ( ϝ 2 ) ¯ < 0.58 , 0.50 > = { c 1 , c 3 } ,
R ( ϝ 2 ) ̲ < 0.42 , 0.45 > = { c 1 , c 4 } , R ( ϝ 2 ) ¯ < 0.42 , 0.45 > = { c 3 , c 3 } .
Now, for ϝ 1 and ϝ 1 , the ( < 0.58 , 0.50 > , < 0.42 , 0.45 > ) -LDF lower and upper approximations are calculated as follows:
( ) R ̲ < 0.58 , 0.50 > = ϝ 2 , ( ) R ¯ < 0.58 , 0.50 > = ,
( ) R ̲ < 0.42 , 0.45 > = { c 1 } , ( ) R ¯ < 0.42 , 0.45 > = { c 1 } ,
( ϝ 2 ) R ̲ < 0.58 , 0.50 > = , ( ϝ 2 ) R ¯ < 0.58 , 0.50 > = ϝ 2 ,
( ϝ 2 ) R ̲ < 0.42 , 0.45 > = { c 2 , c 3 } , ( ϝ 2 ) R ¯ < 0.42 , 0.45 > = { c 2 , c 3 } .
We note that R ( ) ̲ < p , p > R ( ) ¯ < q , q > , R ( ϝ 2 ) ̲ < p , p > ϝ 1 R ( ϝ 2 ) ¯ < q , q > , ( ) R ̲ < p , p > ( ) R ¯ < q , q > and ( ϝ 1 ) R ̲ < q , q > ϝ 2 ( ϝ 1 ) R ¯ < q , q > for all p , p ( 0 , 1 ] , q , q [ 0 , 1 ) (see the following Proposition 1).
Proposition 1.
Let R be a reflexive LDF relation on ϝ 1 and p , p ( 0 , 1 ] , q , q [ 0 , 1 ) . Then,
(1) 
R ( J 1 ) ̲ < p , p > J 1 R ( J 1 ) ¯ < p , p > .
(2) 
R ( J 1 ) ̲ < q , q > J 1 R ( J 1 ) ¯ < q , q > .
(3) 
R ( ) ̲ < p , p > = = R ( ) ¯ < q , q > .
(4) 
R ( ) ̲ < q , q > = = R ( ) ¯ < q , q > .
(5) 
R ( ϝ 1 ) ̲ < p , p > = ϝ 1 = R ( ϝ 1 ) ¯ < q , q > .
(6) 
R ( ϝ 1 ) ̲ < q , q > = ϝ 1 = R ( ϝ 1 ) ¯ < q , q > .
Proof. 
We shall prove only (1). Others can be proved in a similar manners. First of all, from Definition 9 it is straightforward that:
R ( J 1 ) ̲ < p , p > J 1
Now, let J 1 . Then, μ R ( , ) = 1 p and α ( , ) = 1 p since R is reflexive. This yields that R ( J 1 ) ¯ < p , p > . Thus, J 1 R ( J 1 ) ¯ < p , p > . □
Proposition 2.
Suppose that p 1 , p 2 , p 1 , p 2 ( 0 , 1 ] and q 1 , q 2 , q 1 , q 2 [ 0 , 1 ) such that p 1 p 2 , p 1 p 2 and q 1 q 2 , q 1 q 2 . For any subset J ϝ 2 , the following assertions hold:
(1) 
R ( J ) ̲ < p 1 , p 1 > R ( J ) ̲ < p 2 , p 2 > ,
(2) 
R ( J ) ¯ < p 2 , p 2 > R ( J ) ¯ < p 1 , p 1 > ,
(3) 
R ( J ) ̲ < q 1 , q 1 > R ( J ) ̲ < q 2 , q 2 > ,
(4) 
R ( J ) ¯ < q 2 , q 2 > R ( J ) ¯ < q 1 , q 1 > ,
Proof. 
(1) Let 1 R ( J ) ̲ < p 1 , p 1 > . By Definition 9, μ R ( 1 , 2 ) < p 1 and α ( 1 , 2 ) < p 1 , for all 2 J c . Since p 1 p 2 and p 1 p 2 , therefore μ R ( 1 , 2 ) < p 2 and M ( 1 , 2 ) < p 2 , for all 2 J c . This proves that 1 R ( J ) ̲ < p 2 , p 2 > .
(2) Let 1 R ( J ) ¯ < p 2 , p 2 > . Then, μ R ( 1 , 2 ) p 2 and α ( 1 , 2 ) p 2 , for some 2 J (using Definition 9). However, p 1 p 2 and p 1 p 2 . It follows that μ R ( 1 , 2 ) p 2 p 1 a n d α ( 1 , 2 ) p 2 p 1 . Thus, μ R ( 1 , 2 ) p 1 a n d α ( 1 , 2 ) p 1 for some 2 J . Hence, 1 R ( J ) ¯ < p 1 , p 1 > . (3) and (4) can be proved by using the same methodology as (1) and (2). □
Proposition 3.
With the same assumptions as in Proposition 2, let W ϝ 1 . Then,
(1) 
( W ) R ̲ < p 1 , p 1 > ( W ) R ̲ < p 2 , p 2 > ,
(2) 
( W ) R ¯ < p 2 , p 2 > ( W ) R ¯ < p 1 , p 1 > ,
(3) 
( W ) R ̲ < q 1 , q 1 > ( W ) R ̲ < q 2 , q 2 > ,
(4) 
( W ) R ¯ < q 2 , q 2 > ( W ) R ¯ < q 1 , q 1 > ,
Proof. 
The proof is analogous to the proof of Proposition 2. □
In the following example, it is shown that the inclusions in Proposition 2 may not be replaced with equality.
Example 2.
Let us visit Example 1, where ϝ 1 = { c 1 , c 2 , c 3 , c 4 } and ϝ 2 = { c 1 , c 2 , c 3 } . Considering p 1 = 0.58 , p 1 = 0.50 , q 1 = 0.42 , q 1 = 0.45 , then for J = { c 1 , c 3 } , the ( < 0.58 , 0.50 > , < 0.42 , 0.45 > ) -LDF lower and upper approximations are:
R ( J ) ̲ < 0.58 , 0.50 > = { c 2 , c 3 , c 4 } , R ( J ) ¯ < 0.58 , 0.50 > = { c 1 , c 3 }
R ( J ) ̲ < 0.42 , 0.45 > = { c 4 } , R ( J ) ¯ < 0.42 , 0.45 > = { c 2 }
If p 2 = 0.68 , p 2 = 0.54 and q 2 = 0.54 , q 2 = 0.46 , then by using Definition 9, we have:
R ( J ) ̲ < 0.68 , 0.54 > = ϝ 1 , R ( J ) ¯ < 0.54 , 0.46 > = { c 3 , c 4 }
If p 2 = 0.56 , p 2 = 0.45 and q 2 = 0.88 , q 2 = 0.54 , then
R ( J ) ¯ < 0.56 , 0.45 > = { c 1 , c 2 , c 3 } , R ( J ) ¯ < 0.88 , 0.54 > =
It is clear that p 1 = 0.58 < p 2 = 0.68 and p 1 = 0.50 < p 2 = 0.54 ; then R ( J ) ̲ < 0.68 , 0.54 > R ( J ) ̲ < 0.58 , 0.50 > and p 1 = 0.58 > p 2 = 0.56 and p 1 = 0.50 > p 2 = 0.45 ; then R ( J ) ¯ < 0.58 , 0.50 > R ( J ) ¯ < 0.56 , 0.45 > . Moreover, q 1 = 0.42 < q 2 = 0.54 , q 1 = 0.45 < q 2 = 0.46 ; then R ( J ) ̲ < 0.42 , 0.45 > R ( J ) ̲ < 0.54 , 0.46 > and q 1 = 0.42 < q 2 = 0.88 , q 1 = 0.45 < q 2 = 0.54 ; then R ( J ) ¯ < 0.42 , 0.45 > R ( J ) ¯ < 0.88 , 0.54 > .
Proposition 4.
Let J 1 , J 2 ϝ 2 be such that J 1 J 2 . For p , p ( 0 , 1 ] and q , q [ 0 , 1 ) , the following assertions hold:
(1) 
R ( J 1 ) ̲ < p , p > R ( J 2 ) ̲ < p , p > ,
(2) 
R ( J 1 ) ¯ < p , p > R ( J 2 ) ¯ < p , p > ,
(3) 
R ( J 1 ) ̲ < q , q > R ( J 2 ) ̲ < q , q > ,
(4) 
R ( J 1 ) ¯ < q , q > R ( J 2 ) ¯ < q , q > .
Proof. 
We shall prove only (1) and (2); (3) and (4) can be proved in a similar manner.
(1) Let 1 R ( J 1 ) ̲ < p , p > . Then, μ R ( 1 , 2 ) < p and α ( 1 , 2 ) < p for all 2 J 1 c (see Definition 9). Since J 1 J 2 , we have J 1 c J 2 c . So, particularly, μ R ( 1 , 2 ) < p and α ( 1 , 2 ) < p for all 2 J 2 c . Thus, 1 R ( J 2 ) ̲ < p , p > .
(2) Let 1 R ( J 1 ) ¯ < p , p > . By Definition 9, μ R ( 1 , 2 ) p and α ( 1 , 2 ) p for some 2 J 1 . However, J 1 J 2 , so μ R ( 1 , 2 ) p and α ( 1 , 2 ) p for some 2 J 2 . Consequently, 1 R ( J ) ¯ < p , p > . □
Proposition 5.
Assume the same notations as in Proposition 4; let W 1 , W 2 ϝ 1 be such that W 1 W 2 . Then,
(1) 
( W 1 ) R ̲ < p , p > ( W 2 ) R ̲ < p , p > ,
(2) 
( W 1 ) R ¯ < p , p > ( W 2 ) R ¯ < p , p > ,
(3) 
( W 1 ) R ̲ < q , q > ( W 2 ) R ̲ < q , q > ,
(4) 
( W 1 ) R ¯ < q , q > ( W 2 ) R ¯ < q , q > .
Proof. 
The proof is analogous to the proof of Proposition 4. □
The sign of equality in Proposition 5 may not hold (see Example 3).
Example 3.
Considering Example 1, assume that J 1 = { c 2 } and J 2 = { c 1 , c 2 } . So, J 1 J 2 . For p = 0.58 , p = 0.50 and q = 0.42 and q = 0.45 , we have
R ( J 1 ) ̲ < 0.58 , 0.50 > = { c 2 } , R ( J 2 ) ̲ < 0.58 , 0.50 > = { c 2 , c 3 , c 4 }
R ( J 1 ) ¯ < 0.58 , 0.50 > = { c 2 } , R ( J 2 ) ¯ < 0.58 , 0.50 > = { c 1 , c 3 }
R ( J 1 ) ̲ < 0.42 , 0.45 > = { c 1 } , R ( J 2 ) ̲ < 0.42 , 0.45 > = { c 1 , c 3 }
It is clear that R ( J 2 ) ̲ < 0.58 , 0.50 > R ( J 1 ) ̲ < 0.58 , 0.50 > , R ( J 2 ) ¯ < 0.58 , 0.50 > R ( J 1 ) ¯ < 0.58 , 0.50 > and R ( J 2 ) ̲ < 0.42 , 0.45 > R ( J 1 ) ̲ < 0.42 , 0.45 > .
Proposition 6.
Let R 1 , R 2 LDFR ( ϝ 1 × ϝ 2 ) such that R 1 R 2 , p , p ( 0 , 1 ] and q , q [ 0 , 1 ) . Then, for any J ϝ 2 , the following properties hold:
(1) 
R 2 ( J ) ̲ < p , p > R 1 ( J ) ̲ < p , p > ,
(2) 
R 1 ( J ) ¯ < p , p > R 2 ( J ) ¯ < p , p > ,
(3) 
R 1 ( J ) ̲ < q , q > R 2 ( J ) ̲ < q , q > ,
(4) 
R 2 ( J ) ¯ < q , q > R 1 ( J ) ¯ < q , q > .
Proof. 
(1) Let 1 R 2 ( J ) ̲ < p , p > . Then, by Definition 9, μ R 2 ( 1 , 2 ) < p a n d α 2 ( 1 , 2 ) < p for all 2 J c . Since R 1 R 2 , we have μ R 1 ( 1 , 2 ) ϑ R 2 M ( 1 , 2 ) < p a n d α 1 ( 1 , 2 ) α 2 ( 1 , 2 ) < p for all 2 J c . Thus, μ R 1 ( 1 , 2 ) < p a n d α 1 ( 1 , 2 ) < p for all 2 J c . Hence, 1 R 1 ( J ) ̲ < p , p > .
(2) Suppose 1 R 1 ( J ) ¯ < p , p > . From Definition 9, μ R 1 ( 1 , 2 ) p a n d α 1 ( 1 , 2 ) p for some 2 J . However, R 1 R 2 , so we have
p μ R 1 ( 1 , 2 ) μ R 2 ( 1 , 2 ) a n d p α 1 ( 1 , 2 ) α 2 ( 1 , 2 ) for some 2 J .
Thus, p μ R 2 ( 1 , 2 ) a n d p α 1 ( 1 , 2 ) for some 2 J . Hence, 1 R 2 ( J ) ¯ < p , p > . The proof of (3) and (4) is analogous to (1) and (2). □
Proposition 7.
Assuming the same hypothesis as in Proposition 6, for any W ϝ 1 , we have:
(1) 
( W ) R 2 ̲ < p , p > ( W ) R 1 ̲ < p , p > ,
(2) 
( W ) R 1 ¯ < p , p > ( W ) R 2 ¯ < p , p > ,
(3) 
( W ) R 1 ̲ < q , q > ( W ) R 2 ̲ < q , q > ,
(4) 
( W ) R 2 ¯ < q , q > ( W ) R 1 ¯ < q , q > .
Proof. 
It can be proved analogously as Proposition 6. □
Theorem 1.
Let J 1 , J 2 ϝ 2 and p , p ( 0 , 1 ] . Then, the following assertions hold:
(1) 
R ( J 1 c ) ̲ < p , p > = ( R ( J 1 ) ¯ < p , p > ) c ;
(2) 
R ( J 1 c ) ¯ < p , p > = ( R ( J 1 ) ̲ < p , p > ) c .
(3) 
R ( J 1 J 2 ) ̲ < p , p > = R ( J 1 ) ̲ < p , p > R ( J 2 ) ̲ < p , p > ;
(4) 
R ( J 1 J 2 ) ̲ < p , p > R ( J 1 ) ̲ < p , p > R ( J 2 ) ̲ < p , p > ;
(5) 
R ( J 1 J 2 ) ¯ < p , p > = R ( J 1 ) ¯ < p , p > R ( J 2 ) ¯ < p , p > ;
(6) 
R ( J 1 J 2 ) ¯ < p , p > R ( J 1 ) ¯ < p , p > R ( J 2 ) ¯ < p , p > .
Proof. 
(1) Let 1 R ( J 1 c ) ̲ < p , p > . Then, μ R ( 1 , 2 ) < p a n d α ( 1 , 2 ) < p for all 2 ( J 1 c ) c = J 1 . Thus, μ R ( 1 , 2 ) p and α ( 1 , 2 ) p for all 2 J 1 . This implies that 1 R ( J 1 ) ¯ < p , p > . Therefore, 1 ( R ( J 1 ) ¯ < p , p > ) c . Hence, R ( J 1 c ) ̲ < p , p > ( R ( J 1 ) ¯ < p , p > ) c . The reverse inclusion can be proved by following similar lines.
(2) This proof is analogous to the proof of (1).
Now, to prove (3)–(6), we know that J 1 J 2 J 1 and J 1 J 2 J 2 ; then
R ( J 1 J 2 ) ̲ < p , p > R ( J 1 ) ̲ < p , p > R ( J 2 ) ̲ < p , p > .
R ( J 1 J 2 ) ¯ < p , p > R ( J 1 ) ¯ < p , p > R ( J 2 ) ¯ < p , p >
(see Proposition 4 (1) and (2), respectively). Further, J 1 J 1 J 2 and J 2 J 1 J 2 ; then by using Proposition 4 (3) and (4), respectively, we get:
R ( J 1 J 2 ) ̲ < p , p > R ( J 1 ) ̲ < p , p > R ( J 2 ) ̲ < p , p >
R ( J 1 J 2 ) ¯ < p , p > R ( J 1 ) ¯ < p , p > R ( J 2 ) ¯ < p , p >
To prove the converse of the inclusion 1, assume that 1 R ( J 1 ) ̲ < p , p > R ( J 2 ) ̲ < p , p > . Then, 1 R ( J 1 ) ̲ < p , p > and 1 R ( J 2 ) ̲ < p , p > . Using Definition 9, μ R ( 1 , 2 ) < p , α ( 1 , 2 ) < p for all 2 J 1 c and μ R ( 1 , 3 ) < p , α ( 1 , 3 ) < p for all 3 J 2 c , respectively. Since 2 J 1 c and 3 J 2 c ; then 2 , 3 J 1 c J 2 c = ( J 1 J 2 ) c . This yields that μ R ( 1 , ) < p and α ( 1 , ) < p for all ( J 1 J 2 ) c . Thus, 1 R ( J 1 J 2 ) ̲ < p , p > . Hence,
R ( J 1 ) ̲ < p , p > R ( J 2 ) ̲ < p , p > R ( J 1 J 2 ) ̲ < p , p >
Now, to prove the reverse containment of (4), consider 1 R ( J 1 J 2 ) ¯ < p , p > . By Definition 9, there exists 2 J 1 J 2 such that μ R ( 1 , 2 ) p , α ( 1 , 2 ) p . Thus μ R ( 1 , 2 ) p , α ( 1 , 2 ) p for some 2 W or μ R ( 1 , 2 ) p , α ( 1 , 2 ) p for some 2 W 2 . This proves that 1 R ( J 1 ) ¯ < p , p > R ( J 2 ) ¯ < p , p > . Hence,
R ( J 1 J 2 ) ¯ < p , p > R ( J 1 ) ¯ < p , p > R ( J 2 ) ¯ < p , p > .
This completes the proof. □
Theorem 2.
Suppose that W 1 , W 2 ϝ 2 and p , p ( 0 , 1 ] . Then,
(1) 
( W 1 c ) R ̲ < p , p > = ( ( W 1 ) R ¯ < p , p > ) c ;
(2) 
( W 1 c ) R ¯ < p , p > = ( ( W 1 ) R ̲ < p , p > ) c .
(3) 
( W 1 W 2 ) R ̲ < p , p > = ( W 1 ) R ̲ < p , p > ( W 2 ) R ̲ < p , p > ;
(4) 
( W 1 W 2 ) R ̲ < p , p > ( W 1 ) R ̲ < p , p > ( W 2 ) R ̲ < p , p > ;
(5) 
( W 1 W 2 ) R ¯ < p , p > = ( W 1 ) R ¯ < p , p > ( W 2 ) R ¯ < p , p > ;
(6) 
( W 1 W 2 ) R ¯ < p , p > ( W 1 ) R ¯ < p , p > ( W 2 ) R ¯ < p , p > .
Proof. 
This can be proved by following the same methodology as Theorem 1. □
Theorem 3.
With the same notations as in Theorem 1, let q , q [ 0 , 1 ) . Then,
(1) 
R ( J 1 c ) ̲ < q , q > = ( R ( J 1 ) ¯ < q , q > ) c ;
(2) 
R ( J 1 c ) ¯ < q , q > = ( R ( J 1 ) ̲ < q , q > ) c ;
(3) 
R ( J 1 J 2 ) ̲ < q , q > R ( J 1 ) ̲ < q , q > R ( J 2 ) ̲ < q , q > ;
(4) 
R ( J 1 J 2 ) ̲ < q , q > = R ( J 1 ) ̲ < q , q > R ( J 2 ) ̲ < q , q > ;
(5) 
R ( J 1 J 2 ) ¯ < q , q > R ( J 1 ) ¯ < q , q > R ( J 2 ) ¯ < q , q > ;
(6) 
R ( J 1 J 2 ) ¯ < q , q > = R ( J 1 ) ¯ < q , q > R ( J 2 ) ¯ < q , q > .
Proof. 
This can be proved by using similar arguments as in Theorem 1. □
Theorem 4.
Assume the same notations as in Theorem 2, let q , q [ 0 , 1 ) . Then,
(1) 
( W 1 c ) R ̲ < q , q > = ( ( W 1 ) R ¯ < q , q > ) c ;
(2) 
( W 1 c ) R ¯ < q , q > = ( ( W 1 ) R ̲ < q , q > ) c ;
(3) 
( W 1 W 2 ) R ̲ < q , q > ( W 1 ) R ̲ < q , q > ( W 2 ) R ̲ < q , q > ;
(4) 
( W 1 W 2 ) R ̲ < q , q > = ( W 1 ) R ̲ < q , q > ( W 2 ) R ̲ < q , q > ;
(5) 
( W 1 W 2 ) R ¯ < q , q > ( W 1 ) R ¯ < q , q > ( W 2 ) R ¯ < q , q > ;
(6) 
( W 1 W 2 ) R ¯ < q , q > = ( W 1 ) R ¯ < q , q > ( W 2 ) R ¯ < q , q > .
Proof. 
This proof is similar to the proof of Theorem 3. □

4. Accuracy and Roughness Measure for ( < p , p > , < q , q > ) -Linear Diophantine Rough Sets

In 1982, Pawlak gave the idea of accuracy measure (AM) and roughness measure (RM) to characterize the impreciseness of RS. These numerical measures give us a perception concerning the accuracy of the data related with some equivalence relation for a particular classification. In this Section, we formalize the notion of AM and RM for ( < p , p > , < q , q > ) -LDFRSs.
Given a Pawlak approximation space P = ( ϝ , E ) , where E is an equivalence relation on ϝ , the AM and RM of a subset W of ϝ are described as below:
γ E ( W ) = E ( W ) ̲ E ¯ ( W ) and π E ( W ) = 1 γ E ( W ) .
By following the same pattern, we define the following notions.
Definition 11.
Let ✠ = ( ϝ 1 , ϝ 2 , R ) be an LDFA space. For non-empty subsets J of ϝ 2 and W of ϝ 1 , define the MA for ( < p , p > , < q , q > ) -LDFRS with respect to J and W by the following two pairs, respectively:
AM ( J ) = ( τ J < p , p > , τ J < q , q > ) a n d AM ( W ) = ( τ W < p , p > , τ W < q , q > )
where
τ J < p , p > = | R ( J ) ̲ < p , p > | | R ( J ) ¯ < p , p > | a n d τ J < q , q > = | R ( J ) ¯ < q , q > | | R ( J ) ̲ < q , q > | .
τ W < p , p > = | ( W ) R ̲ < p , q > | | ( W ) R ¯ < q , q > | a n d τ W < q , q > = | ( W ) R ¯ < q , q > | | ( W ) R ̲ < q , q > | .
Here, | . | denotes the number of elements in the sets. Next, we define the MR for ( < p , p > , < q , q > ) -LDFRS with respect to J and W, respectively, as follows:
RM ( J ) = ( 1 , 1 ) AM ( J ) = ( 1 , 1 ) ( τ J < p , p > , τ J < q , q > )
RM ( W ) = ( 1 , 1 ) AM ( W ) = ( 1 , 1 ) ( τ W < p , p > , τ W < q , q > )
Remark 1.
From the above Definition 11, we infer the following points:
(1) 
τ J < p , p > , τ J < q , q > , τ W < p , p > , τ W < q , q > R since R is not reflexive (see Example 1).
(2) 
If R LDFR ( ϝ 1 × ϝ 1 ) is reflexive, then:
(i) 
τ J < p , p > , τ J < q , q > , τ W < p , p > , τ W < q , q > [ 0 , 1 ] .
(ii) 
AM ( ) = ( 1 , 1 ) and MR ( ) = ( 0 , 0 ) .
(iii) 
AM ( J ) = ( 1 , 1 ) if and only if J = ϝ 1 , since R ( ϝ 1 ) ̲ < p , p > = ϝ 1 = R ( ϝ 1 ) ¯ < p , p > and R ( ϝ 1 ) ¯ < q , q > = ϝ 1 = R ( ϝ 1 ) ̲ < q , q > .
(iv) 
If p = p = 1 and q = q = 0 , then AM ( J ) = ( 1 , 1 ) and RM ( J ) = ( 0 , 0 ) .
In the sequel, an example is given for the clarification of Definition 11.
Example 4.
Let us consider Example 2, where ϝ 1 = { c 1 , c 2 , c 3 , c 4 } and ϝ 2 = { c 1 , c 2 , c 3 } . Let J = { c 1 , c 2 } ϝ 1 and p = 0.58 , p = 0.50 , q = 0.42 and q = 0.45 . By simple calculations in view of Definition 9, we have:
R ( J ) ̲ < 0.58 , 0.50 > = { c 2 , c 3 , c 4 } , R ( J ) ¯ < 0.58 , 0.50 > = { c 1 , c 3 }
R ( J ) ̲ < 0.42 , 0.45 > = { c 1 , c 3 } , R ( J ) ¯ < 0.42 , 0.45 > = { c 2 }
Then the MA and MR for ( < 0.58 , 0.50 > , < 0.42 , 0.45 > ) -LDFRS with respect to J are given below:
AM ( J ) = ( 3 / 2 , 1 / 2 ) a n d RM ( J ) = ( 1 , 1 ) ( 1.5 , 0.5 ) = ( 0.5 , 0.5 ) .
Hence, the membership function μ R and its parameter p of R describe the objects of ϝ 2 accurate up to grade −0.5 and the non-membership function ν R and its parameter q of R describe the objects of ϝ 2 accurate up to grade 0.5.
Moreover, for the computations of MA and MR with respect to W ϝ 1 , considering Example 1, where ϝ 1 and ϝ 2 are the same as above and W = { c 2 , c 3 , c 4 } , for p = 0.65 , p = 0.50 and q = 0.55 , q = 0.40 , we have:
( W ) R ̲ < 0.65 , 0.50 > = { c 2 } , ( W ) R ¯ < 0.65 , 0.50 > = { c 1 } ,
( W ) R ̲ < 0.55 , 0.40 > = { c 2 , c 3 } , ( W ) R ¯ < 0.55 , 0.40 > = { c 1 }
Then the MA and MR for ( < 0.68 , 0.55 > , < 0.68 , 0.55 > ) -LDFRS with respect to W are given below:
AM ( W ) = ( 1 , 1 / 2 ) a n d RM ( W ) = ( 1 , 1 ) ( 1 , 0.5 ) = ( 0 , 0.5 ) .
Hence, the membership function μ R and its parameter α of R describes the objects of ϝ 1 accurate up to grade 1 and the non-membership function ν R and its parameter β of R describes the objects of ϝ 2 accurate up to grade 0.5.
Note that, if R L D F R ( ϝ 1 × ϝ 1 ) is reflexive, then there is no chance of any negative value of Ⅎ (see Proposition 1).

5. The Application of ( < p , p > , < q , q > ) -LDFRS on Two Universes

In clinical diagnosis systems, an appliance of the FRS model on two variant universes was presented by Sun and Ma in [53]. Due to insufficient knowledge in the case of FRS, Yang et al. [54] applied the BFRS model on two distinct universes to make a decision. However, they all have some limitations regarding affiliation and non-membership grades. Thus, we need to apply our more general model of the ( < p , p > , < q , q > ) -LDFRS model on two different universes to make a decision.
Assume that ϝ 1 denotes the set of patients and ϝ 2 denotes the set of symptoms. For all ϝ 1 and 2 ϝ 2 , if
μ R ( 1 , 2 ) p , α ( 1 , 2 ) p and ν R ( 1 , 2 ) q , β ( 1 , 2 ) q .
then we say that the degree of the sufferer 1 has the symptom 2 not less than p and the degree of its corresponding parameter is not less than p . Further, the degree of the sufferer 1 who does not have the symptom 2 is no more than q and the degree of its corresponding parameter is also no more than q . We know that a particular disease has different symptoms. For any J ϝ 2 , we denote J = { κ i ϝ 2 : i I } a certain disease. We make interpretations on the basis of the positive, negative and boundary regions as defined in Definition 10:
(1)
The objects 1 L D F P ( J ) and R ( J ) ̲ < p , p > R ( J ) ¯ < q , q > ; that is, 1 R ( J ) ̲ < p , p > means that 1 must suffer disease J; thus, he definitely needs treatment, while 1 R ( J ) ¯ < q , q > means that 1 must not suffer disease J; thus, he definitely does not need any treatment.
(2)
1 L D F B ( J ) , that is, 1 R ( J ) ¯ < p , p > R ( J ) ̲ < p , p > and 1 R ( J ) ̲ < q , q > R ( J ) ¯ < q , q > means that we do not assure, concerning the sufferer 1 , that he may or may not suffer disease J and thus they will be on the second choice by the doctor since he is not diagnosed according to these symptoms.
(3)
1 L D F N ( J ) ; that is, ( R ( J ) ¯ < p , p > ) c and ( R ( J ) ̲ < q , q > ) c ; then, does not suffer the disease and he does not need the treatment.
Let us illustrate this with a particular example.
Example 5.
Let ϝ 1 = { f 1 , f 2 , f 3 , f 4 } be the set of some patients and ϝ 2 = { d 1 , d 2 , d 3 , d 4 } be the set of some symptoms. Construct an LDF relation R from ϝ 1 to ϝ 2 which describes the membership and non-membership grades together with their parameter’s grades, for each patient f i , with respect to the symptom d j in the following matrices:
μ R = 0.25 0.55 0.59 0.65 0.59 0.43 0.47 0.25 0.66 0.36 0.44 0.75 0.42 0.45 0.44 0.66 , ν R = 0.25 0.42 0.55 0.95 0.48 0.88 0.47 0.45 0.55 0.32 0.21 0.34 0.32 0.47 0.36 0.65 , and,
α = 0.50 0.52 0.60 0.56 0.41 0.35 0.32 0.18 0.55 0.33 0.36 0.60 0.35 0.30 0.45 0.52 , β = 0.20 0.39 0.40 0.42 0.38 0.60 0.56 0.37 0.40 0.12 0.54 0.22 0.25 0.32 0.28 0.40 .
Let J = { d 1 , d 2 } signify a certain disease and this disease have two symptoms in clinic.
Case-1: For p = 0.55 , p = 0.52 and q = 0.42 , q = 0.39 , we have:
R ( J ) ̲ < 0.55 , 0.52 > = { f 2 } , R ( J ) ¯ < 0.55 , 0.52 > = { f 1 , f 3 }
R ( J ) ̲ < 0.42 , 0.39 > = { f 1 , f 3 , f 4 } , R ( J ) ¯ < 0.42 , 0.39 > = { f 1 }
So, L D F P = ( { f 2 } , { f 1 } ) , L D F B = ( , { f 3 , f 4 } ) and L D F N = ( { f 2 , f 4 } , { f 2 } ) .
Thus, based on these regions we conclude that:
Patient f 2 must suffer disease J and thus he needs the treatment and patient f 1 must not suffer disease J, so he does not need any treatment.
We do not assure, concerning patient f 3 , that he may or may not suffer disease J according to the symptoms. For him, the decision of the doctor will be on the second choice.
Patient f 4 does not suffer disease J.
Case-2: For p = 0.75 , p = 0.60 and q = 0.34 , q = 0.22 , we have:
R ( J ) ̲ < 0.75 , 0.60 > = { f 2 , f 4 } , R ( J ) ¯ < 0.75 , 0.60 > =
R ( J ) ̲ < 0.34 , 0.22 > = { f 1 , f 3 } , R ( J ) ¯ < 0.34 , 0.22 > = { f 1 , f 2 , f 4 }
So, L D F P = ( { f 2 , f 4 } , { f 1 , f 2 , f 4 } ) , L D F B = ( ϝ 1 , { f 2 , f 4 } ) and L D F N = ( , { f 2 , f 4 } ) . Thus, based on these regions we conclude that:
Patient f 2 must suffer disease J and thus he needs treatment and patient f 1 must not suffer disease J, so he does not need any treatment.
We do not assure, concerning patient f 3 , that he may or may not suffer disease J according to the symptoms. For him, the decision of the doctor will be on the second choice.
Patient f 4 does not suffer disease J.
Example 6.
Since each IF relation (or BF relation) is an LDF relation [22], if we consider an IF relation given in Table 1 of [54], i.e.,
μ R = 0.74 0.25 0.17 1 0.62 0.45 0.87 0.45 0.53 1 0.24 0.18 0.12 0.77 0.43 0.69 , ν R = 0.10 0.43 0.64 0 0.20 0.32 0.05 0.45 0.34 0 0.23 0.25 0.71 0.10 0.51 0 , from ϝ 1 = { f 1 , f 2 , f 3 , f 4 } to ϝ 2 = { d 1 , d 2 , d 3 , d 4 } as in Example 5. In this case our Definition 9 reduces to the following:
R ( J ) ̲ p = { 1 ϝ 1 : ϑ R M ( 1 , 2 ) < p , for all 2 J c }
R ( J ) ¯ p = { 1 ϝ 1 : ϑ R M ( 1 , 2 ) p , for some 2 J }
R ( J ) ̲ q > = { 1 ϝ 1 : ϑ R N ( 1 , 2 ) q , for some 2 J }
R ( J ) ¯ q = { 1 ϝ 1 : ϑ R N ( 1 , 2 ) > q , for all 2 J c }
According to this definition, let J = { d 1 , d 2 } denote a certain disease having symptoms d 1 and d 2 .
Case-1: For p = 0.5 , q = 0.2 , the lower and upper A spaces are computed as below:
R ( J ) ̲ 0.5 = { f 3 } , R ( J ) ¯ 0.5 = ϝ 1
R ( J ) ¯ 0.2 = ϝ 1 , R ( J ) ¯ 0.5 =
Thus, P O S = ( { f 3 } , ) , B N D = ( { f 1 , f 2 , f 4 } , ϝ 1 ) and N E G = ( , ) . Thus, based on these regions we conclude that:
Patient f 3 must suffer disease J and thus he needs treatment.
We do not assure, concerning patient f 1 , f 2 , f 4 , that they may or may not suffer disease J according to the symptoms. For them, the decision of the doctor will be on the second choice.
None of the patients’ diagnosis is healthy.
Case-2: For p = 0.7 , q = 0.1 , the lower and upper A spaces are computed as below:
R ( J ) ̲ 0.7 = { f 3 , f 4 } , R ( J ) ¯ 0.7 = { f 1 , f 3 , f 4 }
R ( J ) ¯ 0.1 = { f 1 , f 3 , f 4 } , R ( J ) ¯ 0.1 = { f 3 }
Thus, P O S = ( { f 3 , f 4 } , { f 3 } ) , B N D = ( { f 1 } , { f 1 , f 4 } ) and N E G = ( { f 2 } , { f 2 } ) . Thus, based on these regions we conclude that:
Patient f 3 , f 4 must suffer disease J and thus they needs treatment.
We do not assure, patient f 1 , that they may or may not suffer disease J according to the symptoms. For them, the decision of the doctor will be on the second choice.
Patient f 2 does not suffer disease J.

Sensitivity Analysis and Comparative Analysis

In this subsection, we discuss the validity of the proposed method, sensitivity analysis, and the comparison of the proposed approach with existing approaches. Table 2 shows representations of different fuzzy numbers, Table 3 gives the comparison analysis of LDFS with existing fuzzy set models, and Table 4 gives the comparison analysis of LDFRS with existing rough set models.
From Examples 5 and 6, it can be easily observed that the results obtained by using our LDFRSs is closer to the given membership matrices than the results obtained by employing the BF relation. Hence, our proposed technique of LDFRSs is a more efficient and robust model. The idea of reference parameters in linear Diophantine fuzzy rough sets provides more accuracy in decision-making and medical diagnosis. Since LDFRS is a more generalized hybrid model, the optimal decision for medical diagnosis computed by the proposed approach is more accurate as compared with some existing methods of [57,59,61,62].

6. Conclusions

The notions of rough set (RS) and linear Diophantine fuzzy set (LDFS) are robust models for computational intelligence and decision-making problems. The main objective of this article is to magnify the notion of LDFS and RS for intelligent information processing. For this purpose, the novel concept of the linear Diophantine fuzzy rough set (LDFRS) based on ( < p , p > , < q , q > ) -indiscernibilty is proposed. The proposed model is a robust extension of the existing models for roughness approximation of a crisp set by using certain binary relations. The idea of an LDF relation with the addition of control parameters is more efficient for roughness approximation than existing F relation, IF relation, and BF relation. Thus the proposed model of LDFRS provides a broader space for the selection of membership and non-membership grades than existing models (FS, IFS, BFS, q-ROFS) to discuss fuzziness and roughness in terms of LDFA spaces. Some significant results of LDFA spaces are established with supportive examples. Moreover, a practical application with the help of numerical examples is presented in medical diagnosis. The proposed model can be further extended towards multi-granulation rough set theory and covering based rough set theory with applications in information analysis, computational intelligence, medical diagnosis and decision-making problems.

Author Contributions

S.A., M.S. and D.B. worked together for mathematical modeling and framework of this manuscript. M.R., D.B. and D.M. suggested the idea of application of proposed modeling. W.M., D.B. and D.M. developed algorithms and S.A., M.S., M.R. and D.B. developed numerical examples. All authors read and agreed to the publication of this manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank the scholars and the referees for their valuable suggestions and recommendations for making our results more accurate.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Atanssov, K.T. Intuintionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Atanssov, K.T. More on intuintionistic fuzzy sets. Fuzzy Sets Syst. 1989, 33, 37–45. [Google Scholar] [CrossRef]
  4. Zhang, W.R. Bipolar fuzzy sets and relations: A computational framework for cognitive modeling and multiagent decision analysis. In Proceedings of the Industrial Fuzzy Control and Intelligent Systems Conference and the NASA Joint Technology Workshop on Neural Networks and Fuzzy Logic and Fuzzy Information Processing Society Biannual Conference, San Antonio, TX, USA, 8–21 December 1994; pp. 305–309. [Google Scholar]
  5. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  6. Pawlak, Z. Rough Sets-Theoretical Aspects of Reasoning Anout Data; Kluwer Academic Publishing: Dordrecht, The Netherlands, 1991. [Google Scholar]
  7. Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Green Version]
  8. Chen, J.; Li, S.; Ma, S.; Wang, X. m-polar fuzzy sets: An extension of bipolar fuzzy sets. Sci. World J. 2014, 2014, 416530. [Google Scholar] [CrossRef] [Green Version]
  9. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the IFSA World Congress and NAFIPS Anual Meeting, Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  10. Yager, R.R. Pythagorean membership grades in multi-criteria decision maiking. IEEE Transecrtions Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  11. Cattaneo, G.; Ciucci, D. Intuitionistic Fuzzy Sets or Orthopair Fuzzy Sets? In Proceedings of the 3rd Conference of the European Society for Fuzzy Logic and Technology, Zittau, Germany, 10–12 September 2003; pp. 10–12. [Google Scholar]
  12. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Transecrtions Fuzzy Syst. 2017, 25, 1222–1230. [Google Scholar] [CrossRef]
  13. Naeem, K.; Riaz, M.; Afzal, D. Pythagorean m-polar fuzzy sets and TOPSIS method for the selection of advertisement mode. J. Intell. Fuzzy Syst. 2019, 37, 8441–8458. [Google Scholar] [CrossRef]
  14. Naeem, K.; Riaz, M.; Karaaslan, F. Some novel features of Pythagorean m-polar fuzzy sets with applications. Complex Intell. Syst. 2020, 7, 459–475. [Google Scholar] [CrossRef]
  15. Riaz, M.; Hashmi, M.R. Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems. J. Intell. Fuzzy Syst. 2019, 37, 5417–5439. [Google Scholar] [CrossRef]
  16. Riaz, M.; Hashmi, M.R.; Kulsoom, H.; Pamucar, D.; Chu, Y.M. Linear Diophantine fuzzy soft rough sets for the selection of sustainable material handling equipment. Symmetry 2020, 12, 1215. [Google Scholar] [CrossRef]
  17. Kamaci, H. Linear Diophantine fuzzy algebraic structures. J. Ambient. Intell. Humaniz. Comput. 2021, 12, 10353–10373. [Google Scholar] [CrossRef]
  18. Almagrabi, A.O.; Abdullah, S.; Shams, M.; Al-Otaibi, Y.D.; Ashraf, S. A new approach to q-linear Diophantine fuzzy emergency decision support system for COVID19. J. Ambient. Intell. Humaniz. Comput. 2021, 1–27. [Google Scholar] [CrossRef] [PubMed]
  19. Zadeh, L.A. Similarity Relations and Fuzzy Orderings. Inf. Sci. 1971, 3, 177–200. [Google Scholar] [CrossRef]
  20. Wang, X.Z.; Ruan, D.; Kerre, E.E. Mathematics of Fuzziness-Basic Issues; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2009; pp. 1–232. [Google Scholar]
  21. Atanassov, K.T. Intuitionistic Fuzzy Relations; Antonov, L., Ed.; III International School “Automation and Scientific Instrumentation”: Varna, Bulgaria, 1984; pp. 56–57. [Google Scholar]
  22. Ayub, S.; Shabir, M.; Riaz, M.; Aslam, M.; Chinram, R. Linear Diophantine Fuzzy relations and their algebraic properties with decision-making. Symmetry 2021, 13, 945. [Google Scholar] [CrossRef]
  23. Hashmi, M.R.; Riaz, M.; Smarandache, F. m-polar neutrosophic topology with applications to multi-criteria decision-making in medical diagnosis and clustering analysis. Int. J. Fuzzy Syst. 2020, 22, 273–292. [Google Scholar] [CrossRef]
  24. Yao, Y.Y. Constructive and algebraic methods of the theory of rough sets. Inf. Sci. 1998, 109, 21–47. [Google Scholar] [CrossRef]
  25. Zhu, W. Generalized rough sets based on relations. Inf. Sci. 2007, 177, 4997–5011. [Google Scholar] [CrossRef]
  26. Skowron, A.; Stepaniuk, J. Tolerance approximation spaces. Fundam. Informaticae 1996, 27, 245–253. [Google Scholar] [CrossRef]
  27. Slowinski, R.; Vanderpooten, D. Similarity relation as a basis for rough approximations. ICS Res. Rep. 1995, 53, 249–250. [Google Scholar]
  28. Li, Z.; Xie, N.; Gao, N. Rough approximations based on soft binary relations and knowledge bases. Soft Comput. 2017, 21, 839–852. [Google Scholar] [CrossRef]
  29. Kanwal, R.S.; Shabir, M. Roughness in semigroups by soft binary relations. J. Intell. Fuzzy Syst. 2018, 35, 1–14. [Google Scholar]
  30. Ali, M.I. A note on soft sets, rough soft sets, fuzzy soft sets. Appl. Soft Comput. 2011, 11, 3329–3332. [Google Scholar]
  31. Davvaz, B. A short note on algebraic T-rough sets. Inf. Sci. 2008, 178, 3247–3252. [Google Scholar] [CrossRef]
  32. Qian, Y.; Liang, J.; Yao, Y.; Dang, C. MGRS: A Multigranulation rough set. Inf. Sci. 2010, 180, 949–970. [Google Scholar] [CrossRef]
  33. Ayub, S.; Shabir, M.; Mahmood, W. New types of soft rough sets in groups by normal soft groups. Comput. Appl. Math. 2020, 39, 1–15. [Google Scholar] [CrossRef]
  34. Shiekh, M.R.; Dutta, S.; Li, D.F. Solution of matrix games with rough interval pay-offs and its application in the telecom market share problem. Int. J. Intell. Syst. 2021, 36, 6066–6100. [Google Scholar]
  35. Sheikh, M.R.; Nayak, P.K.; Pal, M. An alternative approach for solving fuzzy matrix games. Int. J. Math. Soft Comput. 2015, 5, 79–92. [Google Scholar] [CrossRef] [Green Version]
  36. Ruidas, S.; Sheikh, M.R.; Nayak, P.K. A production-repairing inventory model considering demand and the proportion of defective items as rough intervals. Oper. Res. 2021, 1–27. [Google Scholar] [CrossRef]
  37. Cock, M.D.; Cornelis, C.; Kerre, E.E. Fuzzy rough sets: The forgotten step. IEEE Trans. Fuzzy Syst. 2007, 15, 121–130. [Google Scholar] [CrossRef]
  38. Maji, P.; Garai, P. IT2 fuzzy rough sets and max relevance-max significance criterion for attribute selection. Cybern. IEEE Trans. 2015, 45, 1657–1668. [Google Scholar] [CrossRef]
  39. Mahmood, W.; Nazeer, W.; Kang, S.K. The lower and upper approximations and homomorphisms between lower and upper approximations in quotient groups. J. Intell. Fuzzy Syst. 2017, 33, 2585–2594. [Google Scholar] [CrossRef]
  40. Mahmood, W.; Ahmad, M.S.; Nazeer, W.; Kang, S.M. A comparision between lower and upper approximations in groups with respect to group homomorphisms. J. Intell. Fuzzy Syst. 2018, 35, 693–703. [Google Scholar] [CrossRef]
  41. Tsang, E.C.; Chen, D.; Yeung, D.S.; Wang, X.Z.; Lee, J.W. Attributes reduction using fuzzy rough sets. IEEE Trans. Fuzzy Syst. 2008, 16, 1130–1141. [Google Scholar] [CrossRef]
  42. Yao, Y.; Mi, J.; Li, Z. A novel variable precision (θ,σ)-fuzzy rough set model based on fuzzy granules. Fuzzy Sets Syst. 2014, 236, 58–72. [Google Scholar] [CrossRef]
  43. Dubois, D.; Prade, H. Fuzzy rough sets and rough fuzzy sets. Int. J. Gen. Syst. 1990, 17, 191–209. [Google Scholar] [CrossRef]
  44. Akram, M.; Ali, G.; Alcantud, J.C.R. New decision-making hybrid model: Intuitionistic fuzzy N-soft rough sets. Soft Comput. 2019, 23, 9853–9868. [Google Scholar] [CrossRef]
  45. Shabir, M.; Shaeen, T. A new methodolgy for fuzzification of rough sets based on α-indiscernibility. Fuzzy Sets Syst. 2016, 16, 1–19. [Google Scholar]
  46. Malik, N.; Shabir, M. Rough fuzzy bipolar soft sets and application in decision-making problems. Soft Comput. 2019, 23, 1603–1614. [Google Scholar] [CrossRef]
  47. Gul, R.; Shabir, M. Roughness of a set by (α,β)-indiscernibility of Bipolar fuzzy relation. Comput. Appl. Math. 2020, 39, 1–22. [Google Scholar] [CrossRef]
  48. Shabir, M.; Ali, M.I.; Shaheen, T. Another approach to soft rough sets. Knowl. Based Syst. 2013, 40, 72–78. [Google Scholar] [CrossRef]
  49. Ayub, S.; Mahmood, W.; Shabir, M.; Nabi, F.G. Applications of roughness in soft-intersection groups. Comut. Appl. Math. 2019, 8, 1–16. [Google Scholar] [CrossRef]
  50. Chen, Z.; Ayub, S.; Mahmood, W.; Mahmood, A.; Jung, C.Y. A study of roughness in modules of fractions. IEEE Access 2019, 7, 93088–93099. [Google Scholar] [CrossRef]
  51. Zhang, L.; Zhan, J.; Alcantud, J.C.R. Novel classes of fuzzy soft β-coverings-based fuzzy rough sets with applications to multicriteria fuzzy group decision-making. Soft Comput. 2019, 23, 5327–5351. [Google Scholar] [CrossRef]
  52. Ouyang, Y.; Wang, Z.; Zhang, H. On fuzzy rough sets based on tolerance relations. Inf. Sci. 2010, 180, 532–542. [Google Scholar] [CrossRef]
  53. Sun, B.Z.; Ma, W.M. Fuzzy rough set model on two different universes and its applications. Appl. Math. Model. 2011, 35, 1798–1809. [Google Scholar] [CrossRef] [Green Version]
  54. Yang, H.L.; Li, S.G.; Wang, S.; Wang, J. Bipolar fuzzy rough set model on two different universes and it sapplications. Knowl.-Based Syst. 2012, 35, 94–101. [Google Scholar] [CrossRef]
  55. Feng, F.; Li, C.; Davvaz, B.; Ali, M.I. Soft sets combined with fuzzy sets and rough sets, a tentative approach. Soft Comput. 2010, 14, 899–911. [Google Scholar] [CrossRef]
  56. Feng, F.; Liu, X.; Leoreanu-Fotea, V.; Jun, Y.B. Soft sets and Soft rough sets. Inf. Sci. 2011, 181, 1125–1137. [Google Scholar] [CrossRef]
  57. Zhang, H.D.; Shu, L.; Liao, S.L. Intuitionistic fuzzy soft rough set and its applications in decision-making. In Abstract and Applied Analysis; Hindawi: London, UK, 2014; pp. 1–13. [Google Scholar]
  58. Zhang, H.D.; Shu, L.; Liao, S.L. On interval-valued hesitant fuzzy rough approximation operators. Soft Comput. 2016, 20, 189–209. [Google Scholar] [CrossRef]
  59. Zhou, L.; Wu, W.Z. Characterization of rough set approximations in Atanassov intuitionistic fuzzy set theory. Comput. Math. Appl. 2011, 62, 282–296. [Google Scholar] [CrossRef] [Green Version]
  60. Zhan, J.; Alcantud, J.C.R. A survey of parameter reduction of soft sets and corresponding algorithms. Artif. Intell. Rev. 2019, 52, 1839–1872. [Google Scholar] [CrossRef]
  61. Hussain, A.; Ali, M.I.; Mahmood, T. Pythagorean fuzzy soft rough sets and their applications in decision-making. J. Taibah Univ. Sci. 2020, 14, 101–113. [Google Scholar] [CrossRef] [Green Version]
  62. Hussain, A.; Ali, M.I.; Mahmood, T.; Munir, M. q-Rung orthopair fuzzy soft average aggregation operators and their application in multicriteria decision-making. Int. J. Intell. Syst. 2020, 35, 571–599. [Google Scholar] [CrossRef]
  63. Pamucar, D. Normalized weighted geometric Dombi Bonferroni mean operator with interval grey numbers: Application in multicriteria decision-making. Rep. Mech. Eng. 2020, 1, 44–52. [Google Scholar] [CrossRef]
  64. Ali, Z.; Mahmood, T.; Ullah, K.; Khan, Q. Einstein Geometric Aggregation Operators using a Novel Complex Interval-valued Pythagorean Fuzzy Setting with Application in Green Supplier Chain Management. Rep. Mech. Eng. 2021, 2, 105–134. [Google Scholar] [CrossRef]
  65. Božanic, D.; Randelovic, A.; Radovanovic, M.; Tešic, D. A hybrid LBWA-IR-MAIRCA multi-criteria decision-making model for determination of constructive elements of weapons. Facta Univ. Ser. Mech. Eng. 2020, 18, 399–418. [Google Scholar] [CrossRef]
  66. Agarwal, S.; Dandge, S.S.; Chakraborty, S. Parametric analysis of a grinding process using the rough sets theory. Facta Univ. Ser. Mech. Eng. 2020, 18, 91–106. [Google Scholar] [CrossRef]
  67. Zhang, X.L.; Xu, Z.S. Extension of TOPSIS to multiple criteria decision-making with Pythagorean fuzzy sets. Int. J. Intell. Syst. 2014, 29, 1061–1078. [Google Scholar] [CrossRef]
  68. Senapati, T.; Yager, R.R. Fermatean fuzzy sets. J. Ambient. Intell. Humaniz. Comput. 2020, 11, 663–674. [Google Scholar] [CrossRef]
  69. Liu, P.; Wang, P. Some q-rung orthopair fuzzy aggrega tion operator and their application tomulti-attribute decision making. Int. J. Intell. Syst. 2018, 33, 259–280. [Google Scholar] [CrossRef]
  70. Zhang, H.; Shu, L.; Liao, S. Intuitionistic fuzzy soft rough set and its application in decision-making. Abstr. Appl. Anal. 2014, 2014, 287314. [Google Scholar] [CrossRef] [Green Version]
  71. Zhang, C.; Li, D.Y. Pythagorean fuzzy rough sets and its applications in multi-attribute decision-making. J. Chin. Comput. Syst. 2016, 37, 1531–1535. [Google Scholar]
  72. Liang, D.; Cao, W. q-Rung orthopair fuzzy sets-based decision-theoretic rough sets for three-way decisions under group decision-making. Int. J. Intell. Syst. 2019, 34, 3139–3167. [Google Scholar] [CrossRef]
  73. Khoshaim, A.B.; Abdullah, S.; Ashraf, S.; Naeem, M. Emergency decision-making based on q-rung orthopair fuzzy rough aggregation information. Comput. Mater. Contin. 2021, 69, 4077–4094. [Google Scholar] [CrossRef]
Figure 1. Comparison of LDFNs with IFNs, PFNs and q-ROFNs.
Figure 1. Comparison of LDFNs with IFNs, PFNs and q-ROFNs.
Symmetry 14 00525 g001
Table 1. Comparison between LDFS with some existing fuzzy sets.
Table 1. Comparison between LDFS with some existing fuzzy sets.
ModelsLimitations and Delimitations
Fuzzy sets [1]A FS assigns MGs but can not deal with NMGs.
IFSs [2,3]An IFS assigns both MGs and NMGs with μ ( ) + ν ( ) 1 but it can not deal with μ ( ) + ν ( ) > 1   ϝ .
PFSs [9,10]A PFS assigns both MGs and NMGs with ( μ ( ) ) 2 + ( ν ( ) ) 2 1 but it can not deal with ( μ ( ) ) 2 + ( ν ( ) ) 2 > 1   ϝ .
FFSs [68]A FFS assigns both MGs and NMGs with ( μ ( ) ) 3 + ( ν ( ) ) 3 1 it but can not deal with ( μ ( ) ) 3 + ( ν ( ) ) 3 > 1   ϝ .
q-ROFSs [12]A q-ROFS assigns both MGs and NMGs with ( μ ( ) ) q + ( ν ( ) ) q 1 , q 1 but it can not deal with ( μ ( ) ) q + ( ν ( ) ) q > 1 or if μ ( ) = ν ( ) = 1 .
LDFSs [15]A LDFS assign MGs and NMGs as well as the reference/control parameters. It relax the limitations of IFSs, PFSs, FFSs, and q-ROFSs. It provides freedom to decision makers for assigning MGs and NMGs.
Table 2. Representations of fuzzy numbers.
Table 2. Representations of fuzzy numbers.
Fuzzy NumbersConstraintsBroader Space
IFN ( μ ( ) , ν ( ) ) [2,3] 0 μ ( ) + ν ( ) 1 ×
PFN ( μ ( ) , ν ( ) ) [67] 0 ( μ ( ) ) 2 + ( ν ( ) ) 2 1 ×
FFN ( μ ( ) , ν ( ) ) [68] 0 ( μ ( ) ) 3 + ( ν ( ) ) 3 1 ×
q-ROFN ( μ ( ) , ν ( ) ) [69] 0 ( μ ( ) ) q + ( ν ( ) ) q 1 , q 1 ×
LDFN ( μ ( ) , ν ( ) ) , ( α ( ) , β ( ) ) 0 α ( ) μ ( ) + β ( ) ν ( ) ) 1
[15,16,22]
Table 3. Comparison analysis of LDFS with existing fuzzy set models.
Table 3. Comparison analysis of LDFS with existing fuzzy set models.
ModelsMembership GradeNon-Membership GradeReference Parameters
Crisp set×××
Fuzzy set [1]××
IFS [2,3]×
PFS [9,10]×
FFS [68]×
q-ROFS [12]×
LDFS [15,16,22]
Table 4. Comparison analysis of LDFRS with existing rough set models.
Table 4. Comparison analysis of LDFRS with existing rough set models.
ModelsUpper and LowerBoundary ( < p , p > , < q , q > ) -
ApproximationsRegionIndiscernibility Relations
Crisp set×××
Rough set [6]×
IFSRS [70]×
PFSRS [61,71]×
q-ROFSRS [72,73]×
LDFRS
Proposed
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ayub, S.; Shabir, M.; Riaz, M.; Mahmood, W.; Bozanic, D.; Marinkovic, D. Linear Diophantine Fuzzy Rough Sets: A New Rough Set Approach with Decision Making. Symmetry 2022, 14, 525. https://doi.org/10.3390/sym14030525

AMA Style

Ayub S, Shabir M, Riaz M, Mahmood W, Bozanic D, Marinkovic D. Linear Diophantine Fuzzy Rough Sets: A New Rough Set Approach with Decision Making. Symmetry. 2022; 14(3):525. https://doi.org/10.3390/sym14030525

Chicago/Turabian Style

Ayub, Saba, Muhammad Shabir, Muhammad Riaz, Waqas Mahmood, Darko Bozanic, and Dragan Marinkovic. 2022. "Linear Diophantine Fuzzy Rough Sets: A New Rough Set Approach with Decision Making" Symmetry 14, no. 3: 525. https://doi.org/10.3390/sym14030525

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop