• Views 1,861
• Citations 4
• ePub 38
• PDF 986
`Advances in Fuzzy SystemsVolume 2013, Article ID 197435, 12 pageshttp://dx.doi.org/10.1155/2013/197435`
Research Article

## The Parameter Reduction of Fuzzy Soft Sets Based on Soft Fuzzy Rough Sets

College of Mathematics and Computer Science, Hebei University, Baoding, Hebei 071002, China

Received 28 September 2012; Revised 21 April 2013; Accepted 8 May 2013

Copyright © 2013 Zhiming Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Fuzzy set theory, rough set theory, and soft set theory are three effective mathematical tools for dealing with uncertainties and have many wide applications both in theory and practise. Meng et al. (2011) introduced the notion of soft fuzzy rough sets by combining fuzzy sets, rough sets, and soft sets all together. The aim of this paper is to study the parameter reduction of fuzzy soft sets based on soft fuzzy rough approximation operators. We propose some concepts and conditions for two fuzzy soft sets to generate the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators. The concept of reduct of a fuzzy soft set is introduced and the procedure to find a reduct for a fuzzy soft set is given. Furthermore, the concept of exclusion of a fuzzy soft set is introduced and the procedure to find an exclusion for a fuzzy soft set is given.

#### 1. Introduction

Soft set theory [1], firstly proposed by Molodtsov, is a general mathematical tool for dealing with uncertainty. Since its introduction, soft set theory has been successfully applied in many fields such as functions smoothness, game theory, riemann integration, and theory of measurement [1]. In recent year, soft set theory has received much attention [219].

It is worth noting that all of above works are based on the classical soft set theory. A lot of extensions of soft sets to uncertain environments have been proposed recently, such as fuzzy soft sets [20], generalised fuzzy soft sets [21], interval-valued fuzzy soft sets [22], vague soft sets [23], intuitionistic fuzzy sets [2426], and interval-valued intuitionistic fuzzy soft sets [27]. More importantly, some approaches to these extended soft sets-based decision makings were also developed [21, 2832].

Rough set theory was originally introduced by Pawlak [33] to deal with vagueness and granularity in information systems. The equivalence relation is the key in Pawlak’s rough set model. However, the equivalence relation is too restrictive for many practical applications. Therefore, some extensions of Pawlak’s rough sets have been developed by replacing the equivalence relations by some more general concepts. For example, by using arbitrary binary relaions, fuzzy relations, and intuitionistic fuzzy relations to granulate the universe of discourse, the concepts of variable precision rough sets, fuzzy rough sets, and intuitionistic fuzzy rough sets have been presented, respectively. But all these rough sets have their inherent difficulties, which are caused by the inadequacy of the parametrization tool. For example, in variable precision fuzzy rough sets, a large number of experiments are required to define the distribution function, which is expensive in some practical problems. In fuzzy rough sets and intuitionistic fuzzy rough sets, defining a membership function and a nonmembership function is not an easy task. In classical rough sets, the equivalence relation is a very stringent condition that limits the applications of rough sets in some practical problems. The mentioned difficulties associated with these rough sets are because of lack of parametrization tools. Different from these existing rough set extensions, by employing fuzzy soft sets to granulate the universe of discourse, Meng et al. [34] constructed a more general model called the soft fuzzy rough set, which is free from the inadequacy of the parametrization tools of those rough sets and therefore can overcome the above difficulties. Sun and Ma [35] also proposed a new concept of soft fuzzy rough set by combining the fuzzy soft set with the pseudo fuzzy soft set. In this paper, we study the parameter reduction of fuzzy soft sets based on soft fuzzy rough sets proposed by Meng et al. [34]. Our work is substantially different from Sun and Ma’s work [35]. First, our work is based on Ma et al.’s soft fuzzy rough sets, which are different from Sun and Ma’s soft fuzzy rough sets. Second, our work mainly studies the parameter reduction of fuzzy soft sets based on soft fuzzy rough sets, while Sun and Ma’s work [35] focused on the application of soft fuzzy rough sets in decision making.

