An Algorithm to Select the Optimal Program Based on Rough Sets and Fuzzy Soft Sets

Combining rough sets and fuzzy soft sets, we propose an algorithm to obtain the optimal decision program. In this algorithm, firstly, according to fuzzy soft sets, we build up information systems; secondly, we compute the significance of each parameter according to rough set theory; thirdly, combining subjective bias, we give an algorithm to obtain the comprehensive weight of each parameter; at last, we put forward a method to choose the optimal program. Example shows that the optimal algorithm is effective and rational.


Introduction
The real world is full of uncertainty, imprecision, and vagueness. Actually most of the concepts we meet in everyday life are vague than precise. So many authors have become interested in modeling vagueness recently. Traditional tools are not always successful to solve these problems. While a wide range of existing theories such as probability theory, fuzzy set theory, rough set theory [1,2], vague set theory [3], and interval mathematics [4] are well known and often useful mathematical approaches to model vagueness, each of these theories has its inherent difficulties. In 1999, Molodtsov initiated soft set theory as a new mathematical tool for dealing with uncertainties, that is, free from the difficulties affecting existing methods [5]. This theory has proven useful in many different fields such as decision making [6,7], data analysis [8], and forecasting.
The soft set model can be combined with other mathematical models. Maji et al. presented the concept of fuzzy soft set [9,10] which is based on a combination of the fuzzy set and soft set models. By combining the interval-valued fuzzy set and soft set, Yang et al. introduced the concept of the intervalvalued fuzzy soft set [11]. In [12], the authors applied the notion of soft sets to the theory of BCK/BCI-algebras. Feng et al. established an interesting connection between rough sets and soft sets [13].
Based on [9,10], and combining rough set theory, in this paper, we propose an algorithm to obtain the optimal decision program.

Rough Sets and Fuzzy Soft Sets
In this section, we recall the basic notions of rough sets, soft sets, and fuzzy soft sets.
An information system is a pair = ( , ), where is a nonempty, finite set called the universe and is a nonempty, finite set of primitive attributes. Every primitive attribute ∈ is a total function : → , where is the set of values of , called the domain of .
Obviously ind( ) is an equivalence relation and ind( ) = ⋂ ∈ ind( ). If ( , ) ∈ ind( ), then and are indiscernible by . The partition generated by ind( ) is denoted by /ind( ), which is further abbreviated as / .   (2) knowledge and are equivalent, denoted as ≅ , if and only if ⇒ and ⇒ ; (3) knowledge and are independent, denoted as ≇ , if and only if neither ⇒ nor ⇒ holds.
Obviously ≅ , if and only if ind( ) = ind( ). Let = ( , ) be an information system and let ∈ ; we say that is dispensable in if ind( ) = ind( − { }); otherwise is indispensable in information system . The information system = ( , ) is independent if each ∈ is indispensable; otherwise the information system = ( , ) is dependent. ⊆ is a reduction of if is independent and ind( ) = ind( ). The set of all indispensable relations in will be called the core of and will be denoted as core( ).
The above properties demonstrate that if depends on then knowledge is superfluous within the information system, in the sense that the knowledge ∪ and provide the same characterization of objects. Let be an initial universe of objects and (simply denoted by ) 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 ⊂ . Following [8,10], the concept of soft sets is defined as follows.
By Definition 1, a soft set ( , ) over the universe can be regarded as a parameterized family of subsets of the universe , which gives an approximate (soft) description of the objects in . As pointed in [5], for any parameter ∈ , the subset ( ) ⊆ may be considered as the set of -approximate elements in the soft set ( , ). It is worth noting that ( ) may be arbitrary: some of them may be empty, and some may have nonempty intersection. For illustration, Molodtsov considered several examples in [5]. Similar examples were also discussed in [7,8].
Maji et al. [9] initiated the study on hybrid structures involving both fuzzy sets and soft sets. They introduced in [9] the notion of fuzzy soft sets, which can be seen as a fuzzy generalization of (crisp) soft sets.
Definition 2 (see [10]). Let F( ) be the set of all fuzzy subsets in a universe . Let be a set of parameters and ⊆ . A pair ( , ) is called a fuzzy soft set over , where is a mapping given by : → F( ).
In the above definition, fuzzy subsets in the universe are used as substitutes for the crisp subsets of . Hence it is easy to see that every soft set may be considered as a fuzzy soft set. Generally speaking, ( ) is a fuzzy subset in and it is called the fuzzy approximate value set of the parameter . Following the standard notations, ( ) can be written as It is well known that the notion of fuzzy sets provides a convenient tool for representing vague concepts by allowing partial memberships. In the definition of a fuzzy soft set, fuzzy subsets are used as substitutes for the crisp subsets. Hence every soft set may be considered as a fuzzy soft set. In addition, by analogy with soft sets, one easily sees that every fuzzy soft set can be viewed as an information system and be represented by a data table with entries belonging to the unit interval [0, 1]. For illustration, we consider the following example.
Example 3 (see [10]). Suppose that there are six houses in the universe = {ℎ 1 , ℎ 2 , ℎ 3 , ℎ 4 , ℎ 5 , ℎ 6 } and the set of parameters is given by = { 1 , 2 , 3 , 4 , 5 , 6 }, where ( = 1, 2, . . . , 6) stand for "beautiful, " "modern, " "cheap, " "in good repair, " "wooden, " and "in green surroundings, " respectively. Let = { 1 , 2 , 3 } ⊂ be consisting of the parameters that Mr. X is interested in buying a house. This means that out of the available houses in Mr. X wants to buy the house which is qualified with the attributes in to the utmost extent. Now all the available information on houses under consideration can be formulated as a fuzzy soft set = ( , ) describing "attractiveness of houses" that Mr. X is going to buy. Table 1 gives the tabular representation of the fuzzy soft set = ( , ). We can view the fuzzy soft set = ( , ) as the collection of the following fuzzy approximations: (1)

