- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
International Journal of Combinatorics
Volume 2011 (2011), Article ID 893061, 10 pages
Some More Results on IF Soft Rough Approximation Space
1Department of Mathematics, Tripura University, Suryamaninagar, Tripura 799130, India
2Department of Mathematics, Yazd University, Yazd 89195-741, Iran
Received 6 September 2011; Accepted 20 November 2011
Academic Editor: Toufik Mansour
Copyright © 2011 Sharmistha Bhattacharya (Halder) and Bijan Davvaz. 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.
Fuzzy sets, rough sets, and later on IF sets became useful mathematical tools for solving various decision making problems and data mining problems. Molodtsov introduced another concept soft set theory as a general frame work for reasoning about vague concepts. Since most of the data collected are either linguistic variable or consist of vague concepts so IF set and soft set help a lot in data mining problem. The aim of this paper is to introduce the concept of IF soft lower rough approximation and IF upper rough set approximation. Also, some properties of this set are studied, and also some problems of decision making are cited where this concept may help. Further research will be needed to apply this concept fully in the decision making and data mining problems.
Data mining is a technique of extracting meaningful information from large and mostly un-organized data banks. Data mining is one of the areas in which rough set is widely used. Data mining is the process of automatically searching large volumes of data for patterns using tools such as classifications, association, rule mining, and clustering. The rough set theory is a well understood format framework for building data mining models in the form of logic rules on the bases of which it is possible to issue predictions that allow classifying new cases.
In general whenever data are collected they are linguistic variables. Not only this, the answers are not always in Yes/No form. So, in this case to deal with such type of data IF set is a very important tool.
Data are in most of the cases a relation between object and attribute. Soft set is an important tool to deal with such types of data.
So, throughout this paper a combined approach of soft set, IF set, rough set is studied. Further study is required to find the application of this concept in the field of data mining. Zadeh in 1965  introduced the concept of fuzzy set. This set contains only a membership function lying between 0 and 1. But while collecting data many cases may be there where data are missing so IF sets are reqd which consists of both membership value and nonmembership value. Atanassov  introduced the concept of IF set. Atanassov named it intuitionistic fuzzy set. But nowadays a problem arose due to the already introduced concept of intuitionistic logic. Hence, instead of intuitionistic fuzzy set, throughout this paper we are using the nomenclature IF set.
Rough sets introduced by Pawlak  are also a very useful tool for data mining problems where vagueness is the key factor. Molodtsov  introduced the concept of soft set, and in 2009 Feng et al.  introduced a combined notion of fuzzy set, rough set, and soft set to deal with complex data which arises in the most social science problems.
In this paper, our aim is to introduce the concepts of IF soft lower and IF soft upper rough approximations which help a lot for sorting the vague data and tending towards decision.
2. Basic Definitions
In this section, some of the important required concepts necessary to go further through this paper are shown.
Let be a nonempty set, and let be the unit interval . According to , an intuitionistic fuzzy set (IFS for short) is an object having the form where the functions and denote, respectively, the degree of membership and the degree of nonmembership of each element to the set , and for each . An intuitionistic fuzzy topology (IFT for short) on a nonempty set is a family of IFS’s in containing and closed under arbitrary infimum and finite supremum . In this case, the pair is called an intuitionistic fuzzy topological space (IFTS for short) and each IFS in is known as an intuitionistic fuzzy open set (IFOS for short). The compliment of an IFOS is called an intuitionistic fuzzy closed set (IFCS for short).
Let be a nonempty set and let IFS’s and be in the following forms: Then,(1),(2),(3),(4),(5).
Let be a finite nonempty set, called universe and an equivalence relation on , called indiscernibility relation. The pair is called an approximation space. By we mean that the set of all such that , that is, is containing the element . Let be a subset of . We want to characterize the set with respect to . According to Pawlak’s paper , the lower approximation of a set with respect to is the set of all objects, which surely belong to , that is, , and the upper approximation of with respect to is the set of all objects, which are partially belonging to , that is, . For an approximation space , by a rough approximation in we mean a mapping defined by for every , Given an approximation space , a pair is called a rough set in if for some .
Fuzzy set is defined by employing the fuzzy membership function, whereas rough set is defined by approximations. The difference of the upper and the lower approximation is a boundary region. Any rough set has a nonempty boundary region whereas any crisp set has an empty boundary region. The lower approximation is called interior, and the upper approximation is called closure of the set. By using these concepts, we can make a topological space.
A set is said to be a topological space if with every there is an associated set such that the following conditions are satisfied: for any , , , , and . The operation is called an interior operation. This topological space is written by .
Let be a universal set and let be a set of parameters. According to , a pair is called a soft set over , where and , the power set of , is a set-valued mapping.
Let be a Pawlak approximation space. For a fuzzy set , the lower and upper rough approximations of in are denoted by and , respectively, which are fuzzy sets 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.
A soft set over is called a full soft set if . Let be a full soft set over , and let be a soft approximation space. For a fuzzy set the lower and upper soft 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 rough approximation operators on fuzzy sets. If both the operators are the same then is said to be soft definable, otherwise is said to be soft rough fuzzy set.
3. On IF Soft Rough Approximations
In this section, we introduce the concept of IF soft rough approximation. Some of its properties are studied and examples are presented. The main focus of this paper is to show the scope of this newly introduced concept in the field of data mining and decision making.
Definition 3.1. Let be a full soft set over and a soft approximation space. For an IF set , the IF soft lower rough approximation and IF soft upper rough approximation with respect to the soft approximation space are denoted by and and are defined as follows: for all .
Example 3.2. Suppose that is the universe of the days of a week and the set of parameters are given by , where stands for hot, medium, cold, heavy rain, medium rainy, and not raining. Let us consider a soft set describing the weather. Let us represent Table 1.
Then, , , , , , .
Suppose that Then,
Remark 3.3. (1) which follows from the above example. But it completely is a part of the same object.
(2) If any object is of the form , then , since 0 is the infimum of all members and 1 is the supremum of all non members.
(3) If any object is of the form , then need not be , since there may exist many other elements whose membership value is less than 1, but if , then no other object is in the same mapping . Similarly, .
(4) Let any object be of the form . Now, if , then also there does not exist any object in the same mapping with membership 0 but if other object exists with membership nonzero its nonmembership must be 0.
Remark 3.4. (1) If , then the IF soft rough approximation is said to be simply IF soft approximation.
(2) If for some of the object , then the IF soft rough approximation is said to be simply IF soft oscillating approximation.
(3) If for none of the object , then the IF soft rough approximation is said to be completely IF soft rough approximation. For this case we may consider two more definitions which are known as IF soft stable lower rough approximation and IF soft stable upper rough approximations and are denoted by and .
Definition 3.5. The positive difference between and is denoted by and is said to oscillate in the approximation space, that is, where “” is required since otherwise the membership value of the difference may be negative.
Theorem 3.7. If then we obtain object IF soft approximation space.
Proof. If , then the following two cases may arise:(1)all the object has the same nonzero value for and . Hence, from Remark 3.4, we obtain an IF soft approximation space.(2)If , then the conclusions may be drawn from Remark 3.3.
Theorem 3.8. can never be for any object.
can never be for any object.
Proof. (1) Suppose that , then from the definition we have , that is,
Let , that is, , , that is, . Since , so gives and . Since , gives , that is,
but if and are members of the same mapping , then , which is a contradiction. Hence, .
(2) can be proved similarly.
Remark 3.9. (1) If for all object then the approximation space is IF soft approximation space for all object.
(2) If for some object then the approximation space is If soft oscillating space.
(3) If for all objects then the approximation space is IF soft rough approximation space.
In such cases we need to define an IFSLR set approximation space which is stable; else decisions cannot be drawn for any particular object.
Definition 3.10. An IF soft stable lower rough approximation (IFSSLRA) of with respect to is denoted by and an IF soft stable upper rough approximation by
Theorem 3.12. Let be a full soft set over , and let be a soft approximation space. Then, we have: (1) and ,(2), , ,(3) for any object in ,(4) for any object in ,(5),(6),(7),(8), ,(9).
Proof. It is straightforward.
Remark 3.13. If , then is an IF soft open set. In Example 3.11, are soft open objects, and their memberships are soft open members. Also, if , then is a closed set.
Remark 3.14. (1) Here is the IFSR boundary region.
(a) If then the data is IF soft set.
If , then the data are IF soft rough set. In Example 3.11, the first is IF soft set and is not IF soft rough set but the second one is IFSR set.
(b) if and only if .
(2) Here , where denotes that the value for every object is the IFSR negative region.
(a) If , then if and only if , by Remark 3.3.
(b) if if and only if , where is the value for every object.
Now, let us take an example from .
Example 3.15. Suppose that is the universe consisting of eight persons and the set of parameters are given by , where implies short height, implies tall height, implies blond hair, implies red hair, implies dark hair, implies blue eyes, and implies brown eyes. Let us consider a soft set describing the “attractive person”. Let us represent Table 2.
Let , , , , , and , .
Let us now consider the IF set of an attractive person as per our choice as Here which implies that the approximation space is stable and the IF set taken for the persons is correct and of less error.
Finally, we consider another example from .
Example 3.16. Suppose that is the universe consisting of six persons and the set of parameters are given by , where implies headache, implies musclepain,and implies temperature. Let us consider a soft set describing the “flu infected person”. Let us represent Table 3.
Let , , and . Let us now consider the IF set of a flu infected person as per our choice as Here which implies that the approximation space may not be stable and the IF set taken for the persons is not perfectly correct.
The concepts of IF lower soft rough approximation and IF upper soft rough approximation space are introduced. In the most of the cases, IFSLRA is not stable for that we had introduced a new concept of IFSSLRA space. In some sense almost all concepts we are meeting in every day life are vague rather than precise. This gap between real world and traditional mathematics becomes smaller in recent year. In order to remove this gap, rough set, IF set, a soft set help a lot. The data mining and decision making processes may cross a new milestone after introduction of this new hybridized model. Further study will be needed to establish the utilities of the notions indicated in this paper.
- L. A. Zadeh, “Fuzzy sets,” Information and Computation, vol. 8, pp. 338–353, 1965.
- K. T. Atanassov, “Intuitionistic fuzzy sets,” Fuzzy Sets and Systems, vol. 20, no. 1, pp. 87–96, 1986.
- Z. Pawlak, “Rough sets,” International Journal of Computer and Information Sciences, vol. 11, no. 5, pp. 341–356, 1982.
- D. Molodtsov, “Soft set theory—first results,” Computers & Mathematics with Applications, vol. 37, no. 4-5, pp. 19–31, 1999.
- 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.
- D. Çoker, “An introduction to intuitionistic fuzzy topological spaces,” Fuzzy Sets and Systems, vol. 88, no. 1, pp. 81–89, 1997.
- Y. Y. Yao, A Review of Rough Set Models, Rough Set and Data Mining: Analysis of Imprecise Data, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997.