Next Article in Journal
Existence and Multiplicity of Solutions for a Class of Particular Boundary Value Poisson Equations
Next Article in Special Issue
Advertising Decisions of Platform Supply Chains Considering Network Externalities and Fairness Concerns
Previous Article in Journal
Singularities of Serial Robots: Identification and Distance Computation Using Geometric Algebra
Previous Article in Special Issue
On the Suitability of Bagging-Based Ensembles with Borderline Label Noise
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Method for Decision Making by Double-Quantitative Rough Sets in Hesitant Fuzzy Systems

1
College of Artificial Intelligence, Southwest University, Chongqing 400715, China
2
School of Sciences, Chongqing University of Technology, Chongqing 400054, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(12), 2069; https://doi.org/10.3390/math10122069
Submission received: 20 April 2022 / Revised: 6 June 2022 / Accepted: 10 June 2022 / Published: 15 June 2022
(This article belongs to the Special Issue Data Mining: Analysis and Applications)

Abstract

:
In some complex decision-making issues such as economy, management, and social development, decision makers are often hesitant to reach a consensus on the decision-making results due to different goals. How to reduce the influence of decision makers’ subjective arbitrariness on decision results is an inevitable task in decision analysis. Following the principle of improving the fault-tolerance capability, this paper firstly proposes the graded and the variable precision rough set approaches from a single-quantitative decision-making view in a hesitant fuzzy environment (HFEn). Moreover, in order to improve the excessive overlap caused by the high concentration of single quantization, we propose two kinds of double-quantitative decision-making methods by cross-considering relative quantitative information and absolute quantitative information. The proposal of this method not only solves the fuzzy system problem of people’s hesitation in the decision-making process, but also greatly enhances the fault-tolerant ability of the model in application. Finally, we further compare the approximation process and decision results of the single-quantitative models and the double-quantitative models, and explore some basic properties and corresponding decision rules of these models. Meanwhile, we introduce a practical example of housing purchase to expound and verify these theories, which shows that the application value of these theories is impressive.

1. Introduction

With the complexity of information and data, people tend to be hesitant to make decisions, which affects both the efficiency of decision making and reduces the quality of decision results. The hesitant fuzzy set (HFS) was first proposed by Torra [1] in 2009, as an extension of the fuzzy set, and it can accurately reflect situations of different preference degrees of a decision-making group. Unlike a fuzzy set [2,3,4], the membership degree of an HFS [5] is not a deterministic value and does not obey a certain distribution, but is a set of possible values. Thus, the HFS contains more complete and specific information about the object while dealing with some complex decision-making problems. The introduction of the HFS not only depicts the indecision of decision makers when making decisions, but also reflects various decision information of decision-making groups.
The information system (IS) is the most intuitive and effective way to express knowledge. Nevertheless, with the complexity and diversification of data in practical applications, a great mass of data are not suitable for the classical information system or the fuzzy information system. Therefore, the combination and application of IS and HFS has attracted the attention of scholars in various decision-making fields [6] at home and abroad, and has been widely applied in many fields, such as supply chain management, pattern recognition, and medical diagnosis. Xu et al. [7] defined the distance, similarity, and correlation degree in hesitant fuzzy systems. Then the formulas of hesitation fuzzy entropy and cross entropy were discussed and applied to the hesitant fuzzy multiple attribute decision-making problems [8]. Peng et al. [9] investigated multi-criteria decision-making problems in hesitant fuzzy environments. Moreover, some researchers have devoted themselves to the study of hesitant fuzzy information measurement methods, which can be summarized as the following two aspects: (1) a hesitant fuzzy information measurement method based on the traditional distance; (2) a hesitant fuzzy information measurement method based on the perspective of information theory. In terms of hesitant fuzzy aggregation operators, some scholars have applied the aggregation operators in HFEn and achieved remarkable results. Xia et al. [10] defined a hesitant fuzzy weighted average operator, geometric average operator, mixed average operator, and generalized hesitant fuzzy average operator. Xia et al. [11] proposed some hesitant fuzzy quasi-operators based on the quasi-arithmetic mean. Furthermore, Xia et al. [12] put forward the reliability-induced hesitant fuzzy aggregation operator by considering the reliability level of the aggregation information. Based on the Einstein rule, Yu et al. [13] proposed a method of hesitant fuzzy information aggregation. However, the above operators only considered the importance of attributes themselves while ignoring the relationship among these various attributes. In order to repair this shortcoming, Zhu et al. [14,15] and Yu et al. [16] proposed a hesitant fuzzy Bonferroni operator and generalized hesitant fuzzy Bonferroni operator, respectively, and applied them to multi-attribute decision-making problems. Liao et al. [17] and Peng et al. [18] put forward hesitant fuzzy dynamic aggregation operators to process the multi-stage multi-attribute decision-making problems. With the development of the theories of HFSs, various information fusion methods and models are used to deal with the decision-making problems with hesitant fuzzy information. Zhang et al. [19] and Liao et al. [20]. studied the VIKOR method in HFEn. Zhu et al. [21], Liao et al. [22] and Xia et al. [23] defined the hesitant fuzzy preference relation and discussed its application in multi-attribute group decision making. In HFEn, Liao et al. [24] established an optimization model based on scheme satisfaction and discussed the interactive group decision-making method. Farhadinia [25,26] proposed a new comparison method of HFSs for the shortcomings of the HFS comparison function. To realize the comparison of HFSs, Zhang et al. [27] presented a new hesitant fuzzy measure function. For one side, the hesitation process of humans is synthesized by the method of aggregation operators. For the other side, the method of utilizing aggregation operators comprehensively analyzes the relationship between attributes, extending and optimizing the solution to the hesitant fuzzy decision-making problem. Accordingly, the research background of our work is a hesitant fuzzy information system (HFIS). Consistent with these scholars, we intend to use the aggregation operator of HFSs to investigate decision problems.
Rough set theory (RST) was proposed by Pawlak [28] in 1982. As an important tool of data to process imprecision and uncertainty information, its basic idea is to approximate some inaccurate and uncertain concepts with known knowledge. The biggest advantage of the rough set model is that it does not require any prior knowledge about the data. However, the approximations of a classical rough set are defined on the basis of the qualitative relationship between concepts, without considering the intersection degree of concepts, thus it is not applicable for the treatment of many practical problems. Moreover, RST also defines three regions [29] by using the set-inclusion relation and the set non-empty overlapping condition. In some ways, these three regions can be understood as three-way decisions [30,31] including three decisions of acceptance, rejection, and abstention. In view of the shortcomings of the stringency and the lack of fault-tolerant competence of the Pawlak rough set model, Yao et al. [32] proposed the decision-theoretic rough set (DTRS) model in 1990. The main starting point of the DTRS is to define the degree of intersection of concepts with conditional probability, and to define the probability upper and lower approximation sets by two thresholds, α and β . In 1993, Ziarko [33] proposed a variable precision rough set (VPRS) model from the perspective of the degree of set inclusion, which is a special case of DTRSs [34]. Subsequently, a parameterized rough set model was brought up by Skowron in [35], and a Bayesian rough set model was presented by Ślezak et al. [36] in 2005. In combination with probability theory, the DTRS model includes both a comprehensive quantitative description of rough set theory and a complete semantic model based on the Bayesian decision process. Meanwhile, the DTRS model also gives a practical and effective method for computing these thresholds. These works lay a solid theoretical foundation for further research on the theory of rough sets, and provide a new idea for us to study uncertain knowledge. Liang and Xu et al. [37] have made a deep study of the risk decision in HFEn on the basis of decision theory. Liang and Xu et al. [38,39,40,41,42,43,44] studied three-way decision problems based on the decision-theoretic rough set model in different systems.
In terms of information quantification, the VPRS model primarily describes the approximate spaces from the perspective of the relative quantitative information, while the graded rough set (GRS) model [45] depicts the approximate spaces from the view of absolute quantitative information. Relative quantitative information and absolute quantitative information are two distinct objective aspects of describing approximate space, each with its application environment and limitations. However, it is worth mentioning that some composite models based on DTRSs with double fault-tolerance capabilities are proposed by Li and Xu [46], which thoroughly describe the approximation space through the double-quantitative indicators with a complementary relationship. Yu et al. [47] introduced multi-granulation methods to Dq-DTRS models. Xu et al. [48] further explored generalized multi-granulation Dq-DTRS models. In addition, Fan et al. [49] discussed logical double-quantitative rough fuzzy sets and local logical disjunction double-quantitative rough sets.
Neither the classical decision-theoretic rough set theory nor the fuzzy decision-theoretic rough set that scholars have already studied can be used to describe the indecisive attitude of decision makers in the decision-making process. However, there exist many decision-making problems in the current stage of social and economic management, such as house purchases, the stock market, medical diagnosis, etc. The problem of improving the quality of decision making and enhancing the effectiveness of decision making is an urgent issue to be solved. In view of the superiority of HFSs and the high tolerance of DTRSs, how to utilize these two models to reduce the impact of decision makers’ subjective arbitrariness on decision results is a motivation of this study.
With the diversification of decision information and the hesitancy of people to make a decision, this paper integrates the GRS model and the VPRS model to construct two kinds of composite models with double fault tolerance, which comprehensively and in detail describe the approximate space. They further explore the uncertainty and imprecise knowledge in data and provide decision makers with scientific and effective decisions. As shown in Figure 1, the contributions of our work are as follows:
(1)
A novel hesitant fuzzy aggregation operator that both reflects the hesitant attitude of decision makers and synthesizes hesitant information is proposed. On this basis, we introduce the hesitant fuzzy aggregation operator to the VPRS model and GRS model.
(2)
Two HFEn-based double-quantitative decision-making models are presented by integrating the VPRS-HEFn model and the GRS-HEFn model. Furthermore, we discuss the properties of two models and make a comparison from the internal relationship between the two models.
(3)
In order to further illustrate the superiority of two types of MARS models, we design a corresponding algorithm and case analysis. The comparison results of single-quantitative models and double-quantitative models in the case verify the effectiveness of the proposed method.
This paper is organized as follows. In Section 2, some basic concepts of HFSs, the original GRS model, and the VPRS model derived from a Bayesian decision procedure are reviewed. Regarding HFEn, Section 3 describes the extension of the GRS model and the VPRS model and analyzes their properties. In Section 4, considering the combination of two kinds of logical operators, two HFEn-based double-quantitative decision-making models (Models 1 and 2) are proposed and their basic internal relations are discussed. In Section 5, a case study is given to illustrate these double-quantitative decision-making methods in the HFEn. Finally, Section 6 gives a summary of this research and further elaborates the future research.

2. Preliminaries

For the convenience of understanding, this section reviews some of the relevant background knowledge needed for this paper, such as the theories of hesitant fuzzy set, graded rough set, variable precision rough set, and double-quantitative decision-theoretic rough fuzzy set models.

2.1. Hesitant Fuzzy Set

In real life, it is difficult to reach a consensus on the views of all members of a group when hesitation exists. From this point of view, Torah [1] shows that the difficulty in establishing membership degrees of an element is caused by a set of possible values. Then, he proposed the concept of a hesitant fuzzy set (HFS). Subsequently, Xia and Xu [7] expressed the HFS by a mathematical symbol for more profound understanding and application. The details can be found in [45].
Definition 1.
Let U be a universe with finite elements, a hesitant fuzzy set (HFS) over U can be defined as:
E = { x , h E ( x ) : x U } ,
where h E ( x ) 2 [ 0 , 1 ] is a set of values in [ 0 , 1 ] , denoting the possible membership degrees of the element x U to the set E. For simplicity, h E ( x ) , called a hesitant fuzzy element (HFE), is abbreviated as h ( x ) or h in this paper. Suppose the set of all hesitant fuzzy sets (HFSs) on U is denoted by H ( U ) . Obviously, E H ( U ) . The complement of E is denoted as E C , h E C ( x ) = h C ( x ) = { 1 h : h h ( x ) } .
Considering the randomness of values in the HFS and that the number of them in different HFSs may be unequal, we stipulate that h ( x ) represents the number of the possible membership degrees in h ( x ) , h ( x ) = { h σ ( 1 ) ( x ) , h σ ( 2 ) ( x ) , , h σ ( n ) ( x ) } which implies that h ( x ) is arranged in increasing order, where n = h ( x ) and h σ ( j ) ( x ) ( j = 1 , 2 , , n ) is the j t h minimum value in h ( x ) . On this basis, the following criterion [7,8,34] can be obtained.
Definition 2.
For a given HFE h, S ( h ) = 1 h j = 1 h h σ ( j ) is called the score function of h, where h is the number of elements in h, and we specify that 0 0 = 0 . For two HFEs, h 1 and h 2 , we have the following comparison rules: if S ( h 1 ) > S ( h 2 ) , then h 1 h 2 ; if S ( h 1 ) = S ( h 2 ) , then h 1 h 2 ; if S ( h 1 ) S ( h 2 ) , then h 1 h 2 . Otherwise, it is the opposite. It is important to note that the " " and " " indicate preference relations here.
Remark 1.
(1) E is referred to as an empty HFS [3] if h ( x ) = { 0 } for all x in U, and the empty HFS is denoted by ϕ in this paper.
(2) E is referred to as a full HFS [3] if h ( x ) = { 1 } for all x in U, and the empty HFS is denoted by U in this paper.