As for a fuzzy soft set, if we omit a parameter from the set of parameters, then the resulting new fuzzy soft sets and the original one can generate the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators. This phenomenon tells us that there may exist redundancy in a fuzzy soft set. As a consequence, how to get rid of the redundancy from a fuzzy soft set is an important and interesting research issue. To address this issue, we in the current paper introduce two concepts of reduct and exclusion. Furthermore, a procedure to find the reduct or exclusion of a set of parameters is given. For a particular fuzzy soft set, our technique can obtain the corresponding “smallest” fuzzy soft set that produces the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators. Hence, our method can reduce the redundant information in a fuzzy soft set. In addition, it should also be noted that in soft fuzzy rough set models, different fuzzy soft sets may generate the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators. Therefore, it is necessary to find the conditions under which two fuzzy soft sets generate the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators. In this paper, we extend Zhu and Wang’s work [36] and propose some concepts and conditions for two fuzzy soft sets to generate the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators.

This paper is organized as follows. Section 2 introduces some fundamental concepts. In Section 3, we propose one of the core concepts in this paper, reduct, to reduce a set of parameters to its simplest form while not changing the lower soft fuzzy rough approximation operator and the upper soft fuzzy rough approximation operator . Still, through this concept, we get a sufficient condition for two fuzzy soft sets to generate the same lower soft fuzzy rough approximation operator and the same upper soft fuzzy rough approximation operator . In Section 4, we investigate similar issues to those in Section 3 for the the lower soft fuzzy rough approximation operator and the upper soft fuzzy rough approximation operator . This paper concludes in Section 5 with remarks for future works.

#### 2. Preliminaries

In this section, we shall briefly recall some basic notions of soft sets and rough sets.

##### 2.1. Soft Sets and Fuzzy Soft Sets

Throughout this paper, let be an initial universe of objects and (, for short) the set of parameters in relation to objects in . Parameters are often attributes, characteristics, or properties of objects. Let denote the power set of and . Molodtsov [1] defined the soft set in the following way.

Definition 1 (see [1]). A pair is called a soft set over , where is a mapping given by
Such a mapping reflects the innate character of the concept of a soft set; that is, a soft set is a mapping from parameters to . This shows that a soft set over is a parameterized family of subsets of the universe . For , is regarded as the set of -approximate elements of the soft set .
As an illustration, let us consider the following example originally introduced by Molodtsov [1].

Example 2 (a house purchase problem). Suppose that the universe is the set of six houses under consideration and is the set of parameters that Mr. X is interested in buying a house. Assume that , where () stands for the parameters in a word of “expensive,” “beautiful,” “wooden,” “in the green surroundings,” “convenient traffic,” and “modern style,” respectively. That means, out of available houses in , Mr. X is to select that house which qualifies with all (or with maximum number of) parameters of the set . In this case, to define a soft set means to point out expensive houses, beautiful houses, and so on. The soft set describes the “attractiveness of the houses” which Mr. X (say) is going to buy.
Suppose that The soft set is a parameterized family of subsets of the set and gives us a collection of approximate descriptions of an object. Consider the mapping which is “houses ” where dot is to be filled up by a parameter . For instance, means “houses (expensive)” whose functional value is the set . Thus, we can view the soft set as a collection of approximations as below:
In order to store a soft set in a computer, we could represent a soft set in the form of a 0-1 two-dimensional table. Table 1 is the tabular representation of the soft set . If , then ; otherwise , where are the entries in Table 1.

Table 1: Tabular representation of .

By Definition 1, a soft set is a parameterized family of subsets of the universal set. In other words, a soft set is a mapping from a set of parameters to the power set of an initial universe set. In the real world, the difficulty is that the objects in the universal set may not precisely satisfy the problem’s parameters. Maji et al. [20] initiated the study on hybrid structures involving both fuzzy sets and soft sets. They introduced in [20] the notion of fuzzy soft sets, which can be seen as a fuzzy generalization of (classical) soft sets. The concept of fuzzy soft sets partially resolves this difficulty.

Definition 3 (see [20]). Let be the set of all fuzzy subsets of . Let be a set of parameters and . A pair is called a fuzzy soft set over , where is a mapping given by .
A fuzzy soft set is a parameterized family of fuzzy subsets of ; thus, can be reexpressed as follows: . A fuzzy soft set is actually a special case of a soft set because it is still a mapping from parameters to a universe. The difference between a soft set and a fuzzy soft set is that in a fuzzy soft set, the universe to be considered is the set of fuzzy subsets of . Generally speaking, for any parameter , is a fuzzy subset of and it is called fuzzy value set of parameter . can be written as . Let us denote by the membership degree that object holds parameter .

