Solved by verified expert:It’s 3 questions answer them by write the computational formulation of rough set approximations and Consider the following information table
cs836a2_2018.pdf
Unformatted Attachment Preview
CS836 Rough Sets and Applications
Assignment 2
Available on February 5, 2018
Due date: February 16, 2018
1. Give the computational formulation of rough set approximations:
a). Give a definition of information table.
b). Define an equivalence relation in an information table.
c). Define the partition induced by the equivalence relation.
d). Define the atomic Boolean algebra by using the partition as the
set of atoms.
e). Define the rough set approximations.
2. Consider the following information table:
Object
1
2
3
4
5
6
7
8
A
a1
a1
a2
a2
a2
a2
a2
a1
B
b1
b1
b2
b3
b3
b1
b3
b1
C
c1
c2
c1
c1
c1
c1
c2
c2
a). Construct the family of all equivalence relations defined by subsets
of attributes.
1
b). Draw a diagram to show the connections between those equivalence relations.
c). Construct an equivalence relation on the power set of the set of
attributes: two subsets of attributes are equivalent if and only
if they produce the same equivalence relation on U . Give the
partition of the power set of the set of attributes.
3. Show that the conceptual formulation and the computational formulation are equivalent.
2
…
Purchase answer to see full
attachment