2.2. Graded Rough Set

Let U be a reference set and R be an equivalence relation of U × U . The equivalence relation R induces a partition of U, denoted by U / R = { [ x ] R : x U } , where [ x ] R represents the equivalence class of x with regard to R. In a Pawlak rough set, an arbitrary subset X of U can characterized by the upper approximation R ¯ ( X ) = { x U : [ x ] R X } = { [ x ] R : [ x ] R X } and the lower approximation R ̲ ( X ) = { x U : [ x ] R X } = { [ x ] R : [ x ] R X } . Furthermore, suppose k is a non-negative integer and is called grade, the grade k upper and lower approximations of X are defined as follows [36]:
R ¯ k ( X ) = { x U : | [ x ] R X | > k } = { [ x ] R U / R : | [ x ] R X | > k } , R ̲ k ( X ) = { x U : | [ x ] R | | [ x ] R X | k } = { [ x ] R U / R : | [ x ] R | | [ x ] R X | k } .
If R ¯ k ( X ) = R ̲ k ( X ) , then X is called a definable set by grade k; otherwise, X is called a rough set by grade k. R ¯ k and R ̲ k are called grade k upper and lower approximation operators, respectively. They have the following properties:
(1)
R ¯ k ( ϕ ) = ϕ , R ̲ k ( ϕ ) = { x U : | [ x ] R | k } ;
(2)
R ¯ k ( U ) = { x U : | [ x ] R | > k } , R ̲ k ( U ) = U ;
(3)
R ¯ k ( X C ) = ( R ̲ k ( X ) ) C , R ̲ k ( X C ) = ( R ¯ k ( X ) ) C ;
(4)
k 1 R ¯ k ( X ) R ¯ 1 ( X ) , R ̲ k ( X ) R ̲ 1 ( X ) .
In particular, R ¯ k ( X ) = R ¯ ( X ) and R ̲ k ( X ) = R ̲ ( X ) when k = 0 , and the GRS model degenerates into the classical Pawlak rough set model. We have to point out here that the inclusion relationship between R ¯ k ( H ) and R ̲ k ( H ) is generally unfounded.
P O S k ( X ) = R ¯ k ( X ) R ̲ k ( X ) ; N E G k ( X ) = ( R ¯ k ( X ) R ̲ k ( X ) ) C ;
U B N k ( X ) = R ¯ k ( X ) R ̲ k ( X ) ; L B N k ( X ) = R ̲ k ( X ) R ¯ k ( X ) ;
B N D k ( X ) = U B N k ( X ) L B N k ( X )
are called the grade k positive region, negative region, upper boundary region, lower boundary region, and boundary region with respect to X, respectively.

2.3. Variable Precision Rough Set

Inspired by [31], the loss function of a decision-theoretic rough set (DTRS) is considered in particular and then the probability approximations of the variable precision rough set (VPRS) model can be obtained according to the decision rules. As an extension model of the Pawlak rough set, the VPRS model is an effective tool to characterize the upper and lower approximations of Bayesian decision process using the conditional probability and two thresholds α and β . We will briefly introduce the concept of the VPRS which can be confirmed in [31,33]
In accordance with the Bayesian decision procedure, suppose that Ω = { A , A C } and A = { a 1 , a 2 , a 3 } are a finite set of states and a finite set of three possible actions, respectively. For convenience, A and A C are recorded as A 1 and A 2 , respectively. P ( A j | x ) ( j = 1 , 2 ) are the conditional probabilities of an object x being in state A given that the object is described by x. λ ( a i | A j ) ( i = 1 , 2 , 3 ; j = 1 , 2 ) express the loss or cost for taking action a i when the states are A j . Moreover, the expected loss function associated with the action a i is R ( a i | x ) = j = 1 2 λ ( a i | A j ) P ( A j | x ) ( i = 1 , 2 , 3 ; j = 1 , 2 ) , which represents the expected loss of action a i under the state A j . Then, the minimum risk decision rules are as follows:
( P 0 ) If R ( a 1 | [ x ] ) R ( a 2 | [ x ] ) and R ( a 1 | [ x ] ) R ( a 3 | [ x ] ) , decide x P O S ( A ) ;
( N 0 ) If R ( a 1 | [ x ] ) R ( a 2 | [ x ] ) and R ( a 2 | [ x ] ) R ( a 3 | [ x ] ) , decide x N E G ( A ) ;
( B 0 ) If R ( a 3 | [ x ] ) R ( a 1 | [ x ] ) and R ( a 3 | [ x ] ) R ( a 2 | [ x ] ) , decide x B N D ( A ) .
A special case of loss function and calculation rules of parameters α , β , and γ are considered as follows: ( λ P N λ B N ) ( λ N P λ B P ) ( λ B N λ N N ) ( λ B P λ P P ) , and α = λ P N λ B N ( λ B P λ B N ) ( λ P P λ P N ) , β = λ B N λ N N ( λ N P λ N N ) ( λ B P λ B N ) , γ = λ P N λ N N ( λ N P λ N N ) ( λ P P λ P N ) . Then, we can derive α γ β and the following minimum risk decision rules:
( P ) If P ( A | [ x ] ) α , then decide x P O S ( A ) ;
( N ) If P ( A | [ x ] ) β , then decide x N E G ( A ) ;
( B ) If β < P ( A | [ x ] ) < α , then decide x B N D ( A ) .
Meanwhile, the upper and lower approximations with respect to X of the VPRS model are obtained as follows:
R ( α , β ) ¯ ( X ) = { x U : P ( X | [ x ] R ) > β } ; R ( α , β ) ̲ ( X ) = { x U : P ( X | [ x ] R ) α } ,
where P ( X | [ x ] R ) = | [ x ] R X | | [ x ] R | refers to the relative number of the elements belonging to X in equivalence class [ x ] R . P O S ( α , β ) ( X ) = R ( α , β ) ̲ ( X ) , N E G ( α , β ) ( X ) = ( R ( α , β ) ¯ ( X ) ) C , and B N D ( α , β ) ( X ) = R ( α , β ) ¯ ( X ) R ( α , β ) ̲ ( X ) are the positive region, negative region, and boundary region with respect to X, respectively.

2.4. Double-Quantitative Decision-Theoretic Rough Fuzzy Set

With a view to the method of information fusion that can improve fault-tolerance ability, Fan and Xu et al. [35] proposed two models that combine logical composite operators and logical disjunctive operators. The details mentioned below refer to [46]. It should be pointed out that 0 β < α < 1 , X ˜ F ( U ) for any x U , where the F ( U ) stands for all fuzzy sets of U.
The first kind of double-quantitative decision-theoretic rough fuzzy set (Dq-DTRFS) model called the logical conjunction Dq-DTRFS model (∧-Dq-DTRFS) is denoted by ( U , R k ( α , β ) ¯ ( X ˜ ) , R k ( α , β ) ̲ ( X ˜ ) ) , where R k ( α , β ) ¯ and R k ( α , β ) ̲ are approximation operators. For a fuzzy set X ˜ , the corresponding upper and lower approximations are
R k ( α , β ) ¯ ( X ˜ ) = { x U : P ( X ˜ | [ x ] R ) > β , Σ y [ x ] R X ˜ ( y ) > k } ; R k ( α , β ) ̲ ( X ˜ ) = { x U : P ( X ˜ | [ x ] R ) α , Σ y [ x ] R ( 1 X ˜ ( y ) ) k } ,
and the positive region, negative region, upper and lower boundary region with respect to X ˜ are defined as follows:
P O S k ( X ˜ ) = R k ( α , β ) ¯ ( X ˜ ) R k ( α , β ) ̲ ( X ˜ ) ; N E G k ( X ˜ ) = ( R k ( α , β ) ¯ ( X ˜ ) R k ( α , β ) ̲ ( X ˜ ) ) C ;
U B N k ( X ˜ ) = R k ( α , β ) ¯ ( X ˜ ) R k ( α , β ) ̲ ( X ˜ ) ; L B N k ( X ˜ ) = R k ( α , β ) ̲ ( X ˜ ) R k ( α , β ) ¯ ( X ˜ ) .
Naturally, we have the following decision rules for the ∧-Dq-DTRFS model:
D e s ( [ x ] R ) D e s P k ( X ˜ ) , for x P O S k ( X ˜ ) ;
D e s ( [ x ] R ) D e s N k ( X ˜ ) , for x N E G k ( X ˜ ) ;
D e s ( [ x ] R ) D e s U B k ( X ˜ ) , for x U B N k ( X ˜ ) ;
D e s ( [ x ] R ) D e s L B k ( X ˜ ) , for x L B N k ( X ˜ ) .
The second kind of Dq-DTRFS model called the logical disjunction Dq-DTRFS model (∨-Dq-DTRFS) is denoted by ( U , R k ( α , β ) ¯ ( X ˜ ) , R k ( α , β ) ̲ ( X ˜ ) ) , where R k ( α , β ) ¯ and R k ( α , β ) ̲ are approximation operators. For a fuzzy set X ˜ , the corresponding upper and lower approximations are
R k ( α , β ) ¯ ( X ˜ ) = { x U : P ( X ˜ | [ x ] R ) > β o r Σ y [ x ] R X ˜ ( y ) > k } ; R k ( α , β ) ̲ ( X ˜ ) = { x U : P ( X ˜ | [ x ] R ) α o r Σ y [ x ] R ( 1 X ˜ ( y ) ) k } ,
and the positive region, negative region, upper and lower boundary regions with respect to X ˜ are defined as follows:
P O S k ( X ˜ ) = R k ( α , β ) ¯ ( X ˜ ) R k ( α , β ) ̲ ( X ˜ ) ; N E G k ( X ˜ ) = ( R k ( α , β ) ¯ ( X ˜ ) R k ( α , β ) ̲ ( X ˜ ) ) C ;
U B N k ( X ˜ ) = R k ( α , β ) ¯ ( X ˜ ) R k ( α , β ) ̲ ( X ˜ ) ; L B N k ( X ˜ ) = R k ( α , β ) ̲ ( X ˜ ) R k ( α , β ) ¯ ( X ˜ ) .
Naturally, we have the following decision rules for the ∨-Dq-DTRFS model:
D e s ( [ x ] R ) D e s P k ( X ˜ ) , for x P O S k ( X ˜ ) ;
D e s ( [ x ] R ) D e s N k ( X ˜ ) , for x N E G k ( X ˜ ) ;
D e s ( [ x ] R ) D e s U B k ( X ˜ ) , for x U B N k ( X ˜ ) ;
D e s ( [ x ] R ) D e s L B k ( X ˜ ) , for x L B N k ( X ˜ ) .

3. Two Single-Quantitative Models under Hesitant Fuzzy Environment

In real-life applications, the decision makers often struggle to reach agreement on final decision outcomes due to the pursuit of different goals. Apart from that, the discrepancy of the individual status of the decision makers and the different interest orientations lead to complexity in decision-making results, which further enhances the difficulty of group decision-making problems. In order to enhance the scalability and applicability of these models described above, the specific semantics of complex decision problems in the practical application must be considered. Accordingly, it is essential to establish the basic framework of the double-quantitative decision models in a hesitant fuzzy environment (HFEn) in this section.

3.1. Graded Rough Set in HFEn