Definition 4. A fuzzy soft set over is called a full fuzzy soft set if .

Example 5 (Example 2 Continued). Let be a set of six houses and a set of parameters given by Example 2. Now suppose that all the available information of the six houses with respect to the five parameters can be formulated as a fuzzy soft set describing “attractiveness of houses” that Mr. X is going to buy. According to the data collected, the fuzzy soft set can be viewed as the collection of the following fuzzy approximations: = expensive houses = {x1, 0.6, x2, 0.8, x3, 0.4, x4, 0.6, x5, 0.5, x6, 0.7}, = beautiful houses = {x1, 0.6, x2, 0.8, x3, 0.2, x4, 0.1, x5, 0.5, x6, 0.6}, = wooden houses = {x1, 0.1, x2, 0.4, x3, 0.4, x4, 0.6, x5, 0.1, x6, 0.7}, = in the green surroundings houses = {x1, 0.6, x2, 0.8, x3, 0.3, x4, 0.5, x5, 0.5, x6, 0.9}, = convenient traffic houses = {x1, 0.5, x2, 0.1, x3, 0.3, x4, 0.5, x5, 0.3, x6, 0.9}, = modern style houses = {x1, 0.5, x2, 0.4, x3, 0.4, x4, 0.6, x5, 0.3, x6, 0.9}.Table 2 is the tabular representation of the fuzzy soft set .

Table 2: Tabular representation of .

Definition 6 (see [20]). For two fuzzy soft sets and over , we say that is a fuzzy soft subset of if and only if and , . We denote this relationship by . is said to be a fuzzy soft superset of , if is a fuzzy soft subset of . We denote it by . If is a fuzzy soft subset of and is a fuzzy soft subset of , then and are said to be fuzzy soft equal, which can be denoted by .
It is easy to see that if and only if and for any .

##### 2.2. Pawlak’s Rough Sets and Rough Fuzzy Sets

In this subsection we recall basic definitions of classical rough sets and rough fuzzy sets.

Let denote a finite and nonempty set called the universe. Suppose is an equivalence relation on ; that is, is reflexive, symmetrical, and transitive. The equivalence relation partitions the set into disjoint subsets. It is a quotient set of the universe and is denoted by . Elements in the same equivalence class are said to be indistinguishable. Equivalence classes of are called elementary sets. Every union of elementary sets is called a definable set [33]. The empty set is considered to be a definable set; thus, all the definable sets form a Boolean algebra. is called a Pawlak approximation space. Given an arbitrary set , one can characterize by a pair of lower and upper approximations. The lower approximation is the greatest definable set contained in , and the upper approximation is the smallest definable set containing . They can be computed by two equivalent formulae: where is the equivalence class containing .

Dubois and Prade [37] first generalized the concept of rough sets to the fuzzy environment [38] and initiated the concepts of rough fuzzy sets and fuzzy rough sets. Next, we introduce the concept of rough fuzzy sets proposed by Dubois and Prade [37].

Let be a Pawlak approximation space. For a fuzzy set , the lower and upper rough approximations of with respect to are denoted by and , respectively, which are fuzzy sets in defined by for all . The operators and are called the lower and upper rough approximation operators on fuzzy sets. If , the fuzzy set is said to be definable; otherwise, is called a rough fuzzy set.

##### 2.3. Soft Fuzzy Rough Sets

Motivated by Dubois’s and Prade’s original idea about rough fuzzy sets, Feng et al. [9] considered the lower and upper approximations of a soft set in a Pawlak’s approximation space, which gave rise to the notion of rough soft sets. Next, in [10], a soft set instead of an equivalence relation was used to granulate the universe of discourse. The result was a deviation of Pawlak’s approximation space called a soft approximation space, in which soft rough approximations and soft rough sets were introduced accordingly. Furthermore, Feng et al. [9] considered lower and upper soft rough approximations of fuzzy sets in a soft approximation space and obtained a new hybrid model called soft rough fuzzy sets, which can be seen as an extension of Dubois’s and Prade’s rough fuzzy sets. Recently, Meng et al. [34] used a fuzzy soft set to granulate the universe of discourse and obtained two new hybrid models called soft fuzzy rough sets, which can be seen as an extension of soft rough fuzzy sets. In the following, we recall two pairs of soft fuzzy rough approximation operators as follows.

