(IJCSIS) International Journal of Computer Science and Information Security,Vol. 10, No. 4, April 2012
Example2
. Continuing from Example 1, assumeX={Obj
(1)
,Obj
(4)
}. The lower and the upperapproximations of attribute DP with respect to X canbe calculated as follows:DP
*
(X) = Ø, andDP
*
(X) = {{ obj
(1)
, obj
(2)
, obj
(3)
}{ obj
(4)
, obj
(7)
}}.After the lower and the upper approximations havebeen found, the roughset theory can then be used toderive certain information and induce certain andpossible rules from them (GrzymalaBusse, 1988).III.
Α

CUT AND FUZZY CLASS SETS
An α
level set of a fuzzy set A of X is a nonfuzzydenoted by [A]
α
and is defined by,
0))(supp(
0)({
[A]
if Aclif t A X t
(3)Where cl (supp(A)) denotes the closure of thesupport of A.
Definition 1
(Support) Let A be a fuzzy subset of X; the support of A, denoted supp(A), is the crispsubset of X whose element all have nonzeromembership grades in A.
}.0)({)(sup
x A X x A p
(4)
Definition 2
(triangular fuzzy number) A fuzzy setA is called triangular fuzzy number with peak (or
center) a, left width α>0 and right width β>0 if its
membership function has the following from,
otherwiseat ifaat
at ifat a
0 / )(1
/ )(1
A(t)
(5)And we use the notation A= (a
, α, β
). It can easilybe verified that,
].1,0[],)1(,)1([[A]
aa
(6)The support of A is (a
α
, a
+β).
In the past, the roughset theory was widely used in dealing with dataclassification problems [10]. Most conventionalmining algorithms based on the roughset theoryidentify relationships among data using crisp classsets values. This possible exist class sets withquantitative values, however, are commonly seen inrealworld applications. In this paper, we thus dealwith the problem of learning from class quantitativedata sets based on rough sets. A learning algorithm isproposed, which can simultaneously derive certainand possible rules from class quantitative data sets.Class sets with quantitative values are firsttransformed into fuzzy sets of linguistic terms usingmembership functions. Therefore, convert fuzzy class
sets with α
cut define to several crisp subclasses.Number of divisions arbitrary,
that α
cut perform onthe linguistic terms.IV.
N
OTATION
Notation used in this paper is described as follows:
U
universe of all objects
n
total number of training examples(objects) in U
Obj
(i)
ith training example (object), 1 ≤i ≤n
A
set of all attributes describing U
m
total number of attributes in A
B
an arbitrary subset of A
A
j
jth attribute, 1≤ j≤ m

A
j

number of attribute values for Aj
v
j(i)
the value of A
j
for Obj
(i)
d
number of divisions arbitrary , that
α
cutperform on the linguistic terms
C
set of classes to be determined
c
total number of classes in C
R
k
kth fuzzy region of C,1 ≤k ≤c
e
(i)
the value of C for Obj
(i)
f
(i)
the fuzzy set converted from e
(i)
f
k(i)
the membership value of e
(i)
in region R
k
X
l
lth class, 1 ≤ l≤ (c×d)
B(Obj
(i)
)
the fuzzy incomplete equivalenceclasses in which Obj
(i)
exists
B
*
(X)
the fuzzy incomplete lower approximationfor B on X
B
*
(X)
the fuzzy incomplete upper approximationfor B on XThese fuzzy equivalence relations thus partitionthe fuzzy object set U into several fuzzy subsets thatmay overlap, and the result is denoted by U/B. The setof partitions, based on B and including Obj
(i)
, isdenoted B(Obj
(i)
). Thus, B(Obj
(i)
)= {(B
1
(Obj
(i)
) …
(B
r
(Obj
(r)
) }, where r is the number of partitionsincluded in B(Obj
(i)
).
114http://sites.google.com/site/ijcsis/ISSN 19475500