This subsection establishes the GRS-HFEn model by combining the hesitant fuzzy aggregation operator with the GRS model, and discusses properties of lower and upper approximation operators of GRS-HFEn.
Definition 3.
Let I T = ( U , C S D S , V , F ) be an information table with hesitant fuzzy decision information, where U is a non-empty finite universe. For any H H ( U ) , x U , k is a non-negative integer and called "grade". In the graded rough set model in a hesitant fuzzy environment (GRS-HFEn), the definitions of the upper and lower approximations of set H based on the equivalence relation R are given as follows:
R k ¯ ( H ) = { x U : j = 1 ψ S ψ S σ ( j ) ( x ) > k } = { [ x ] R U / R : j = 1 ψ S ψ S σ ( j ) ( x ) > k } ; R k ̲ ( H ) = { x U : j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C k } = { [ x ] R U / R : j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C k } ,
where ψ S ( x ) = { S ( H ( x ) ) : x [ x ] R } . H ( U ) denotes all hesitant fuzzy subsets of U, ψ S σ ( j ) ( x ) indicates the j t h minimum value in ψ S ( x ) , and ψ S is the number of the elements of ψ S ( x ) . If R k ¯ ( H ) = R k ̲ ( H ) , then H is called an accurate set, otherwise H is called a rough set. R k ¯ and R k ̲ are upper and lower approximation operators, respectively.
Proposition 1.
Let I T = ( U , C S D S , V , F ) be an information table with hesitant fuzzy decision information, where U represents a non-empty finite universe. For any x U , k is a non-negative integer and called "grade". The following properties are satisfied:
( 1 ) R k ¯ ( ϕ ) = ϕ , R k ̲ ( ϕ ) = { x U : ψ S ( x ) k } ;
( 2 ) R k ¯ ( U ) = { x U : ψ S ( x ) > k } , R k ̲ ( U ) = U ;
( 3 ) R k ¯ ( H C ) = ( R k ̲ ( H ) ) C , R k ̲ ( H C ) = ( R k ¯ ( H ) ) C ;
( 4 ) k 1 R k ¯ ( H ) R 1 ¯ ( H ) , R k ̲ ( H ) R 1 ̲ ( H ) .
Proof. 
It is not difficult to obtain that (1) and (2) are valid by Definition 3. The proof processes of (3) and (4) are presented as follows:
(3) By the definition of the complement set h E C ( x ) of E in Definition 1 and the definition of score function S ( h ) of h in Definition 2, we can know that S ( h C ( x ) ) = 1 h j = 1 h ( h σ ( j ) ( x ) ) C . Then, we can obtain that R k ¯ ( H C ) = { x U : j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C > k } = ( R k ̲ ( H ) ) C by ψ S ( x ) = { S ( H C ( x ) ) : x [ x ] R } . Thus, the first equation in (3) has been proved. The proof of the second equation in (3) can be verified similarly.
(4) " " When it is clear that k 1 , on the one hand, we have j = 1 ψ S ψ S σ ( j ) ( x ) > k 1 if any x R k ¯ ( H ) . That is to say, j = 1 ψ S ψ S σ ( j ) ( x ) > 1 . Thus, we can find that x R 1 ¯ ( H ) by Definition 3. On the other hand, we can obtain that j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C 1 if any x R 1 ̲ ( H ) , then we deduce that j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C k . Therefore, we derive that x R k ̲ ( H ) . With the above analysis, it shows that the sufficiency is tenable.
" " Analogously, the necessity can also be proved.
Analogously, the positive region, negative region, upper boundary region, lower boundary region, and boundary region with respect to hesitant fuzzy set H are as follows:
P O S k ( H ) = R k ¯ ( H ) R k ̲ ( H ) ;
N E G k ( H ) = ( R k ¯ ( H ) R k ̲ ( H ) ) C ;
U B N k ( H ) = R k ¯ ( H ) R k ̲ ( H ) ;
L B N k ( H ) = R k ̲ ( H ) R k ¯ ( H ) ;
B N D k ( H ) = U B N D k ( X ) L B N D k ( H ) .
Corollary 1.
Let U be a non-empty finite universe, R represents the equivalence relation on U, and, for each H H ( U ) , we have the following conclusion:
H   i s   a   a c c u r a t e   s e t   ϕ B N D k ( H ) = ϕ
.
Proof. 
It is only proof of sufficiency because definitions of the accurate set and the B N D k ( H ) show that the necessity is clear. It is easy to verify that B N D k ( H ) = ϕ if and only if U B N k ( H ) L B N k ( H ) = ϕ . Therefore, we can clearly obtain that U B N k ( H ) = ϕ and L B N k ( H ) = ϕ , that is, U B N k ( H ) = R k ¯ ( H ) R k ̲ ( H ) = ϕ and L B N k ( H ) = R k ̲ ( H ) R k ¯ ( H ) = ϕ . Accordingly, R k ̲ ( H ) = R k ¯ ( H ) . □
Corollary 2.
The number of values of the membership degree will become 1 if H is degenerated into an original fuzzy set X ˜ F ( U ) , then the GRS-HFEn model can be degenerated into the form of the GRFS model [46]. In light of the conclusions in [46], the GRFS model is extended from the original GRS model, so we can be sure that the GRS-HFEn model is an extended form of the GRS model.
Proof. 
The corresponding proof refers to [46]. □

3.2. Variable Precision Rough Set in HFEn

Benefiting from the Bayesian decision theory and the original probability approximations, this subsection mainly discusses the VPRS-HFEn model, which is a generalization model of VPRSs in the practical application.
Let U be a non-empty finite universe, R be an equivalence relation of U, and P be probabilistic measure. For any H H ( U ) , P ( H | [ x ] R ) can be explained as the conditional probability of the event H given the description [ x ] R . The definition of the P ( H | [ x ] R ) is as follows:
P ( H | [ x ] R ) = j = 1 ψ S ψ S σ ( j ) ( x ) ψ S ,
where ψ S ( x ) = { S ( H ( x ) ) : x [ x ] R } . ψ S σ ( j ) ( x ) indicates the j t h minimum value in ψ S ( x ) and ψ S is the number of elements of ψ S ( x ) . It needs to be pointed out that P ( H | [ x ] R ) + P ( H C | [ x ] R ) = 1 is always true.
It is necessary to note that P ( X ˜ | [ x ] R ) = y [ x ] R X ˜ ( y ) | [ x ] R | when H degenerates into a traditional fuzzy set X ˜ F ( U ) , and the F ( U ) means all fuzzy sets of U. It is consistent with the conditional probabilistic measure in [46], so it can be concluded that P ( X ˜ | [ x ] R ) is a special case of P ( H | [ x ] R ) in this paper, in other words, P ( H | [ x ] R ) is a generalization of P ( X ˜ | [ x ] R ) . The literature [46] indicates that the P ( X | [ x ] R ) is a special case of the P ( X ˜ | [ x ] R ) when fuzzy set X ˜ degenerates into a classical set X. Therefore, P ( X | [ x ] R ) is a special case of the P ( H | [ x ] R ) , that is, the P ( H | [ x ] R ) is an extended form of the P ( X | [ x ] R ) .
Suppose Ω = { H , H C } and A = { a P , a B , a N } are a finite set of states and a finite set of three possible actions, respectively. Ω = { H , H C } represents that an element x, whether in object set X, a P , a B , and a N , symbolizes x P O S ( H ) , x B N D ( H ) , and x N E G ( H ) when classifying object x, respectively. A description of the risk or cost of taking different actions under different conditions is shown in Table 1.
Where h λ P P , h λ B P , h λ N P are loss degrees induced by actions a P , a B , a N , respectively. Then, h λ P P , h λ B P , h λ N P are numbers of h λ P P , h λ B P , h λ N P , respectively. Similarly, h λ P N , h λ B N , h λ N N are loss degrees suffered by actions a P , a B , a N , respectively. Then, h λ P N , h λ B N and h λ N N are numbers of h λ P N , h λ B N , and h λ N N , respectively. In addition, there is a reality that the nether expected losses can be found:
R ( a P | [ x ] R ) = h λ P P P ( H | [ x ] R ) + h λ P N P ( H C | [ x ] R ) ; R ( a N | [ x ] R ) = h λ N P P ( H | [ x ] R ) + h λ N N P ( H C | [ x ] R ) ; R ( a B | [ x ] R ) = h λ B P P ( H | [ x ] R ) + h λ B N P ( H C | [ x ] R ) .
By the statement in [34], it is easy to see α ( 0 , 1 ] , β [ 0 , 1 ) , and γ ( 0 , 1 ) when we make reasonable assumptions about loss functions h λ P P h λ B P h λ N P and h λ N N h λ B N h λ P N to simplify classification rules. Meanwhile, they are prerequisites for the VPRS-HFEn model in this article. Going a step further, minimum-risk hesitant fuzzy decision rules are written as:
( P 1 ) If P ( H | [ x ] R ) α and P ( H | [ x ] R ) γ , then decide x P O S ( H ) ;
( N 1 ) If P ( H | [ x ] R ) β and P ( H | [ x ] R ) γ , then decide x N E G ( H ) ;
( B 1 ) If P ( H | [ x ] R ) α and P ( H | [ x ] R ) β , then decide x B N D ( H ) .
The calculation of parameters α , β , and γ are recommended to follow several rules:
α = S ( h λ P N ) S ( h λ B N ) ( S ( h λ B P ) S ( h λ B N ) ) ( S ( h λ P P ) S ( h λ P N ) ) ;
β = S ( h λ B N ) S ( h λ N N ) ( S ( h λ N P ) S ( h λ N N ) ) ( S ( h λ B P ) S ( h λ B N ) ) ;
γ = S ( h λ P N ) S ( h λ N N ) ( S ( h λ N P ) S ( h λ N N ) ) ( S ( h λ P P ) S ( h λ P N ) ) .
If the corresponding score functions and loss functions satisfy the condition ( S ( h λ P N ) S ( h λ B N ) ) ( S ( h λ N P ) S ( h λ B P ) ) ( S ( h λ B N ) S ( h λ N N ) ) ( S ( h λ B P ) S ( h λ P P ) ) , then we can obtain that β γ α , even in the case of 0 β < γ < α 1 when α > β . Three decision rules of the VPRS-HFEn model can be written as follows:
( P 2 ) If P ( H | [ x ] R ) α , decide x P O S ( H ) ;
( N 2 ) If P ( H | [ x ] R ) β , decide x N E G ( H ) ;
( B 2 ) If β < P ( H | [ x ] R ) < α , decide x B N D ( H ) .
On the basis of the above rules, the probability rough approximations in HFEn can be formed. The upper and lower approximations of the new VPRS-HFEn model are defined as below:
R ( α , β ) ¯ ( H ) = { x U : P ( H | [ x ] R ) > β } ; R ( α , β ) ̲ ( H ) = { x U : P ( H | [ x ] R ) α } .
If R ( α , β ) ¯ ( H ) = R ( α , β ) ̲ ( H ) , then H is a definable set, otherwise H is rough. R ( α , β ) ¯ and R ( α , β ) ̲ are upper and lower approximation operators, respectively. In light of α > β , it should be noted that the lower approximation must be included in the upper approximation in this model. The positive region, negative region, and boundary region with respect to hesitant fuzzy set H are as follows:
P O S ( α , β ) ( H ) = R ( α , β ) ¯ ( H ) R ( α , β ) ̲ ( H ) ;
N E G ( α , β ) ( H ) = ( R ( α , β ) ¯ ( H ) R ( α , β ) ̲ ( H ) ) C ;
B N D ( α , β ) ( H ) = R ( α , β ) ¯ ( H ) R ( α , β ) ̲ ( H ) .
Theorem 1.
The previous upper and lower approximations with respect to H under equivalence relation R in the VPRS-HFEn model can be re-arranged as follows:
R ( α , β ) ¯ ( H ) = { x U : j = 1 ψ S ψ S σ ( j ) ( x ) > β ψ S } ; R ( α , β ) ̲ ( H ) = { x U : j = 1 ψ S ψ S σ ( j ) ( x ) α ψ S } ,
where ψ S ( x ) = { S ( H ( x ) ) : x [ x ] R } , ψ S σ ( j ) ( x ) indicates the j t h minimum value in ψ S ( x ) and ψ S is the number of the elements of ψ S ( x ) .
Proof. 
It can be confirmed by the definitions of P ( H | [ x ] R ) and the definitions of upper and lower approximations R ( α , β ) ¯ ( H ) and R ( α , β ) ̲ ( H ) . □
Proposition 2.
The following basic properties hold for the upper and lower approximations of the VPRS-HFEn model:
(1) 
R ( α , β ) ¯ ( ϕ ) = R ( α , β ) ̲ ( ϕ ) = ϕ ;
(2) 
R ( α , β ) ¯ ( U ) = R ( α , β ) ̲ ( U ) = U ;
(3) 
R ( α , β ) ̲ ( H ) R ( α , β ) ¯ ( H ) .
Proof. 
It is easy to confirm (1) and (2) for α > β by the definition of the upper and lower approximations in the VPRS-HFEn model. The proof process of (3) is as follows: Based on α > β , we deduce that α ψ S > β ψ S and, consequently, x R ( α , β ) ¯ ( H ) if x R ( α , β ) ̲ ( H ) . To sum up, R ( α , β ) ̲ ( H ) R ( α , β ) ¯ ( H ) has been completed. □
Corollary 3.
The number of values of the membership degree will become 1 if H is degenerated into an original fuzzy set X ˜ F ( U ) , the VPRS-HFEn model can be degenerated into the form of the DTRFS model [46]. On account of conclusions in [46], the DTRFS model is extended from the DTRS model. Therefore, we can obtain that the VPRS-HFEn model is an extended model of the VPRS model.