Definition 7 (see [34]). Let be a fuzzy soft set over and be a soft fuzzy approximation space. For a fuzzy set , the lower soft fuzzy rough approximation and upper soft fuzzy rough approximation of with respect to are fuzzy sets in given by for all .

Definition 8 (see [34]). Let be a fuzzy soft set over . The pair is called a soft fuzzy approximation space. For a fuzzy set , the lower and upper soft fuzzy rough approximations of with respect to are denoted by and , respectively, which are fuzzy sets in given by for all . The operators and are called the lower and upper soft fuzzy rough approximation operators on fuzzy sets. If , is said to be soft fuzzy definable; otherwise is called a soft fuzzy rough set.

#### 3. Reducts of the Lower Soft Fuzzy Rough Approximation Operator and Upper Soft Fuzzy Rough Approximation Operator

It is worth noting that two different fuzzy soft sets may generate the same lower soft fuzzy rough approximation operator and upper soft fuzzy rough approximation operator ; therefore, it is necessary to obtain the conditions under which two different fuzzy soft sets generate the same lower soft fuzzy rough approximation operator and upper soft fuzzy rough approximation operator . In addition, there may also exist redundancy in a fuzzy soft set; that is, if we remove a parameter from a set of parameters, the remaining fuzzy soft set and the original fuzzy soft set can generate the same lower soft fuzzy rough approximation operator and upper soft fuzzy rough approximation operator . Therefore, deletion of redundancy from a fuzzy soft set is an important topic. In this section, we are devoted to solving these problems.

Example 9 (different fuzzy soft sets generate the same and ). Let be a fuzzy soft set over shown in Table 2. Let , , and be three fuzzy soft sets over shown in Tables 3, 4, and 5, where expensive; beautiful; wooden; in the green surroundings; convenient traffic}, expensive; beautiful; wooden; convenient traffic}, and beautiful; wooden; convenient traffic}.
Through computing, we find that , , and generate the same lower soft fuzzy rough approximation operator and the same upper soft fuzzy rough approximation operator . Therefore, we want to investigate the conditions under which two different fuzzy soft sets generate the same lower soft fuzzy rough approximation operator and the same upper soft fuzzy rough approximation operator .

Table 3: Tabular representation of .
Table 4: Tabular representation of .
Table 5: Tabular representation of .

Definition 10. Let be a fuzzy soft set over a universe and . If is a union of some fuzzy sets in , then is called a reducible element of ; otherwise, is called an irreducible element of .

Proposition 11. Let be a fuzzy soft set over . Then is a reducible element of if and only if, for any , there exists a parameter such that .

Proof. According to Definition 10, we have
is a reducible element of :,, there exists a parameter such that , .

Example 12. In Table 2, we can easily see that . Therefore, by Definition 10, is a reducible element of .

Definition 13. Let be a fuzzy soft set over a universe . If every element of is an irreducible element, then we call irreducible; otherwise, is reducible.

Theorem 14. Let be a full fuzzy soft set over . If is a reducible element of , then is still a full fuzzy soft set over .

Proof. It directly follows from Definitions 4 and 10.

Theorem 15. Let be a fuzzy soft set over a universe , let , let be a reducible element of , and let ; then, is a reducible element of if and only if it is a reducible element of .

Proof. ” If is a reducible element of , then can be expressed as a union of some fuzzy subsets in , denoted by . It is clear that for . If all fuzzy sets among are not equal to , then . Thus, is a reducible element of . If some one among is equal to , without loss of generality, let . Since is a reducible element of , there exist fuzzy sets , such that . Therefore, . Furthermore, because , cannot be equal to , so , are not equal to either or . That is, . Thus, is a reducible element of .
” If is a reducible element of , then can be expressed as a union of some fuzzy sets in . Obviously, can be expressed as a union of some fuzzy sets in , so is a reducible element of .

