Comparative Study of Rough Sets On Fuzzy Approxima-1-12
Comparative Study of Rough Sets On Fuzzy Approxima-1-12
D. P. Acharjya
Abstract
1. Introduction
The concept of classical sets has been extended in many directions as far as modelling
of real life situations are concerned. L. A. Zadeh [12] extended the concept of
classical set to the notion of fuzzy sets that captures impreciseness in information. On
the other hand on introducing rough sets Z. Pawlak [6] captured indeiscernibility
among objects to model imperfect knowledge [7], [8], [9]. A set of data is generally
disorganized, especially at the age of Internet. On the other end much useful
knowledge is hidden in the accumulated voluminous data. Therefore, changing data
into knowledge is not a straight forward task. Rough set, which is based upon the
approximation of a set by a pair of sets with respect to some imprecise information, is
a formal framework for the automated transformation of data into knowledge.
96 D. P. Acharjya
Definition 2.3 Let R be a fuzzy proximity relation on U. We say that two elements x
and y are α -similar, α ∈ [0, 1], with respect to R if ( x, y ) ∈ Rα and we write xRα y .
Definition 2.4 Two elements x and y are said to be α -identical with respect to R if
either x is α -similar to y or x is transitively α -similar to y with respect to R, i.e., there
exists a sequence u1 , u2 , u3 ,L , un in U such that xRα u1 , u1Rα u2 , u2 Rα u3 , L , un Rα y . If
Comparative Study of Rough Sets on Fuzzy 97
x and y are α -identical with respect to R, then we write xR (α ) y , where the relation
R (α ) , for each fixed α ∈ [0, 1] is an equivalence relation on U.
Definition 2.5 The pair (U, R) is called a fuzzy approximation space. For any α ∈ [0,
1], we denote by Rα* , the set of all equivalence classes of R (α ) . Also, we call
(U, R (α )) , the generated approximation space associated with R and α.
Definition 2.6 Let (U, R) be a fuzzy approximation space and let X ⊆ U . Then the
rough set of X in (U, R (α )) is denoted by ( X α , X α ) , where X α is the α-lower
approximation of X whereas X α is the α-upper approximation of X. We define X α
and X α as
X α = U{Y : Y ∈ Rα* and Y ⊆ X } (2.3)
and X α = U{Y : Y ∈ Rα* and Y I X ≠ φ} (2.4)
Definition 3.4 Let R is an IF-proximity relation on U. We say that two elements x and
y are (α , β ) - similar with respect to R if ( x, y ) ∈ Rα , β and write x Rα , β y .
Definition 3.5 Let R is an IF-proximity relation on U. We say that two elements x and
y are (α , β ) - identical with respect to R for (α , β ) ∈ J , written as xR (α , β ) y if and
only if x Rα , β y or there exists a sequence of elements u1 , u2 , u3 ,L , un in U such that
x Rα , β u1 , u1 Rα , β u2 , u2 Rα , β u3 ,L , un Rα , β y . In this case we say that x is transitively
(α , β ) -similar to y with respect to R.
Institution IC IF PP RS SS
I1 229 151 303 169 56
I2 226 145 266 167 54
I3 227 142 298 169 53
I4 179 117 247 160 53
I5 188 135 251 152 51
I6 130 120 209 149 48
I7 100 113 151 143 39
I8 97 115 245 146 47
I9 96 75 144 147 40
I10 110 59 138 139 42
Comparative Study of Rough Sets on Fuzzy 101
I10 0.540, 0.570, 0.585, 0.710, 0.620, 0.695, 0.730, 0.720, 0.920, 1.000,
0.219 0.211 0.206 0.165 0.196 0.170 0.157 0.161 0.059 0.000
0.036 0.033 0.036 0.022 0.010 0.005 0.005 0.000 0.001 0.012
I9 0.890, 0.900, 0.890, 0.935, 0.975, 0.990, 0.980, 0.995, 1.000, 0.960,
0.034 0.031 0.034 0.021 0.008 0.003 0.006 0.001 0.000 0.014
I10 0.850, 0.860, 0.850, 0.895, 0.935, 0.950, 0.980, 0.965, 0.960, 1.000,
0.048 0.045 0.048 0.035 0.022 0.017 0.007 0.012 0.014 0.000
0.196 0.193 0.194 0.142 0.153 0.080 0.000 0.119 0.101 0.157
I8 0.472, 0.484, 0.480, 0.672, 0.636, 0.868, 0.756, 1.000, 0.738, 0.720,
0.202 0.200 0.201 0.149 0.160 0.072 0.119 0.000 0.130 0.161
I9 0.468, 0.480, 0.476, 0.668, 0.632, 0.775, 0.810, 0.738, 1.000, 0.920,
0.205 0.202 0.203 0.151 0.162 0.115 0.101 0.130 0.000 0.059
I10 0.524, 0.536, 0.532, 0.710, 0.620, 0.695, 0.730, 0.720, 0.920, 1.000,
0.219 0.211 0.206 0.165 0.196 0.170 0.157 0.161 0.059 0.000
Analysis
If we give importance to all the parameters, that is, more intellectual capital having
high infrastructure, excellent placement with high recruiter and student satisfaction
score to rank an institution in a group of institutions up to particular levels of
membership and non-membership than it has to consider the common cases by taking
the intersection of all the above relations. The IF-approximation space (U, R (α , β ))
generated from all IF-proximity relations R1 , R 2 , R 3 , R 4 and R 5 corresponding to all
attributes is given above.
The equivalence classes of different relations according to intuitionistic fuzzy
approximation spaces corresponding to the value α ≥ 0.8 and β ≤ 0.1 are given by,
U R1 (α , β ) = {{Ι1 , Ι 2 , Ι3 , Ι 4 , Ι 5 , Ι 6 , Ι 7 , Ι8 , Ι9 , Ι10 }}
U R 2 (α , β ) = {{Ι1 , Ι 2 , Ι3 , Ι 4 , Ι 5 , Ι 6 , Ι 7 , Ι8 },{ Ι9 , Ι10 }}
U R 3 (α , β ) = {{Ι1 , Ι 2 , Ι 3 , Ι 4 , Ι5 , Ι 6 , Ι 7 , Ι8 , Ι 9 , Ι10 }}
U R 4 (α , β ) = {{Ι1 , Ι 2 , Ι3 , Ι 4 , Ι 5 , Ι 6 , Ι 7 , Ι8 , Ι9 , Ι10 }}
U R 5 (α , β ) = {{Ι1 , Ι 2 , Ι 3 , Ι 4 , Ι5 , Ι 6 , Ι 7 , Ι8 , Ι 9 , Ι10 }}
U R(α , β ) = {{Ι1 , Ι 2 , Ι 3 , Ι 4 , Ι5 , Ι 6 , Ι 7 , Ι8 },{Ι9 , Ι10 }}
Now,
U (R − {R 1})(α , β ) = {{Ι1 , Ι 2 , Ι 3 , Ι 4 , Ι5 , Ι 6 , Ι 7 , Ι8 },{Ι 9 , Ι10 }} = U R(α , β )
U (R − {R 2 })(α , β ) = {{Ι1 , Ι 2 , Ι 3 , Ι 4 , Ι5 , Ι 6 , Ι 7 , Ι8 , Ι9 , Ι10 } ≠ U R(α , β )
U (R − {R 3 })(α , β ) = {{Ι1 , Ι 2 , Ι 3 , Ι 4 , Ι5 , Ι 6 , Ι 7 , Ι8 },{Ι 9 , Ι10 }} = U R(α , β )
U (R − {R 4 })(α , β ) = {{Ι1 , Ι 2 , Ι3 , Ι 4 , Ι 5 , Ι 6 , Ι 7 , Ι8 },{Ι9 , Ι10 }} = U R(α , β )
U (R − {R 5 })(α , β ) = {{Ι1 , Ι 2 , Ι 3 , Ι 4 , Ι5 , Ι 6 , Ι 7 , Ι8 },{Ι 9 , Ι10 }} = U R(α , β )
So, it is clear from the above analysis that the relation R 2 is (α , β ) -
indispensable in R, since U (R − {R 2 })(α , β ) ≠ U R(α , β ) whereas the relation R1 is
(α , β ) - dispensable in R, since U (R − {R 1})(α , β ) = U R(α , β ) . Similarly the
relations R 3 , R 4 and R 5 are also (α , β ) - dispensable in R. That means that the
attribute infrastructure facility is significant for ranking of the institutes whereas the
attributes intellectual capital, placement performance, recruiter’s satisfaction score
and student’s satisfaction score do not play significant role in ranking of the institutes
in accordance with the control parameter values α ≥ 0.8 and β ≤ 0.1 .
Comparative Study of Rough Sets on Fuzzy 105
5. Conclusion
We continue our study in [2] and [1] further in this paper by showing that rough sets
on intuitionistic fuzzy approximation spaces provide a better model than rough sets on
fuzzy approximation spaces for suitable values of the control parameters. To illustrate
this we continued with the example of ranking of institutes introduced and studied in
[1].
6. Acknowledgment
I express my deep sense of gratitude and indebtedness to my esteemed teacher and
supervisor Prof. B. K. Tripathy, School of Computing Sciences, VIT University for
his ingenious guidance, sincere advice and valuable suggestions in preparing this
paper. I am very thankful for the support of VIT University where I carried out this
work.
106 D. P. Acharjya
References
[1] Acharjya, D. P., and Tripathy, B. K., 2009, “Rough Sets on Intuitionistic
Fuzzy Approximation Spaces and Knowledge Representation,” International
Journal of Artificial Intelligence and Computational Research., 1(1), pp. 29-36.
[2] Acharjya, D. P., and Tripathy, B. K., 2008, “Rough Sets on Fuzzy
Approximation Spaces and Application to Distributed Knowledge Systems,”
International Journal of Artificial Intelligence and Soft Computing., 1(1), pp.
1-14.
[3] Atanasov, K. T., 1986, “Intuitionistic Fuzzy Sets,” Fuzzy Sets and Systems.,
20, pp. 87-96.
[4] De, S. K., 1999, “Some Aspects of Fuzzy sets, Rough sets and Intuitionistic
Fuzzy sets,” Ph.D. thesis, IIT, Kharagpur, India.
[5] Pawlak, Z., 1982, “Rough sets,” International Journal Comp and Information
Science., 2, pp. 341–356.
[6] Pawlak, Z., 1991, “Rough sets, Theoretical aspects of reasoning about data,”
Kluwer Academic Publishers, Dordrecht, The Netherlands.
[7] Pawlak, Z., and Skowron, A., 2007, “Rudiments of rough sets,” Information
Sciences., 177(1), pp. 3-27.
[8] Pawlak, Z., and Skowron, A., 2007, “Rough sets: Some extensions,”
Information Sciences., 177(1), pp. 28-40.
[9] Pawlak, Z., and Skowron, A., 2007, “Rough sets and Boolean reasoning,”
Information Sciences., 177(1), 41–73.
[10] Tripathy, B. K., 2006, “Rough Sets on Intuitionistic Fuzzy Approximation
Spaces,” IEEE Conference on Intelligent Systems., pp.776–779.
[11] Tripathy, B. K., and Mitra, A., “Topological Properties of Rough Sets and
Applications,” International Journal of Granular Computing, Rough Sets and
Intelligent System., communicated.
[12] Zadeh, L. A., 1965, “Fuzzy sets,” Information and Control., 8, pp. 338-353.
Biographical Notes
D P Acharjya is presently working as Associate Professor in the School of Computing
Sciences, VIT University, at Vellore, India. His 15 years of experience in higher
education include as a faculty member, reviewer, academic councilor, academic guide
and member of board of studies. He obtained his M. Tech. (Comp. Sc.) from Utkal
University, M. Phil. from Berhampur University and M. Sc. from National Institute of
Technology, Rourkela. He has been awarded with Gold Medal in M. Sc. He is a life
member of CSI, ISTE, IMS, AMTI, ISIAM, IACSIT, IAENG and Orissa Information
Technology Society (OITS). He was founder secretary of OITS Rourkela Chapter. He
has authored many national and international papers and three books to his credit. His
present area of research includes rough sets, fuzzy sets, knowledge representation,
granular computing, data mining and business intelligence.