4. Double-Quantitative Decision-Making Models in HFEn

In this section, according to the basic framework of the established model, we construct two double-quantitative decision-making models with logical conjunction operation and logical disjunction operation, respectively. As shown in Figure 2, from the perspective of improving fault-tolerance ability, the relative and absolute quantitative information, logical conjunction operation, and logical disjunction operation will be considered in a staggered manner. The new models effectively avoid the singleness of information selection in the previous two quantification models, but also enhance the fault-tolerance ability in the application. Meanwhile, the new model also takes into account the subjective assumptions and hesitations of decision makers. The feasibility and effectiveness of the original models are greatly improved in this way, and the two new models have strong desirability and applicability in many fields, such as data mining, machine learning, and group decision making.

4.1. Model 1: A Double-Quantitative Method for Decision Models Based on Conjunction Operation in HFEn

Based on the above analysis, we need to take the conjunction operation into account to combine the previous two single-quantitative models, i.e., the VPRS-HFEn model and the GRS-HFEn model. Then, a new model named Model 1 will be formed and denoted by ( U , R I ¯ ( H ) , R I ̲ ( H ) ) .
Definition 4.
Let I T = ( U , C S D S , V , F ) be a hesitant fuzzy decision information system where U is a non-empty finite universe. For any H H ( U ) , x U , 0 β < α 1 , furthermore, k is a non-negative integer, which satisfies the condition 0 k ψ S . In Model 1, the upper and lower approximations with respect to H based on the equivalence relation R are given as follows:
R I ¯ ( H ) = R k ( α , β ) ¯ ( H ) = { x U : P ( H | [ x ] R ) > β j = 1 ψ S ψ S σ ( j ) ( x ) > k } , R I ̲ ( H ) = R k ( α , β ) ̲ ( H ) = { x U : P ( H | [ x ] R ) α j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C k } ,
where ψ S ( x ) = { S ( H ( x ) ) : x [ x ] R } . ψ S σ ( j ) ( x ) indicates the j t h minimum value in ψ S ( x ) and ψ S represents the number of elements in ψ S ( x ) . R I ¯ and R I ̲ refer to the upper and lower approximation operators, respectively. Furthermore, the positive region, negative region, upper boundary region, lower boundary region, and boundary region with respect to H are obtained by the upper approximation R I ¯ ( H ) and lower approximation R I ̲ ( H ) :
P O S I ( H ) = R I ¯ ( H ) R I ̲ ( H ) ;
N E G I ( H ) = ( R I ¯ ( H ) R I ̲ ( H ) ) C ;
U B N I ( H ) = R I ¯ ( H ) R I ̲ ( H ) ;
L B N I ( H ) = R I ̲ ( H ) R I ¯ ( H ) ;
B N D I ( H ) = U B N I ( H ) L B N I ( H ) .
Remark 2.
It is obvious that R I ¯ ( H ) = R k ¯ ( H ) R ( α , β ) ¯ ( H ) and R I ̲ ( H ) = R k ̲ ( H ) R ( α , β ) ̲ ( H ) .
Theorem 2.
By definitions of P ( H | [ x ] R ) and the complementary set of the HFS above, the previous upper and lower approximations with respect to set H under equivalence relation R in Model 1 can be re-arranged as follows:
R I ¯ ( H ) = { x U : j = 1 ψ S ψ S σ ( j ) ( x ) > { k β ψ S } } , R I ̲ ( H ) = { x U : j = 1 ψ S ψ S σ ( j ) ( x ) { ( ψ S k ) α ψ S } } ,
where ψ S ( x ) = { S ( H ( x ) ) : x [ x ] R } . ψ S σ ( j ) ( x ) indicates the j t h minimum value in ψ S ( x ) and ψ S represents the number of elements in ψ S ( x ) .
Proof. 
Here is only a proof of the lower approximation. Since P ( H | [ x ] R ) = j = 1 ψ S ψ S σ ( j ) ( x ) ψ S , i = 1 ψ S ψ S σ ( j ) ( x ) > α ψ S can be easily obtained. Then, considering the definition of the complementary set of the HFS, the equation j = 1 ψ S ψ S σ ( j ) ( x ) = ψ S j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C holds. Therefore, it is clear that the above inequalities are true. □
Corollary 4.
If H is degenerated into a original fuzzy set X ˜ F ( U ) , then
R I ¯ ( X ˜ ) = R k ( α , β ) ¯ ( X ˜ ) = { x U : P ( X ˜ | [ x ] R ) > β y [ x ] R X ˜ ( y ) > k } , R I ̲ ( X ˜ ) = R k ( α , β ) ̲ ( X ˜ ) = { x U : P ( X ˜ | [ x ] R ) α y [ x ] R ( 1 X ˜ ( y ) ) k } ,
where the F ( U ) means all fuzzy sets of U. Obviously, it is consistent with the research conclusion of the D q D T R F S model defined in [35], so Model 1 in this paper is a generalization of the D q D T R F S model. From Corollary 3.1 in [35], it can be seen that when α = 1 , β = 0 , and k = 0 , if a fuzzy set X ˜ degenerates into a classical set X, then the D q D T R F S model will degenerate into a Pawlak rough set. Therefore, Model 1 in this article is an extended model of a Pawlak rough set.
By Theorem 1 and the idea of minimum risk decision in the Bayesian decision procedure, it can be concluded that the decision rules in Model 1 can be organized as follows:
(1)
When k α ψ S , it is easy to validate that k α ψ S > β ψ S ψ S k and U B N I ( H ) cannot be determined in this situation, so we can obtain decision rules as below:
( P O S I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) > k ,   then   decide   x P O S I ( H ) ; ( N E G I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) < α ψ S ,   then   decide   x N E G I ( H ) ; ( L B N I )   If   α ψ S j = 1 ψ S ψ S σ ( j ) ( x ) k ,   then   decide   x L B N I ( H ) .
(2)
When k < α ψ S , we cannot accurately judge the four regions and L B N I ( H ) cannot be determined in this situation, and the following are discussed in two cases.
When k β ψ S , it is easy to validate that the decision rules can be expressed as:
( P O S I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) ψ S k ,   then   decide   x P O S I ( H ) ; ( N E G I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) β ψ S ,   then   decide   x N E G I ( H ) ; ( L B N I )   If   β ψ S < j = 1 ψ S ψ S σ ( j ) ( x ) < ψ S k ,   then   decide   x U B N I ( H ) .
When k > β ψ S , it is easy to validate that the decision rules are expressed as:
( P O S I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) α ψ S ,   then   decide   x P O S I ( H ) ; ( N E G I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) k ,   then   decide   x N E G I ( H ) ; ( L B N I )   If   k < j = 1 ψ S ψ S σ ( j ) ( x ) < α ψ S ,   then   decide   x U B N I ( H ) ,
where ψ S ( x ) = { S ( H ( x ) ) : x [ x ] R } , ψ S σ ( j ) ( x ) indicates the j t h minimum value in ψ S ( x ) and ψ S represents the number of elements in ψ S ( x ) .
The reasoning process of the above classification is stated as follows. According to α + β = 1 and α > β , we can obtain that α ψ S > β ψ S , and validate that k α ψ S ψ S k β ψ S . Therefore, it is true for k α ψ S that k α ψ S > β ψ S ψ S k ; meanwhile, we can validate that k < α ψ S ψ S k > β ψ S , and k β ψ S α ψ S ψ S k . Then, it is true for k < α ψ S and k β ψ S , thus k β ψ S < α ψ S ψ S k .

4.2. Model 2: A Double-Quantitative Method for Decision Models Based on Disjunction Operation in HFEn

In this subsection, we intend to take the disjunction operation into account to combine the previous two single-quantitative models. Then, a new model called Model 2 will be formed and denoted by ( U , R I I ¯ ( H ) , R I I ̲ ( H ) ) .
Definition 5.
Let I T = ( U , C S D S , V , F ) be a hesitant fuzzy decision information system where U is a non-empty finite universe. For any H H ( U ) , x U , 0 β < α 1 and, furthermore, k is a non-negative integer, which satisfies the condition 0 k ψ S . In Model 2, the upper and lower approximations of set H based on the equivalence relation R are given as follows:
R I I ¯ ( H ) = R k ( α , β ) ¯ ( H ) = { x U : P ( H | [ x ] R ) > β j = 1 ψ S ψ S σ ( j ) ( x ) > k } , R I I ̲ ( H ) = R k ( α , β ) ̲ ( H ) = { x U : P ( H | [ x ] R ) α j = 1 ψ S ( ψ S σ ( j ) ( x ) ) c k } ,
where ψ S ( x ) = { S ( H ( x ) ) : x [ x ] R } . ψ S σ ( j ) ( x ) indicates the j t h minimum value in ψ S and ψ S represents the number of elements in ψ S ( x ) . R I I ¯ and R I I ̲ refer to the corresponding upper and lower approximation operators, respectively. Subsequently, the positive region, negative region, upper boundary region, lower boundary region, and boundary region with respect to H are obtained by the upper approximation R I I ¯ ( H ) and lower approximation R I I ̲ ( H ) :
P O S I I ( H ) = R I I ¯ ( H ) R I I ̲ ( H ) ;
N E G I I ( H ) = ( R I I ¯ ( H ) R I I ̲ ( H ) ) C ;
U B N I I ( H ) = R I I ¯ ( H ) R I I ̲ ( H ) ;
L B N I I ( H ) = R I I ̲ ( H ) R I I ¯ ( H ) ;
B N D I I ( H ) = U B N I I ( H ) L B N I I ( H ) .
Remark 3.
It obvious that R I I ¯ ( H ) = R k ¯ ( H ) R ( α , β ) ¯ ( H ) and R I I ̲ ( H ) = R k ̲ ( H ) R ( α , β ) ̲ ( H ) .
Theorem 3.
By the definitions of P ( H | [ x ] R ) and the complementary set of the HFS above, the previous upper and lower approximations with respect to set H under equivalence relation R in Model 2 can be re-arranged as follows:
R I I ¯ ( H ) = { x U : j = 1 ψ S ψ S σ ( j ) ( x ) > { k β ψ S } } , R I I ̲ ( H ) = { x U : j = 1 ψ S ψ S σ ( j ) ( x ) { α ψ S ( ψ S k ) } } .
Proof. 
The proof is similar to Theorem 2. □
Corollary 5.
If H is degenerated into an original fuzzy set X ˜ F ( U ) , then
R I I ¯ ( X ˜ ) = R k ( α , β ) ¯ ( X ˜ ) = { x U : P ( X ˜ | [ x ] R ) > β y [ x ] R X ˜ ( y ) > k } , R I I ̲ ( X ˜ ) = R k ( α , β ) ̲ ( X ˜ ) = { x U : P ( X ˜ | [ x ] R ) α y [ x ] R ( 1 X ˜ ( y ) ) k } ,
where the F ( U ) represent all fuzzy sets of U. Obviously, it is the same as the research conclusion of the D q D T R F S model which is defined in [35], so Model 2 in this paper is a generalization of the D q D T R F S model. From Corollary 3.2 in [35], it can be obtained that when α = 1 , β = 0 and k = 0 , if a fuzzy set X ˜ degenerates into a classical set X, then the D q D T R F S model can degenerate into a Pawlak rough set. Accordingly, Model 2 in this paper is a generalized model of a Pawlak rough set.
Similar to the conclusion in Section 4.1, we can conclude that the decision rules in Model 2 are as follows:
(1)
When k α ψ S , it is easy to validate that k α ψ S > β ψ S ψ S k and U B N I I ( H ) cannot be determined in this situation, so we can obtain decision rules as below:
( P O S I I ) j = 1 ψ S ψ S σ ( j ) ( x ) > β ψ S x P O S I I ( H ) ; ( N E G I I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) < ψ S k ,   then   decide   x N E G I I ( H ) ; ( L B N I I )   If   ψ S k j = 1 ψ S ψ S σ ( j ) ( x ) β ψ S ,   then   decide   x L B N I I ( H ) .
(2)
When k < α ψ S , we cannot accurately judge the four regions and U B N I I ( H ) cannot be determined in this situation, and the following are discussed in two cases.
When k β ψ S , it is easy to validate that the decision rules can be expressed as:
( P O S I I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) α ψ S ,   then   decide   x P O S I I ( H ) ; ( N E G I I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) k ,   then   decide   x N E G I I ( H ) ; ( L B N I I )   If   k < j = 1 ψ S ψ S σ ( j ) ( x ) < α ψ S ,   then   decide   x U B N I I ( H ) .
When k > β ψ S , it is easy to validate that the decision rules are expressed as:
( P O S I I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) ψ S k ,   then   decide   x P O S I I ( H ) ; ( N E G I I )   If   j = 1 ψ S ψ S σ ( j ) ( x ) β ψ S ,   then   decide   x N E G I I ( H ) ; ( L B N I I )   If   β ψ S < j = 1 ψ S ψ S σ ( j ) ( x ) < ψ S k ,   then   decide   x U B N I I ( H ) .