Theorem 15 shows that deleting a reducible element in a set of parameters will not generate any new reducible elements or make other originally reducible elements become irreducible elements of the new set of parameters. So, we can compute the reduct of a set of parameters by deleting all reducible elements in the same time, or by deleting one reducible element in a step. The remaining set of parameters is irreducible. Especially, for a full fuzzy soft set, Theorem 14 guarantees that after deleting a reducible element in a set of parameters, the new fuzzy soft set is still a full fuzzy soft set.

Definition 16. For a fuzzy soft set over , when we delete all reducible elements from , the remaining irreducible set of parameters is called the reduct of and is denoted by .
Theorem 15 guarantees that a set of parameters has only one reduct. An algorithm to compute the reduct of a set of parameters is shown as follows.

Example 17. In Example 9, .

Definition 18. For a fuzzy soft set over , the fuzzy soft set is called the reduct of and is denoted by .

Theorem 19. If is a fuzzy soft set over , is a reducible element of , and ; then the lower soft fuzzy rough approximations of generated by the fuzzy soft set and the fuzzy soft set , respectively, are the same.

Proof. Since is a reducible element of , can be expressed as a union of some fuzzy subsets in , say . Then, for any , we have Consequently, we have This theorem is proved.

Corollary 20. Suppose is a fuzzy soft set over and ; then the lower soft fuzzy rough approximations of generated by the fuzzy soft sets and , respectively, are the same.

Proof. It directly follows from Definition 18 and Theorem 19.

Theorem 21. If is a fuzzy soft set over , is a reducible element of , and , then the upper soft fuzzy rough approximations of generated by the fuzzy soft set and the fuzzy soft set , respectively, are the same.

Proof. The proof is analogous to the proof of Theorem 19.

Corollary 22. Suppose is a fuzzy soft set over and ; then the upper soft fuzzy rough approximations of generated by the fuzzy soft sets and , respectively, are the same.

Proof. It directly follows from Definition 18 and Theorem 21.

Combining Corollaries 20 and 22, we have the following conclusions.

Theorem 23. Let be a fuzzy soft set over ; then and generate the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators .

Theorem 24 (condition under which two different fuzzy soft sets generate the same and ). Let and be two fuzzy soft sets over the same universe . If and satisfy the condition in Proposition 11 and , then and generate the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators .

Remark 25. When contains a large amount of parameters, calculating and using Definition 8 becomes very complex. Based on the above discussions, we may first calculate using Algorithm 1 and then calculate and using the following equations:

Algorithm 1

Example 26. Let be a fuzzy soft set over shown in Table 2. Let be a fuzzy set on . By Remark 25 and Example 17, we have
Thus, , ,, ,,}.
Similarly, we have .

#### 4. Exclusions of the Lower Soft Fuzzy Rough Approximation Operator and Upper Soft Fuzzy Rough Approximation Operator

In the present section, we investigate similar issues to those in Section 3 for the the lower soft fuzzy rough approximation operator and the upper soft fuzzy rough approximation operator . It should be noted that the concept of reduct is not a very useful tool for the lower soft fuzzy rough approximation operator and upper soft fuzzy rough approximation operator . An illustrative example is as follows.

Example 27. ( and do not generate the same lower soft fuzzy rough approximation operator and the same upper soft fuzzy rough approximation operator ). Let be a fuzzy soft set over shown in Table 4. Let be a fuzzy soft set over shown in Table 5. Let be a fuzzy set on . By Example 17, we know that . According to Definition 7, we have Therefore, and do not generate the same lower soft fuzzy rough approximation operator and the same upper soft fuzzy rough approximation operator .

Example 28 (two different fuzzy soft sets generate the same lower soft fuzzy rough approximation operator and the same upper soft fuzzy rough approximation operator ). Let be a fuzzy soft set over shown in Table 4. Let be a fuzzy soft set over shown in Table 6, where .
By Definition 7, we know that and generate the same lower soft fuzzy rough approximation operator and the same upper soft fuzzy rough approximation operator . Thus, we need to examine the conditions under which two different fuzzy soft sets generate the same lower soft fuzzy rough approximation operator and the same upper soft fuzzy rough approximation operator . To address this issue, we introduce the following novel concept called exclusions.