The Comprehensive Weight of Each
Parameter under Threshold 3.1. Ascertain the -Level. Give a fuzzy soft set ( , ) over , we use the following algorithm to ascertain the -level.
Step 1. Turn fuzzy soft set ( , ) into an information system, such as Table 1.
Step 2. Build up fuzzy similarity matrix . We use formula 1, 2, . . . , ) to compute the similarity degree of objects and . Let = ( ) × ; obviously, it is a fuzzy similarity matrix.
Step 3. Turn into a fuzzy equivalence matrix * ; that is, we compute the transitive closure of .
Step 4. Choose the optimal classification threshold to clustering.

The Objective Weight of Each Parameter under Threshold.
In the following, combining rough set theory and fuzzy clustering technic, we put forward an algorithm to get objective weight of each parameter from Table 1.
Step 1. Choose the optimal threshold according to Section 3.1.
Step 2. Classify the objects under the optimal threshold , and we regard them as the classes of / .
Suppose the comprehensive weight of the th parameter is ; we denote = ( 1 , 2 , . . . , ), where ∑ =1 = 1, ≥ 0 ( = 1, 2, . . . , ). In order to take into account the bias of not only subjective but also objective information, we can build up the following decision model [15]: where 0 < < 1 is the bias coefficient; it reflects the bias degree of customers to subjective and objective.
We do a Lagrange function based on the above formula:

Algorithm for Selection of the Optimal Program
At present there are many methods to handle decision making problems in fuzzy soft sets. In [10] the decision depends on the score , where signifies the number of parameters of relatively larger membership value of object . In [16] the decision depends on choice value , where signifies the sum of the membership values of all parameters of object . The decision that results is not always the same according to the two methods. In both of these algorithms, the authors did not think over the significance of each parameter, whereas in the actual problems, different parameters have different significance, and the significance of parameters will affect the result of decision. In this paper, combining rough sets and 4 The Scientific World Journal fuzzy soft sets, we put up with a weighted comprehensive algorithm to choose the optimal program.
(2) Compute the significance of each parameter ∈ .

Example
In the following, we use an example to account for the effectiveness of this optimal decision algorithm. If there are eight invest programs, which denote = {program 1, program 2, program 3, program 4, program 5, program 6, program 7, program 8} = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 }, each program is described by ten factor indexes, denoted by = { 1 (payback period of investment), 2 (estimate of sales), Step 1. Turn fuzzy soft set ( , ) into an information system ( Table 2). According to the above fuzzy soft set, we can get the following information system.
Through computing, we obtain as follows: ) .
Through computing, we obtain an equivalence relation * as follows: ) .
According to the fuzzy equivalence matrix * , we choose the optimal threshold; since there is no meaning each object is in a class or all the objects are in a class; we do not think over the rate of change at this time; through computing, we have the following rate of change:  Step 5. Compute the objective weight of each parameter under = 0.72.
The Scientific World Journal 5 In the same way, we can get Normalize the significance of each parameter; we can get the objective weight of each parameter; through computing, we have = (0.125, 0.125, 0, 0.1875, 0.125, 0.125, 0.1875, 0, 0, and 0.125).
Step 6. Compute the comprehensive weight of each parameter.
Since different decision makers have different preferences, that is, different decision makers have different subjective weights, so, they will have different choices according to the above algorithm.

Conclusion
Combining rough sets with fuzzy soft set theory, in this paper, we give an algorithm to choose the optimal program. During this algorithm, we think over not only the objective weight but also the subjective bias; this optimal program selection algorithm is effective and rational.