4.3. The Comparison of the Models 1 and 2

In allusion to the definitions of the two double-quantitative models, we can find out the internal logic connections between the two models. Parameters α , β , and k in the two new models of this paper represent probability and the grade, respectively. It is obvious that α , β [ 0 , 1 ] . In order to obtain a further understanding of the two new models, we will make a detailed analysis of the internal relationship between the two models under the different values of parameters α and β . The discussion falls into three categories: α + β = 1 , α + β < 1 , and α + β > 1 .
Case 1: Consider the relationship between α and β to meet the condition α + β = 1 .
Theorem 4.
If a loss function satisfies h λ P P h λ N P h λ B P , h λ B N h λ N N h λ P N , and ( S ( h λ P N ) S ( h λ B N ) ) ( S ( h λ N P ) S ( h λ B P ) ) > ( S ( h λ B N ) S ( h λ N N ) ) ( S ( h λ B P ) S ( h λ P P ) ) for any x U , H H ( U ) and k N , then it is true that α > 0.5 > β , α = 1 β , and β = 1 α and we can obtain that the following conclusions.
(1) R I ¯ ( H C ) = ( R I I ̲ ( H ) ) C ;
(2) R I ̲ ( H C ) = ( R I I ¯ ( H ) ) C .
Proof. 
The proof for these equations can be supported by Definitions and Theorems of Section 3 and Section 4 as follows:
(1) For the left side of the equation, we know that R I ¯ ( H C ) = R ( α , β ) ¯ ( H C ) R k ¯ ( H C ) based on the Remark in Definition 4. By the definitions of the upper approximations of graded and variable precision rough sets, we deduce that R ( α , β ) ¯ ( H C ) R k ¯ ( H C ) = { x U : P ( H C | [ x ] R ) > β } { x U : ψ S ψ S σ ( j ) ( x ) > k } . According to the definition of P ( H | [ x ] R ) , we are able to confirm that R ( α , β ) ¯ ( H C ) R k ¯ ( H C ) = { x U : ψ S ψ S σ ( j ) ( x ) > β ψ S } { x U : ψ S ψ S σ ( j ) ( x ) > k } = { x U : ψ S σ ( j ) ( x ) < ( 1 β ) ψ S } { x U : ψ S σ ( j ) ( x ) < ψ S k } . After re-arranging the above formula, it can be transformed into { x U : ψ S σ ( j ) ( x ) < { ( 1 β ) ψ S ( ψ S k ) } } = { x U : ψ S σ ( j ) ( x ) < { α ψ S ( ψ S k ) } } .
For the right side, by Definition 5, Definition 3, and definitions of P ( H | [ x ] R ) and R ( α , β ) ̲ ( H ) , ( R I I ̲ ( H ) ) C = ( R ( α , β ) ̲ ( H ) R k ̲ ( H ) ) C = ( R ( α , β ) ̲ ( H ) ) C ( R k ̲ ( H ) ) C = { x U : P ( H | [ x ] R ) < α } { x U : ψ S ψ S σ ( j ) ( x ) > k } = { x U : ψ S σ ( j ) ( x ) < α ψ S } { x U : ψ S σ ( j ) ( x ) < ψ S k } = { x U : ψ S σ ( j ) ( x ) < { α ψ S ( ψ S k ) } } .
With the above analysis, it is shown that Equation (1) is verified.
(2) Analogously, the proof is similar to (1). □
Theorem 5.
If a loss function satisfies h λ P P h λ N P h λ B P , h λ B N h λ N N h λ P N and ( S ( h λ P N ) S ( h λ B N ) ) ( S ( h λ N P ) S ( h λ B P ) ) > ( S ( h λ B N ) S ( h λ N N ) ) ( S ( h λ B P ) S ( h λ P P ) ) for any x U , H H ( U ) , and k N , then it is true that α > 0.5 > β , α = 1 β , and β = 1 α and, furthermore, we can obtain the following conclusions:
(1) 
P O S I ( H C ) = N E G I I ( H ) ;
(2) 
N E G I ( H C ) = P O S I I ( H ) ;
(3) 
U B N I ( H C ) = U B N I I ( H ) ;
(4) 
L B N I ( H C ) = L B N I I ( H ) .
Proof. 
We can prove it easily by Theorem 4. □
Corollary 6.
If loss functions satisfy h λ P P h λ N P h λ B P , h λ B N h λ N N h λ P N , and the condition ( S ( h λ P N ) S ( h λ B N ) ) ( S ( h λ N P ) S ( h λ B P ) ) > ( S ( h λ B N ) S ( h λ N N ) ) ( S ( h λ B P ) S ( h λ P P ) ) , then the semantic interpretation of the decision about H can be interconversion between acceptance and rejection of Models 1 and 2. The specific operations are as follows:
( 1 ) Accepting an object for H C in Model 1 with j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C α ψ S and ( j = 1 ψ S ψ S σ ( j ) ( x ) ) C > { k ( ψ S k ) } also means rejecting an object for H in Model 2 with j = 1 ψ S ψ S σ ( j ) ( x ) α ψ S and j = 1 ψ S ψ S σ ( j ) ( x ) < { k ( ψ S k ) } and vice versa;
( 2 ) rejecting an object for H C in Model 1 with j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C { k β ψ S } and j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C < { α ψ S ( ψ S k ) } is equivalent to accepting an object for H in Model 2 with j = 1 ψ S ψ S σ ( j ) ( x ) < α ψ S } and j = 1 ψ S ψ S σ ( j ) ( x ) > { k ( ψ S k ) } .
Proof. 
It is easy to obtain by Theorem 5. □
Remark 4.
For Case 1, loss functions must satisfy h λ P P h λ N P h λ B P , h λ B N h λ N N h λ P N , and the condition ( S ( h λ P N ) S ( h λ B N ) ) ( S ( h λ B N ) S ( h λ N N ) ) = ( S ( h λ N P ) S ( h λ B P ) ) ( S ( h λ B P ) S ( h λ P P ) ) . The classical rough set is a special case when α = 1 , β = 0 , k = 0 , and H degenerates into a fuzzy set X ˜ .
Case 2: Consider the relationship between α and β to meet the condition α + β < 1 .
Then, we can obtain that α > β and β < 0.5 hold for Case 2, and a loss function must satisfy the following condition:
( S ( h λ P N ) S ( h λ B N ) ) ( S ( h λ B N ) S ( h λ N N ) ) < ( S ( h λ N P ) S ( h λ B P ) ) ( S ( h λ B P ) S ( h λ P P ) ) .
It is worth noting that α 1 β in Case 2, so we no longer have the equivalence of accepting H C in Model 1 and rejecting H in Model 2, nor the equivalence of rejecting H C in Model 1 and accepting H in Model 2. Moreover, the unilateral mirror implications in Case 1 are also uncertain in Case 2. The specific reasons are as follows: Here, we can easily deduce accepting an object for H C in Model 1 with j = 1 ψ S ψ S σ ( j ) ( x ) < ( 1 α ) ψ S , j = 1 ψ S ψ S σ ( j ) ( x ) k , and j = 1 ψ S ψ S σ ( j ) ( x ) < ψ S k , and rejecting an object for H in Model 2 with j = 1 ψ S ψ S σ ( j ) ( x ) β ψ S , j = 1 ψ S ψ S σ ( j ) ( x ) k , and j = 1 ψ S ψ S σ ( j ) ( x ) < ψ S k . However, we cannot determine the relationship between 1 α and β , so the above statements are supported.
Case 3: Consider the relationship between α and β to meet the condition α + β > 1 .
Then, we can obtain that α > β and α > 0.5 hold for Case 3, and a loss function must satisfy the following condition:
( S ( h λ P N ) S ( h λ B N ) ) ( S ( h λ B N ) S ( h λ N N ) ) > ( S ( h λ N P ) S ( h λ B P ) ) ( S ( h λ B P ) S ( h λ P P ) ) .
Similar to the above, the equivalence relationship between accepting H C in Model 1 and rejecting H in Model 2 is the same as the equivalence relationship between rejecting H C in Model 1 and accepting H in Model 2. Moreover, the unilateral mirror implications in Case 1 are also uncertain in Case 3. The specific reasons are the same as those described in Case 2.

5. A Practical Example and Analysis

With the rapid development of social economy, the annual increase in housing prices has become the main vexation of the masses. There is an ingrained thought for most families that buying a home has always been a very important thing. On the one hand, they need to consider whether they can afford the house prices; on the other hand, the views of each family member need to be taken into account. That is to say, everyone is a decision maker. There are a lot of influence factors when buying a house, such as interior design, daylighting, traffic conditions, etc. Everyone has different preferences for various factors when making a decision. For example, the investigation shows that ninety percent of families with children prefer the lighting conditions of the house; families with old people tend to choose a place where the traffic is convenient; and most newlyweds care more about the unique interior design of the house when choosing a house. In this way, it is difficult for family members to reach consensus on decisions. In response to this phenomenon, this paper adopts the idea of three-way decisions. In this section, we use the above example scenario as the basis for the problem description and solution, and further elaborate the details of these utility models with an illustrative example.

5.1. Problem Statement

In combination with the background of the house purchase and the new double-quantitative decision-making models proposed in Section 4, we need to give the definitions of the relevant parameters of the new models. In this context, the set of states Ω = { H , H C } shows whether the house price is within the acceptable range of the family or not. For a given set of actions given by A = { a P , a B , a N } , a P , a B , a N indicate that the buyer’s attitude towards the house is satisfied, hesitant, or disappointed, respectively, when classifying object x. Suppose P ( H | [ x ] ) is the probability that the price of house x is within the affordability of the buyer, the functions h λ P P , h λ B P , h λ N P in Table 1 denote the extent of loss sustained by taking action a P , a B , a N when the price falls within the budget. Similarly, the functions h λ P N , h λ B N , h λ N N represent the degree of loss sustained by taking action a P , a B , a N , respectively, when the price is not within the scope of the budget.
In order to interpret the theories of the two new models, a hesitant fuzzy information system about houses is introduced in this paper. Let I T = ( U , C S D S , V , F ) be an information table with hesitant fuzzy decision information, where U = { x 1 , x 2 , , x 40 } indicate a finite non-empty domain of 40 houses, C S = { D e s i g n , t r a f f i c } and D S = { g e t } are a conditional attribute set and decision attribute set, respectively. Table 2 and Table 3 provide statistical data on the classification of these 40 houses, where ( i , j ) ( i = D e s i g n , j = t r a f f i c ) represents the rank of conditional attributes. The rough set regions will be calculated in the case that k = 1 , 2 , 3 , 4 .

5.2. Analysis of the Problems in GRS-HFEn Model and VPRS-HFEn Model