Table 6: Tabular representation of .

Definition 29. Let be a fuzzy soft set over and . If there exists another parameter such that , then we say that is an immured element of .

Proposition 30. Let be a fuzzy soft set over . Then is an immured element of if and only if there exists a parameter such that for any .

Proof. According to Definition 29, we have the following: is an immured element of , there exists another parameter such that ,, .

Example 31. For the fuzzy soft set in Table 4, is an immured element of .

Definition 32. Let be a fuzzy soft set over . If every parameter of is not an immured element, we call semireduced or semi-irredundant.

Theorem 33. Let be a full fuzzy soft set over . If is an immured element of , then is still a full fuzzy soft set over .

Proof. It follows from Definitions 4 and 29.

Theorem 34. Let be a fuzzy soft set over , , an immured element of , and ; then, is an immured element of if and only if it is an immured element of .

Proof. ” If is an immured element of , then there exists such that . Since is an immured element of , there exists such that . If , then . If , then . Therefore, is an immured element of .
” If is an immured element of , then there exists such that . Clearly, is also an immured element of .

Theorem 34 shows that deleting an immured element in a set of parameters will not generate any new reducible elements or make other originally immured elements become no immured elements of the new set of parameters. So, we can compute the exclusion of a set of parameters by deleting all immured elements in the same time, or by deleting one immured element in a step. The remaining set of parameters is not immured. In particular, for a full fuzzy soft set, Theorem 33 guarantees that after deleting an immured element in a set of parameters, the new fuzzy soft set is still a full fuzzy soft set.

Definition 35. Let be a fuzzy soft set over . When we remove all the immured parameters from , the set of all remaining parameters is called an exclusion of and is denoted by .
Theorem 34 guarantees that a set of parameters has only one exclusion. We give an algorithm to compute the exclusion of a set of parameters as follows.

Example 36. In Example 28, .

Definition 37. For a fuzzy soft set over , the fuzzy soft set is called the exclusion of and is denoted by .

Theorem 38. If is a fuzzy soft set over , is an immured element of , and , then the lower soft fuzzy rough approximations of generated by the fuzzy soft set and the fuzzy soft set , respectively, are the same.

Proof. Since is an immured element of , there exists another element such that . For any , we have Thus, we have This theorem is proved.

Corollary 39. Suppose is a fuzzy soft set over and ; then the lower soft fuzzy rough approximations of generated by the fuzzy soft sets and , respectively, are the same.

Proof. It follows from Definition 37 and Theorem 38.

Theorem 40. If is a fuzzy soft set over , is an immured element of , and , then the upper soft fuzzy rough approximations of generated by the fuzzy soft set and the fuzzy soft set , respectively, are the same.

Proof. Since is an immured element of , there exists another element such that . For any , we have
Consequently, we have
This theorem is proved.

Corollary 41. Suppose is a fuzzy soft set over and ; then the upper soft fuzzy rough approximations of generated by the fuzzy soft sets and , respectively, are the same.

Proof. It follows from Definition 37 and Theorem 40.

Combining Corollaries 39 and 41, we have the following conclusions.

Theorem 42. Let be a fuzzy soft set over ; then and generate the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators .

Theorem 43 (condition under which two different fuzzy soft sets generate the same and ). Let and be two fuzzy soft sets over the same universe . If and satisfy the condition in Proposition 30 and , then and generate the same lower soft fuzzy rough approximation operators and the same upper soft fuzzy rough approximation operators .

Remark 44. When contains a large amount of parameters, calculating and using Definition 7 becomes very complex. Based on the above discussions, we may first calculate using Algorithm 2 and then calculate and using the following equations:

Algorithm 2

Example 45. Let be a fuzzy soft set over shown in Table 4. Let be a fuzzy set on . By Remark 44 and Example 36, we have Thus, = {x1, 0.4, x2, 0.4, x3, 0.6, x4, 0.4, x5, 0.5, x6, 0.4}.
Similarly, we have .

#### 5. Conclusions