First of all, we need to sort out the raw data of the houses in Table 2 and analyze them. Then, the related calculation results under the relation R are shown in Table 3.
From the previous relevant concepts and some of the results calculated in Table 3, the values of k are 0, 1, 2, 3, 4, so we can acquire the upper and lower approximations of the GRS-HFEn model under different values of the grade k. Furthermore, the corresponding four regions can also be calculated based on their definitions. Refer to the results in Table 4 and Table 5, respectively.
It should be noted that the following semantic descriptions are applicable to the following models. An object in the positive region shows that the house is satisfactory; on the contrary, the house is unsatisfactory if an object is in the negative region. If an object is in the upper boundary region or in the lower boundary region, it shows that it is not yet determined whether the house is satisfactory, while the former indicates that the uncertainty tends to be satisfactory and the latter is closer to unsatisfactory. For the sake of the analysis of the regions of the VPRS-HFEn model by the losses from the Bayesian decision procedure, as shown in Table 6, we consider the values of the loss function in three cases.
Through the calculation of α and β , the following conclusions can be obtained: for Case 1, α = 0.60 , β = 0.40 ; for Case 2, α = 0.55 , β = 0.25 ; for Case 3, α = 0.75 , β = 0.36 . It is clear that α + β = 1 in Case 1, α + β < 1 in Case 2, and α + β > 1 in Case 3. Then, we discuss these three cases in the VPRS-HFEn model with the idea of Bayesian decision theory. In these three cases, the corresponding upper and lower approximations of H and the four regions can be calculated by their definitions. For the convenience of comparative analysis, the upper and lower approximations and the results of the regions are recorded in Table 7 and Table 8, respectively.
The VPRS-HFEn model and the GRS-HFEn model are two quantification models that describe the inclusion relation between the equivalence class and a basic concept from the perspective of relative and absolute quantitative information. However, it turns out that they are deficient, and the specific reasons to support this statement are expressed as follows.
For the GRS-HFEn model, Section 3 shows that the upper and lower approximations in this model can be defined by i = 1 ψ S ψ S σ ( j ) ( x ) and j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C , respectively. Therefore, a narrative should be established in theory: We can determine the consistency of the classification of two objects from different equivalence classes by the values of i = 1 ψ S ψ S σ ( j ) ( x ) and j = 1 ψ S ( ψ S σ ( j ) ( x ) ) C . As shown in Table 3 and Table 5, there are two types of classification mechanisms, and the specific performance is as follows: For one side, i = 1 ψ S ψ S σ ( j ) ( x 8 ) = i = 1 ψ S ψ S σ ( j ) ( x 13 ) = 1.550 while the values of j = 1 ψ S ( ψ S σ ( j ) ( x 8 ) ) C and i = 1 ψ S ψ S σ ( j ) ( x 13 ) are not equal. Finally, [ x 8 ] R and [ x 13 ] R are divided into the lower boundary region and the negative region, respectively. For [ x 1 ] R and [ x 2 ] R , j = 1 ψ S ( ψ S σ ( j ) ( x 1 ) ) C = j = 1 ψ S ( ψ S σ ( j ) ( x 2 ) ) C = 3.500 when the values of i = 1 ψ S ψ S σ ( j ) ( x 1 ) and i = 1 ψ S ψ S σ ( j ) ( x 2 ) are different, and [ x 1 ] R which satisfies i = 1 ψ S ψ S σ ( j ) ( x 1 ) = 2.500 is divided into the upper boundary region while [ x 2 ] R that satisfies i = 1 ψ S ψ S σ ( j ) ( x 2 ) = 0.500 belongs to the negative region. For the other side, i = 1 ψ S ψ S σ ( j ) ( x 6 ) = i = 1 ψ S ψ S σ ( j ) ( x 7 ) = 0.700 while the values of j = 1 ψ S ( ψ S σ ( j ) ( x 6 ) ) C and j = 1 ψ S ( ψ S σ ( j ) ( x 7 ) ) C are not equal for [ x 6 ] R and [ x 7 ] R . Unlike the previous circumstances, both of them belong to the positive region.
For the VPRS-HFEn model, Section 3 shows that the upper and lower approximations in this model can be defined either by the conditional probability P ( H | [ x ] R ) or by j = 1 ψ S ψ S σ ( j ) ( x ) and ψ S ( x ) . Therefore, the indiscernible relationships between objects in different equivalence classes should be related to P ( H | [ x ] R ) or both j = 1 ψ S ψ S σ ( j ) ( x ) and ψ S ( x ) . We can easily verify the truth of the following narrative: For the values of P ( H | [ x ] R ) , it is clear that P ( H | [ x 3 ] R ) = 0.700 = P ( H | [ x 7 ] R ) , while both [ x 3 ] R and [ x 7 ] R are divided into different regions in three different cases. Both of them belong to positive region in Case 1 and Case 2, however, they belong to the boundary region in Case 3. For values of j = 1 ψ S ψ S σ ( j ) ( x ) and ψ S ( x ) , j = 1 ψ S ψ S σ ( j ) ( x 8 ) = j = 1 ψ S ψ S σ ( j ) ( x 13 ) when ψ S ( x 8 ) ψ S ( x 13 ) , as shown in Table 8, it is clear that the classification results of [ x 8 ] R and [ x 13 ] R are as follows: [ x 8 ] R belongs to the boundary region and [ x 13 ] R belongs to the negative region in Case 1 and Case 3, while both of them belong to the boundary region. The same is true between [ x 6 ] R and [ x 7 ] R , both [ x 7 ] R and [ x 6 ] R belong to the positive region in Case 1 and Case 2, while [ x 7 ] R belongs to the boundary region and [ x 6 ] R belongs to the positive region in Case 3.
In accordance with the above analysis, we can conclude that the GRS-HFEn model and the VPRS-HFEn model are inadequate in distinguishing the relationship between the equivalent classes.

5.3. Decision Analysis of Models 1–2