In this paper, we recall the notion of soft fuzzy rough sets as a combination of soft sets, fuzzy sets, and rough sets. Then, by employing two concepts of reduct and exclusion, we give some conditions for two different fuzzy soft sets to generate an identical lower soft fuzzy rough approximation operator and an identical upper soft fuzzy rough approximation operator. In future research, it is desirable to address the axiomatization issue of the lower and upper soft fuzzy rough approximation operators. In addition, topological properties of soft fuzzy rough approximation operators are also a potential topic for future research. On the other hand, the applications of soft fuzzy rough sets to practical fields are exciting areas to be explored. We will focus on these issues in our future works.

#### Acknowledgments

The author thanks the anonymous referees for their valuable suggestions in improving this paper. This work was supported by the National Natural Science Foundation of China (Grant no. 61073121) and the Natural Science Foundation of the Hebei Province of China (Grant nos. F2010000318, F2012201014, F2013201060, and A2012201033).

#### References

1. D. Molodtsov, “Soft set theory—first results,” Computers and Mathematics with Applications, vol. 37, no. 4-5, pp. 19–31, 1999.
2. U. Acar, F. Koyuncu, and B. Tanay, “Soft sets and soft rings,” Computers and Mathematics with Applications, vol. 59, no. 11, pp. 3458–3463, 2010.
3. H. Aktaş and N. Çaǧman, “Soft sets and soft groups,” Information Sciences, vol. 177, no. 13, pp. 2726–2735, 2007.
4. M. I. Ali, “A note on soft sets, rough soft sets and fuzzy soft sets,” Applied Soft Computing Journal, vol. 11, no. 4, pp. 3329–3332, 2011.
5. M. I. Ali, F. Feng, X. Liu, W. K. Min, and M. Shabir, “On some new operations in soft set theory,” Computers and Mathematics with Applications, vol. 57, no. 9, pp. 1547–1553, 2009.
6. A. Aygünoglu and H. Aygün, “Introduction to fuzzy soft groups,” Computers and Mathematics With Applications, vol. 58, pp. 1279–1286, 2009.
7. D. Chen, E. C. C. Tsang, D. S. Yeung, and X. Wang, “The parameterization reduction of soft sets and its applications,” Computers and Mathematics with Applications, vol. 49, no. 5-6, pp. 757–763, 2005.
8. F. Feng, Y. B. Jun, and X. Zhao, “Soft semirings,” Computers and Mathematics with Applications, vol. 56, no. 10, pp. 2621–2628, 2008.
9. F. Feng, C. Li, B. Davvaz, and M. I. Ali, “Soft sets combined with fuzzy sets and rough sets: a tentative approach,” Soft Computing, vol. 14, no. 9, pp. 899–911, 2010.
10. F. Feng, X. Liu, V. Leoreanu-Fotea, and Y. B. Jun, “Soft sets and soft rough sets,” Information Sciences, vol. 181, no. 6, pp. 1125–1137, 2011.
11. Y. B. Jun, “Soft BCK/BCI-algebras,” Computers and Mathematics with Applications, vol. 56, no. 5, pp. 1408–1413, 2008.
12. Y. B. Jun and C. H. Park, “Applications of soft sets in ideal theory of BCK/BCI-algebras,” Information Sciences, vol. 178, no. 11, pp. 2466–2475, 2008.
13. Z. Kong, L. Gao, L. Wang, and S. Li, “The normal parameter reduction of soft sets and its algorithm,” Computers and Mathematics with Applications, vol. 56, no. 12, pp. 3029–3037, 2008.
14. X. Ma, N. Sulaiman, H. Qin, T. Herawan, and J. M. Zain, “A new efficient normal parameter reduction algorithm of soft sets,” Computers and Mathematics with Applications, vol. 62, no. 2, pp. 588–598, 2011.
15. P. K. Maji, R. Biswas, and A. R. Roy, “Soft set theory,” Computers and Mathematics with Applications, vol. 45, no. 4-5, pp. 555–562, 2003.
16. P. K. Maji, A. R. Roy, and R. Biswas, “An application of soft sets in a decision making problem,” Computers and Mathematics with Applications, vol. 44, no. 8-9, pp. 1077–1083, 2002.
17. W. K. Min, “Similarity in soft set theory,” Applied Mathematics Letters, vol. 25, pp. 310–314, 2012.
18. C. F. Yang, “Fuzzy soft semigroups and fuzzy soft ideals,” Computers and Mathematics with Applications, vol. 61, no. 2, pp. 255–261, 2011.
19. Y. Zou and Z. Xiao, “Data analysis approaches of soft sets under incomplete information,” Knowledge-Based Systems, vol. 21, no. 8, pp. 941–945, 2008.
20. P. K. Maji, R. Biswas, and A. R. Roy, “Fuzzy soft sets,” Journal of Fuzzy Mathematics, vol. 9, no. 3, pp. 589–602, 2001.
21. P. Majumdar and S. K. Samanta, “Generalised fuzzy soft sets,” Computers and Mathematics with Applications, vol. 59, no. 4, pp. 1425–1432, 2010.
22. X. Yang, T. Y. Lin, J. Yang, Y. Li, and D. Yu, “Combination of interval-valued fuzzy set and soft set,” Computers and Mathematics with Applications, vol. 58, no. 3, pp. 521–527, 2009.
23. W. Xu, J. Ma, S. Wang, and G. Hao, “Vague soft sets and their properties,” Computers and Mathematics with Applications, vol. 59, no. 2, pp. 787–794, 2010.
24. P. K. Maji, “More on intuitionistic fuzzy soft sets,” Lecture Notes in Computer Science, vol. 5908, pp. 231–240, 2009.
25. P. K. Maji, R. Biswas, and A. R. Roy, “Intuitionistic fuzzy soft sets,” Journal of Fuzzy Mathematics, vol. 9, pp. 677–692, 2001.
26. P. K. Maji, R. Biswas, and A. R. Roy, “On intuitionistic fuzzy soft sets,” Journal of Fuzzy Mathematics, vol. 12, pp. 669–683, 2004.
27. Y. Jiang, Y. Tang, Q. Chen, H. Liu, and J. Tang, “Interval-valued intuitionistic fuzzy soft sets and their properties,” Computers and Mathematics with Applications, vol. 60, no. 3, pp. 906–918, 2010.
28. F. Feng, Y. B. Jun, X. Liu, and L. Li, “An adjustable approach to fuzzy soft set based decision making,” Journal of Computational and Applied Mathematics, vol. 234, no. 1, pp. 10–20, 2010.
29. F. Feng, Y. Li, and V. Leoreanu-Fotea, “Application of level soft sets in decision making based on interval-valued fuzzy soft sets,” Computers and Mathematics with Applications, vol. 60, no. 6, pp. 1756–1767, 2010.
30. Y. Jiang, Y. Tang, and Q. Chen, “An adjustable approach to intuitionistic fuzzy soft sets based decision making,” Applied Mathematical Modelling, vol. 35, no. 2, pp. 824–836, 2010.
31. Z. Kong, L. Gao, and L. Wang, “Comment on ‘A fuzzy soft set theoretic approach to decision making problems’,” Journal of Computational and Applied Mathematics, vol. 223, no. 2, pp. 540–542, 2009.
32. A. R. Roy and P. K. Maji, “A fuzzy soft set theoretic approach to decision making problems,” Journal of Computational and Applied Mathematics, vol. 203, no. 2, pp. 412–418, 2007.
33. Z. Pawlak, “Rough sets,” International Journal of Computer & Information Sciences, vol. 11, no. 5, pp. 341–356, 1982.
34. D. Meng, X. H. Zhang, and K. Y. Qin, “Soft rough fuzzy sets and soft fuzzy rough sets,” Computers and Mathematics With Applications, vol. 62, no. 12, pp. 4635–4645, 2011.
35. B. Z. Sun and W. M. Ma, “Soft fuzzy rough sets and its application in decision making,” in Artificial Intelligence Review, Springer, Berlin, Germany, 2011.
36. W. Zhu and F. Y. Wang, “On three types of covering-based rough sets,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 8, pp. 1131–1144, 2007.
37. D. Dubois and H. Prade, “Rough fuzzy sets and fuzzy rough sets,” International Journal of General Systems, vol. 17, pp. 191–209, 1990.
38. L. A. Zadeh, “Fuzzy sets,” Information and Control, vol. 8, no. 3, pp. 338–353, 1965.