Similarly, we first calculate the upper and lower approximations of three cases in Models 1 and 2, respectively. We choose the value of k to be 2 for convenience.
Case 1: Considering the relationship between α and β to meet the condition α + β = 0.60 + 0.40 = 1 , the upper and lower approximations in Models 1 and 2 are represented as follows:
R I 1 ¯ ( H ) = U ( [ x 2 ] R [ x 8 ] R [ x 13 ] R ) ;         R I I 1 ¯ ( H ) = U ( [ x 2 ] R [ x 13 ] R ) ;
R I 1 ̲ ( H ) = [ x 3 ] R [ x 7 ] R [ x 6 ] R ;           R I I 1 ̲ ( H ) = [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R .
Accordingly, we can obtain the four regions of Models 1 and 2:
P O S I 1 ( H ) = [ x 3 ] R [ x 7 ] R [ x 6 ] R ;       P O S I I 1 ( H ) = [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R ;
N E G I 1 ( H ) = [ x 2 ] R [ x 8 ] R [ x 13 ] R ;         N E G I I 1 ( H ) = [ x 2 ] R [ x 13 ] R ;
U B N I 1 ( H ) = [ x 12 ] R [ x 1 ] R [ x 4 ] R ;         U B N I I 1 ( H ) = [ x 12 ] R [ x 1 ] R [ x 4 ] R ;
L B N I 1 ( H ) = ϕ .                    L B N I I 1 ( H ) = ϕ .
With regard to the values of the three thresholds, α = 0.60 , β = 0.40 , and k = 2 , Models 1 and 2 have specific quantitative semantics for the relative and absolute degrees in this case. For Model 1, P O S I 1 ( H ) = [ x 3 ] R [ x 7 ] R [ x 6 ] R denotes that the relative degree of the customers belonging to the buyers set exceeds 0.6 and the external grade with respect to the buyers set does not exceed 2. In Model 2, P O S I I 1 ( H ) = [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R denotes that the relative degree of the customers belonging to the buyers set is at least 0.40 and the internal grade with respect to the buyers set exceeds 2. The same analytic procedure can be applied to the negative region, upper boundary region, and lower boundary region in both of the two new models with the thresholds α = 0.60 , β = 0.40 , and k = 2 .
Case 2: Considering the relationship between α and β to meet the condition α + β = 0.55 + 0.25 = 0.80 < 1 , the upper and lower approximations in Models 1 and 2 are represented as follows:
R I 2 ¯ ( H ) = U ( [ x 2 ] R [ x 8 ] R [ x 13 ] R ) ;          R I I 2 ¯ ( H ) = U [ x 2 ] R ;
R I 2 ̲ ( H ) = [ x 3 ] R [ x 7 ] R [ x 6 ] R ;         R I I 2 ̲ ( H ) = [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R .
Accordingly, we can obtain the four regions of Models 1 and 2:
P O S I 2 ( H ) = [ x 3 ] R [ x 7 ] R [ x 6 ] R ;          P O S I I 2 ( H ) = [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R ;
N E G I 2 ( H ) = [ x 2 ] R [ x 8 ] R [ x 13 ] R ;           N E G I I 2 ( H ) = [ x 2 ] R ;
U B N I 2 ( H ) = [ x 12 ] R [ x 1 ] R [ x 4 ] R ;         U B N I I 2 ( H ) = [ x 12 ] R [ x 1 ] R [ x 4 ] R [ x 13 ] R ;
L B N I 2 ( H ) = ϕ .                      L B N I I 2 ( H ) = ϕ .
For Model 1, P O S I 2 ( H ) = [ x 3 ] R [ x 7 ] R [ x 6 ] R denotes that the relative degree of the customers belonging to the buyers set exceeds 0.55 and the external grade with respect to the buyers set does not exceed 2. In Model 2, P O S I I 2 ( H ) = [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R denotes that the relative degree of the customers belonging to the buyers set is at least 0.25 and the internal grade with respect to the buyers set exceeds 2. The same analytic procedure can be applied to the negative region, upper boundary region, and lower boundary region in both of the two new models with the thresholds α = 0.55 , β = 0.25 , and k = 2 .
Case 3: Considering the relationship between α and β to meet the condition α + β = 0.75 + 0.36 = 1.11 > 1 , the upper and lower approximations in Models 1 and 2 are represented as follows:
R I 3 ¯ ( H ) = U ( [ x 2 ] R [ x 8 ] R [ x 13 ] R ) ;       R I I 3 ¯ ( H ) = U ( [ x 2 ] R [ x 13 ] R ) ;
R I 3 ̲ ( H ) = [ x 6 ] R ;             R I I 3 ̲ ( H ) = [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R .
Accordingly, we can obtain the four regions of the Models 1 and 2:
P O S I 3 ( H ) = [ x 6 ] R ;            P O S I I 3 ( H ) = [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R ;
N E G I 3 ( H ) = [ x 2 ] R [ x 8 ] R [ x 13 ] R ;        N E G I I 3 ( H ) = [ x 2 ] R [ x 13 ] R ;
U B N I 3 ( H ) = [ x 12 ] R [ x 1 ] R [ x 4 ] R [ x 3 ] R [ x 7 ] R ;      U B N I I 3 ( H ) = [ x 12 ] R [ x 1 ] R [ x 4 ] R ;
L B N I 3 ( H ) = ϕ .                L B N I I 3 ( H ) = ϕ .
For Model 1, P O S I 3 ( H ) = [ x 6 ] R denotes that the relative degree of the customers belonging to the buyers set exceeds 0.75 and the external grade with respect to the buyers set does not exceed 2. In Model 2, P O S I I 3 ( H ) = [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R denotes that the relative degree of the customers belonging to the buyers set is at least 0.36 and the internal grade with respect to the buyers set exceeds 2. The same analytic procedure can be applied to the negative region, upper boundary region, and lower boundary region in both of the two new models with the thresholds α = 0.75 , β = 0.36 , and k = 2 .
From Table 9, it can be seen that the two new double-quantitative decision models (Models 1 and 2) in the decision-making problems are obviously superior to the previous GRS-HFEn model and the VPRS-HFEn model. The targeted analysis on several pairs of objects extracted in Table 10 will be performed below. Table 10 is the decision results of several pairs of objects extracted specifically from Table 9, and the following is the targeted analysis.
In terms of [ x 8 ] R and [ x 13 ] R , Table 3, Table 5 and Table 8 show the threshold values α = 0.60 , β = 0.40 , and k = 2 in Case 1, and it is clear that j = 1 ψ S ψ S σ ( j ) ( x 8 ) = j = 1 ψ S ψ S σ ( j ) ( x 13 ) . Therefore, [ x 8 ] R and [ x 13 ] R are indiscernible and equal in the GRS-HFEn model. However, we find that they belong to different regions. In Table 10, [ x 8 ] R and [ x 13 ] R belong to the negative region based on Model 1 in Cases 1, 2, and 3. This implies that [ x 8 ] R and [ x 13 ] R are indiscernible in certain conditions. For [ x 7 ] R and [ x 6 ] R , α = 0.75 , β = 0.36 , and k = 2 in Case 3, it is clear that j = 1 ψ S ψ S σ ( j ) ( x 6 ) = j = 1 ψ S ψ S σ ( j ) ( x 7 ) , but we find that [ x 7 ] R belongs to the boundary region and [ x 6 ] R belongs to the positive region in the VPRS-HFEn model. Table 10 shows that both [ x 7 ] R and [ x 6 ] R belong to the positive region in Cases 1, 2, and 3 for Model 2; [ x 7 ] R belongs to the positive region and [ x 6 ] R belongs to the upper boundary region in Case 3 for Model 1. Regarding the result that [ x 7 ] R belongs to the boundary region and [ x 6 ] R belongs to the positive region in the VPRS-HFEn model, the results in Model 1 are more accurate and persuasive. This shows that the two new double-quantitative decision-making models in this paper have more practical application value.
For [ x 1 ] R and [ x 2 ] R , shown in Table 3, Table 5 and Table 10, it is clear that they all have the same results in the GRS-HFEn model, Models 1 and 2. To be specific, [ x 1 ] R belongs to the upper boundary region and [ x 2 ] R belongs to the negative region. This shows that the two new double-quantitative decision-making models do not violate the decision criteria of the GRS-HFEn model.
With regard to [ x 3 ] R and [ x 7 ] R , shown in Table 3, Table 8 and Table 10, it is clear that they have the same value of P ( H | [ x ] R ) . That is, P ( H | [ x 3 ] R ) = P ( H | [ x 7 ] R ) . We can find that [ x 3 ] R and [ x 7 ] R belong to the positive region in Cases 1 and 2, while they belong to the boundary region in Case 3 for the VPRS-HFEn model. It can be seen from Table 10 that both [ x 3 ] R and [ x 7 ] R belong to the positive region in Cases 1, 2, and 3 for Model 2. Meanwhile, [ x 3 ] R and [ x 7 ] R belong to the positive region in Cases 1 and 2, while they belong to the upper boundary region in Case 3 for Model 1. It is once again verified that the decision results in Models 1 and 2 are more accurate than the results in the GRS-HFEn model and the VPRS-HFEn model.
Based on the above analysis, these double-quantitative decision-theoretic models analyze and solve problems from the perspective of relative quantitative information and absolute quantitative information, and provide valuable value for practical application problems in the field of decision analysis.

6. Conclusions

In order to improve the quality of decision making and enhance the effectiveness of decision making in the hesitant fuzzy environment, this paper first extends the classical graded rough set and conditional probability measure in the context of hesitation fuzzy information. On this basis, the variable precision rough set is derived through the Bayesian decision procedure and the idea of minimum decision rules in the hesitant fuzzy environment. Then, two double-quantitative decision-making models are considered systematically by integrating the variable precision rough set model and the graded rough set model in the hesitant fuzzy environment. Furthermore, we discuss the properties of two models and make a comparison from the internal relationship between the two models. The example analysis shows that the double-quantitative decision models not only significantly avoid the singleness of information selection and reduce the influence of the subjective arbitrariness of decision makers, but also effectively depict the target information from the perspective of relative quantification and absolute quantification. Based on the above results, we will further study the incremental feature selection and the dynamic approximation updating of the proposed model in hesitant fuzzy dynamic data sets.

Author Contributions

Funding acquisition, X.Z.; Investigation, X.Z. and Q.Y.; Methodology, X.Z. and Q.Y.; Project administration, X.Z.; Software, Q.Y.; Supervision, X.Z.; Writing—review & editing, Q.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by the National Natural Science Foundation of China (No. 61976245).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Torra, V.; Narukawa, Y. On hesitant fuzzy sets and decision. In Proceedings of the IEEE International Conference on Fuzzy Systems, Jeju, Korea, 20–24 August 2009; pp. 1378–1382. [Google Scholar]
  2. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  3. Deveci, M.; Krishankumar, R.; Gokasar, I.; Deveci, R.T. Prioritization of healthcare systems during pandemics using Cronbachś measure based fuzzy WASPAS approach. Ann. Oper. Res. 2022. [Google Scholar] [CrossRef] [PubMed]
  4. Pamucar, D.; Simic, V.; Lazarevi, D.; Dobrodolac, M.; Deveci, M. Prioritization of Sustainable Mobility Sharing Systems Using Integrated Fuzzy DIBR and Fuzzy-Rough EDAS Model. Sustain. Cities Soc. 2022, 82, 103910. [Google Scholar] [CrossRef]
  5. Torra, V. Hesitant fuzzy sets. Int. J. Intell. Syst. 2010, 25, 529–539. [Google Scholar] [CrossRef]
  6. Garuso, G.; Gattone, S.A.; Fortuna, F.; Battista, T.D. lligCluster Analysis as a Decision-Making Tool: A Methodological Review. Adv. Inteent. Syst. Comput. 2017, 618, 49–55. [Google Scholar]
  7. Xu, Z.S.; Xia, M.M. Distance and Similarity measures for hesitant fuzzy sets. Inf. Sci. 2011, 181, 2128–2138. [Google Scholar] [CrossRef]
  8. Xu, Z.S.; Xia, M.M. Hesitant fuzzy entropy and cross-entropy and their use in multiattribute decision-making. Int. J. Intell. Syst. 2012, 27, 799–822. [Google Scholar] [CrossRef]
  9. Peng, D.H.; Gao, C.Y.; Gao, Z.F. Generalized hesitant fuzzy synergetic weighted distance measures and their application to multiple criteria decision-making. Appl. Math. Model. 2013, 37, 5837–5850. [Google Scholar] [CrossRef]
  10. Xia, M.M.; Xu, Z.S. Hesitant fuzzy information aggregation in decision making. Int. J. Approx. Reason. 2011, 52, 395–407. [Google Scholar] [CrossRef] [Green Version]
  11. Xia, M.M.; Xu, Z.S.; Chen, N. Some hesitant fuzzy aggregation operators with their application in group decision making. Group Decis. Negot. 2013, 22, 259–279. [Google Scholar] [CrossRef]
  12. Xia, M.M.; Xu, Z.S.; Chen, N. Induced aggregation under confidence levels. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 2011, 19, 201–227. [Google Scholar] [CrossRef]
  13. Yu, D.J. Some hesitant fuzzy information aggregation operators based on Einstein operational laws. Int. J. Intell. Syst. 2014, 29, 320–340. [Google Scholar] [CrossRef]
  14. Zhu, B.; Xu, Z.S. Hesitant fuzzy Bonferroni means for multi-criteria decision making. J. Oper. Res. Soc. 2013, 64, 1831–1840. [Google Scholar] [CrossRef]
  15. Zhu, B.; Xu, Z.S.; Xia, M.M. Hesitant fuzzy geometric Bonferroni means. Inf. Sci. 2012, 205, 72–85. [Google Scholar] [CrossRef]
  16. Yu, D.J.; Wu, Y.Y.; Zhou, W. Generalized hesitant fuzzy Bonferroni mean and its application in multi-criteria group decision making. J. Comput. Inf. Syst. 2012, 9, 267–274. [Google Scholar]
  17. Xu, J.P.; Xu, Z.S.; Griffiths, D.; Liao, H.C. An approach to hesitant fuzzy multi-stage multi-criterion decision making. Kybernetes 2014, 43, 1447–1468. [Google Scholar]
  18. Peng, D.H.; Wang, H. Dynamic hesitant fuzzy aggregation operators in multi-period decision making. Kybernetes 2014, 43, 715–736. [Google Scholar] [CrossRef]
  19. Zhang, N.; Wei, G.W. Extension of VIKOR method for decision making problem based on hesitant fuzzy set. Appl. Math. Model. 2013, 37, 4938–4947. [Google Scholar] [CrossRef]
  20. Liao, H.C.; Xu, Z.S. A VIKOR-based method for hesitant fuzzy multi-criteria decision making. Fuzzy Optim. Decis. Mak. 2013, 12, 373–392. [Google Scholar] [CrossRef]
  21. Zhu, B.; Xu, Z.S.; Xu, J.P. Deriving a ranking from hesitant fuzzy preference relations under group decision making. IEEE Trans. Cybern. 2017, 44, 1328–1337. [Google Scholar] [CrossRef]
  22. Liao, H.C.; Xu, Z.S.; Xia, M.M. Multiplicative consistency of hesitant fuzzy preference relation and its application in group decision making. Int. J. Inf. Technol. Decis. Mak. 2014, 13, 47–76. [Google Scholar] [CrossRef]
  23. Xia, M.M.; Xu, Z.S. Managing hesitant information in GDM problems under fuzzy and multiplicative preference relations. Int. J. Uncertain. Fuzziness -Knowl.-Based Syst. 2013, 21, 865–897. [Google Scholar] [CrossRef]
  24. Liao, H.C.; Xu, Z.S. Satisfaction degree based interactive decision making under hesitant fuzzy environment with incomplete weights. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 2014, 22, 505–529. [Google Scholar] [CrossRef]
  25. Farhadinia, B. A novel method of ranking hesitant fuzzy values for multiple attribute decision-making problems. Int. J. Intell. Syst. 2013, 28, 752–767. [Google Scholar] [CrossRef]
  26. Farhadinia, B. A series of score functions for hesitant fuzzy sets. Inf. Sci. 2014, 277, 102–110. [Google Scholar] [CrossRef]
  27. Zhang, X.L.; Xu, Z.S. The TODIM analysis approach based on novel measured functions under hesitant fuzzy environment. Knowl.-Based Syst. 2014, 61, 48–58. [Google Scholar] [CrossRef]
  28. Pawlak, Z. Rough set. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  29. Pawlak, Z. Rough sets: Theoretical aspects of resoning about data. Kluwer Acad. Publ. 1991, 9, 1–8. [Google Scholar]
  30. Yao, Y.Y. Three-Way decisions with probabilistic rough sets. Inf. Scienses 2010, 180, 341–353. [Google Scholar] [CrossRef] [Green Version]
  31. Yao, Y.Y. Three-Way decisions and cognitive computing. Cogn. Comput. 2016, 8, 543–554. [Google Scholar] [CrossRef]
  32. Yao, Y.Y.; Wong, S.K.M.; Lingras, P. A decision-theoretic rough set model. In Proceedings of the 5th International Symposium on Methodologies for Intelligent Systems, Charlotte, NC, USA, 25–27 October 1990; Volume 5, pp. 17–25. [Google Scholar]
  33. Ziarko, W. Variable precision rough set model. J. Comput. Syst. Sci. 1993, 46, 39–59. [Google Scholar] [CrossRef] [Green Version]
  34. Yao, Y.Y. Decision-Theoretic rough set models. In Proceedings of the 2nd International Conference on Rough Sets and Knowledge Technology, Toronto, TN, Canada, 14–16 May 2007; Volume 178, pp. 1–12. [Google Scholar]
  35. Pawlak, Z.; Skowron, A. Rough sets: Some extensions. Inf. Sci. 2007, 177, 28–40. [Google Scholar] [CrossRef] [Green Version]
  36. Ślezak, D.; Ziarko, W. The investigation of the Bayesian rough set model. Int. J. Approx. Reason. 2005, 40, 81–91. [Google Scholar] [CrossRef] [Green Version]
  37. Liang, D.C.; Liu, D. A Novel Risk Decision Making Based on Decision-Theoretic Rough Sets Under Hesitant Fuzzy Information. IEEE Trans. Fuzzy Syst. 2015, 23, 237–247. [Google Scholar] [CrossRef]
  38. Liang, D.C.; Xu, Z.S.; Liu, D. Three-Way decisions based on decision-theoretic rough sets with dual hesitant fuzzy information. Inf. Scienses 2017, 396, 127–143. [Google Scholar] [CrossRef]
  39. Yuan, K.H.; Xu, W.H.; Li, W.T.; Ding, W.P. An incremental learning mechanism for object classificationbased on progressive fuzzy three-way concept. Inf. Sci. 2022, 584, 127–147. [Google Scholar] [CrossRef]
  40. Li, W.T.; Xu, W.H.; Zhang, X.Y.; Zhang, J. Updating approximations with dynamic objects based on local multigranulation rough sets in ordered information systems. Artif. Intell. Rev. 2021, 55, 1821–1855. [Google Scholar] [CrossRef]
  41. Xu, W.H.; Yuan, K.H.; Li, W.T. Dynamic updating approximations of local generalized multigranulation neighborhood rough set. Appl. Intell. 2022, 52, 9148–9173. [Google Scholar] [CrossRef]
  42. Xu, W.H.; Li, W.T. Granular computing approach to two-way learning based on formal concept analysis in fuzzy datasets. IEEE Trans. Cybern. 2016, 46, 366–379. [Google Scholar] [CrossRef]
  43. Xu, W.H.; Yu, J.H. A novel approach to information fusion in multi-source datasets: A granular computing viewpoint. Inf. Sci. 2017, 378, 410–423. [Google Scholar] [CrossRef]
  44. Xu, W.; Yuan, K.; Li, W.; Ding, W. An emerging fuzzy feature selection method using composite entropy-based uncertainty measure and data distribution. IEEE Trans. Emerg. Top. Comput. Intel. 2022. [Google Scholar] [CrossRef]
  45. Xu, W.H.; Liu, S.H.; Wang, Q.R.; Zhang, W.X. The first type of graded rough set based on rough membership function. In Proceedings of the 7th International Conference on Fuzzy Systems and Knowledge Discovery, Yantai, China, 10–12 August 2010; Volume 4, pp. 1922–1926. [Google Scholar]
  46. Li, W.T.; Xu, W.H. Double-Quantitative decision-theoretic rough set. Inf. Sci. 2015, 316, 54–67. [Google Scholar] [CrossRef]
  47. Yu, J.H.; Zhang, B.; Chen, M.H.; Xu, W.H. Double-Quantitative decision-theoretic approach to multigranulation approximate space. Int. J. Approx. Reason. 2018, 98, 236–258. [Google Scholar] [CrossRef]
  48. Xu, W.H.; Guo, Y.T. Generalized multigranulation double-quantitative decision-theoretic rough set. Knowl.-Based Syst. 2016, 105, 190–205. [Google Scholar] [CrossRef]
  49. Fan, B.J.; Tsang, E.C.C.; Xu, W.H.; Yu, J.H. Double-Quantitative rough fuzzy set based decisions: A logical operations method. Inf. Sci. 2017, 378, 264–281. [Google Scholar] [CrossRef]
Figure 1. System diagram of our work.
Figure 1. System diagram of our work.
Mathematics 10 02069 g001
Figure 2. Formation of two double-quantitative models.
Figure 2. Formation of two double-quantitative models.
Mathematics 10 02069 g002
Table 1. The hesitant fuzzy loss function.
Table 1. The hesitant fuzzy loss function.
H ( P ) H C ( N )
a P h λ P P h λ P N
a N h λ N P h λ N N
a B h λ B P h λ B N
Table 2. The information about the houses.
Table 2. The information about the houses.
HousesDesignTrafficGetHousesDesignTrafficGet
x 1 10{0.2} x 21 10{0.5, 0.6}
x 2 00{0, 0.1} x 22 01{0.3, 0.7}
x 3 12{0.9, 0.7, 0.8} x 23 21{0.8, 0.4, 0.9}
x 4 11{0.9, 1} x 24 20{0.2, 0.4, 0}
x 5 10{0.6} x 25 12{0.7, 0.9, 0.5}
x 6 22{1} x 26 21{0.9, 0.6, 0.7, 0.8}
x 7 21{0.7, 0.6} x 27 02{0.4, 0.7}
x 8 02{0.6, 0, 0.3} x 28 21{0.3, 0.6}
x 9 22{0.9, 1} x 29 01{0, 1, 0.5, 0.3}
x 10 02{0.6, 0.8} x 30 00{0, 0.1, 0.2}
x 11 11{0.4, 0.1} x 31 11{0.2, 0.4, 0.3}
x 12 01{0.7, 0.9} x 32 22{0.5, 0.6, 1}
x 13 20{0.4, 0.5} x 33 20{0.6, 0.1, 0.2}
x 14 00{0.1, 0.3, 0.2} x 34 10{0.3, 0.4}
x 15 10{0.3} x 35 11{0.4, 0.6}
x 16 21{0.9, 1} x 36 20{0.2, 0.3}
x 17 11{0.7, 0.4} x 37 10{0.4, 0.6}
x 18 01{0.4, 0.5} x 38 12{0.6, 0.4, 0.8}
x 19 20{0.1, 0.6} x 39 01{0.1, 0.3}
x 20 22{0.8, 1} x 40 00{0, 0.3}
Table 3. Statistical results of house classes under R and the related calculation results.
Table 3. Statistical results of house classes under R and the related calculation results.
( i , j ) [ x ] R ψ S σ ( j ) ( x ) ψ S i = 1 ψ S ψ S σ ( i ) ( x ) P ( H | [ x ] R ) i = 1 ψ S ( ψ S σ ( i ) ( x ) ) C
( 0 , 0 ) x 2 , x 14 , x 30 , x 40 { 0.05 , 0.1 , 0.15 , 0.2 } 40.5000.1253.500
( 0 , 1 ) x 12 , x 18 , x 22 , x 29 , x 39 { 0.2 , 0.3 , 0.45 , 0.5 , 0.8 } 52.2500.4502.750
( 0 , 2 ) x 8 , x 10 , x 27 { 0.3 , 0.55 , 0.7 } 31.5500.5171.450
( 1 , 0 ) x 1 , x 5 , x 15 , x 21 , x 34 , x 37 { 0.2 , 0.3 , 0.35 , 0.5 , 0.55 , 0.6 } 62.5000.4173.500
( 1 , 1 ) x 4 , x 11 , x 17 , x 31 , x 35 { 0.25 , 0.3 , 0.5 , 0.55 , 0.95 } 52.5500.5102.450
( 1 , 2 ) x 3 , x 25 , x 38 { 0.6 , 0.7 , 0.8 } 32.1000.7000.900
( 2 , 0 ) x 13 , x 19 , x 24 , x 33 , x 36 { 0.2 , 0.25 , 0.3 , 0.35 , 0.5 } 51.5500.3103.450
( 2 , 1 ) x 7 , x 16 , x 23 , x 26 , x 28 { 0.45 , 0.65 , 0.7 , 0.75 , 0.95 } 53.5000.7001.500
( 2 , 2 ) x 6 , x 9 , x 20 , x 32 { 0.7 , 0.85 , 0.95 , 1 } 43.5000.8750.500
Table 4. The upper and lower approximations under the different values of k in GRS-HFEn model.
Table 4. The upper and lower approximations under the different values of k in GRS-HFEn model.
k01234
R k ¯ ( H ) U U [ x 2 ] R U ( [ x 2 ] R [ x 8 ] R [ x 13 ] R ) [ x 6 ] R [ x 7 ] R ϕ
R k ̲ ( H ) ϕ [ x 3 ] R [ x 6 ] R [ x 3 ] R [ x 6 ] R [ x 7 ] R [ x 8 ] R U ( [ x 1 ] R [ x 2 ] R [ x 13 ] R ) U
Table 5. Related results of the GRS-HFEn model.
Table 5. Related results of the GRS-HFEn model.
Grade ( k ) POS k ( H ) NEG k ( H ) UBN k ( H ) LBN k ( H )
0 ϕ ϕ U ϕ
1 [ x 3 ] R [ x 6 ] R [ x 2 ] R U ( [ x 2 ] R [ x 3 ] R [ x 6 ] R ) ϕ
2 [ x 3 ] R [ x 6 ] R [ x 7 ] R [ x 2 ] R [ x 13 ] R [ x 1 ] R [ x 4 ] R [ x 12 ] R [ x 8 ] R
3 [ x 6 ] R [ x 7 ] R [ x 1 ] R [ x 2 ] R [ x 13 ] R ϕ [ x 3 ] R [ x 4 ] R [ x 8 ] R [ x 12 ] R
4 ϕ ϕ ϕ U
Table 6. The values of loss function for three cases.
Table 6. The values of loss function for three cases.
Case 1Case 2Case 3
a P { 0 } { 0.6 , 1 } { 0 } { 0.6 , 0.8 } { 0 } { 1 }
a B { 0.2 , 0.4 , 0.6 } { 0.1 , 0.3 } { 0.5 } { 0 , 0.2 } { 0.1 , 0.2 , 0.3 } { 0.4 }
a N { 0.6 , 0.8 } { 0 } { 0.8 , 0.9 , 0.7 } { 0 } { 0.8 , 1 } { 0 }
Table 7. The upper and lower approximations under different cases in the VPRS-HFEn model.
Table 7. The upper and lower approximations under different cases in the VPRS-HFEn model.
R ¯ ( α , β ) ( H ) R ̲ ( α , β ) ( H )
Case 1 U ( [ x 2 ] R [ x 13 ] R ) [ x 3 ] R [ x 6 ] R [ x 7 ] R
Case 2 U [ x 2 ] R [ x 3 ] R [ x 6 ] R [ x 7 ] R
Case 3 U ( [ x 2 ] R [ x 13 ] R ) [ x 6 ] R
Table 8. The regions under different cases in the VPRS-HFEn model.
Table 8. The regions under different cases in the VPRS-HFEn model.
POS ( α , β ) ( H ) NEG ( α , β ) ( H ) BND ( α , β ) ( H )
Case 1 [ x 3 ] R [ x 6 ] R [ x 7 ] R [ x 2 ] R [ x 13 ] R [ x 12 ] R [ x 8 ] R [ x 1 ] R [ x 4 ] R
Case 2 [ x 3 ] R [ x 6 ] R [ x 7 ] R [ x 2 ] R [ x 12 ] R [ x 8 ] R [ x 1 ] R [ x 4 ] R [ x 13 ] R
Case 3 [ x 6 ] R [ x 2 ] R [ x 13 ] R U ( [ x 2 ] R [ x 6 ] R [ x 13 ] R )
Table 9. The four regions of Models 1 and 2.
Table 9. The four regions of Models 1 and 2.
CaseModelPositiveNegativeUpper, BoundaryLower, Boundary
11 [ x 3 ] R [ x 7 ] R [ x 6 ] R [ x 2 ] R [ x 8 ] R [ x 13 ] R [ x 12 ] R [ x 1 ] R [ x 4 ] R ϕ
2 [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R [ x 2 ] R [ x 13 ] R [ x 12 ] R [ x 1 ] R [ x 4 ] R ϕ
21 [ x 3 ] R [ x 7 ] R [ x 6 ] R [ x 2 ] R [ x 8 ] R [ x 13 ] R [ x 12 ] R [ x 1 ] R [ x 4 ] R ϕ
2 [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R [ x 2 ] R [ x 12 ] R [ x 1 ] R [ x 4 ] R [ x 13 ] R ϕ
31 [ x 6 ] R [ x 2 ] R [ x 8 ] R [ x 13 ] R [ x 12 ] R [ x 1 ] R [ x 4 ] R [ x 3 ] R [ x 7 ] R ϕ
2 [ x 8 ] R [ x 3 ] R [ x 7 ] R [ x 6 ] R [ x 2 ] R [ x 13 ] R [ x 12 ] R [ x 1 ] R [ x 4 ] R ϕ
Table 10. Analysis of the advantages of Models 1 and 2.
Table 10. Analysis of the advantages of Models 1 and 2.
ModelCase [ x 7 ] R and [ x 6 ] R [ x 1 ] R and [ x 2 ] R [ x 3 ] R and [ x 7 ] R [ x 8 ] R and [ x 13 ] R
11 P O S I ( H ) , P O S I ( H ) U B N I ( H ) , N E G I ( H ) P O S I ( H ) , P O S I ( H ) N E G I ( H ) , N E G I ( H )
2 P O S I ( H ) , P O S I ( H ) U B N I ( H ) , N E G I ( H ) P O S I ( H ) , P O S I ( H ) N E G I ( H ) , N E G I ( H )
3 P O S I ( H ) , U B N I ( H ) U B N I ( H ) , N E G I ( H ) U B N I ( H ) , U B N I ( H ) N E G I ( H ) , N E G I ( H )
21 P O S I I ( H ) , P O S I I ( H ) U B N I I ( H ) , N E G I I ( H ) P O S I I ( H ) , P O S I I ( H ) P O S I I ( H ) , N E G I I ( H )
2 P O S I I ( H ) , P O S I I ( H ) U B N I I ( H ) , N E G I I ( H ) P O S I I ( H ) , P O S I I ( H ) P O S I I ( H ) , U B N I I ( H )
3 P O S I I ( H ) , P O S I I ( H ) U B N I I ( H ) , N E G I I ( H ) P O S I I ( H ) , P O S I I ( H ) P O S I I ( H ) , N E G I I ( H )
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zhang, X.; Yang, Q. A Novel Method for Decision Making by Double-Quantitative Rough Sets in Hesitant Fuzzy Systems. Mathematics 2022, 10, 2069. https://doi.org/10.3390/math10122069

AMA Style

Zhang X, Yang Q. A Novel Method for Decision Making by Double-Quantitative Rough Sets in Hesitant Fuzzy Systems. Mathematics. 2022; 10(12):2069. https://doi.org/10.3390/math10122069

Chicago/Turabian Style

Zhang, Xiaoyan, and Qian Yang. 2022. "A Novel Method for Decision Making by Double-Quantitative Rough Sets in Hesitant Fuzzy Systems" Mathematics 10, no. 12: 2069. https://doi.org/10.3390/math10122069

APA Style

Zhang, X., & Yang, Q. (2022). A Novel Method for Decision Making by Double-Quantitative Rough Sets in Hesitant Fuzzy Systems. Mathematics, 10(12), 2069. https://doi.org/10.3390/math10122069

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