Cynthya et al, GJCAT, Vol 1 (2), 2011, 176-183.

176


V.Cynthya
#1

#1
School of Computing Science and Engineering, VIT University, Vellore, India

Abstract Granular computing is one of the emerging new
concepts that receive much attention in recent years. This
granular computing focuses on problem solving based on
common sense concepts of granule, granulated view,
granularity and hierarchy. Granular computing establishes
a sound research agenda that promotes synergy between the
already well established technologies of sets (intervals)
rough sets and fuzzy sets. By effectively using granularity,
granular computing provides a systematic, natural way to
analyze, understand, represent and solve real world
problems. With granular computing, one aims at structured
thinking at the philosophical level and structured problem
solving at the practical level. Knowledge extraction is the
non-trivial extraction of implicit, previously unknown, and
potentially useful information from data. The computer
science community is responding to both the scientific and
practical challenges presented by the need to extract
knowledge in the flood of data..This Granular computing
offers a simple and effective way of extracting information
out of data sets, inspired by the human perception of
grouping similar featured items together. Hence, the aim of
the work is to examine some aspects of Granular
Computing indifferent fields like finding association rules,
how it acts as a basis for consistent classification problems,
how machine learning is performed using this approach.
Finally, we try to give a real life example of knowledge
representation using Granular Computing.

Keywords Granular Computing, Granules, Information
Table, Indiscernibility, Association Rules, Rough set,
Knowledge Representation.

I. INTRODUCTION

Now-a-days Internet is the best example for distributed
computing which involves dispersion of data
geographically. Therefore, it is challenging for human
being to retrieve information from the huge amount of
data available. Hence, it is very difficult to extract
knowledge from the Universe. There were many methods
proposed by researchers in order to extract knowledge
from huge amount of data. There are many traditional
methods such as crisp set, fuzzy set, interval valued fuzzy
set are used. For a complete description of real life
system often one should require by far more detailed data
than a human being could ever recognize, process and
understand. Rough set and Granular Computing is an
approach to extract knowledge and association between
data and values of data in recent years. Universe can be
considered as a large collection of objects. Each object is
associated with some information with it. In order to find
knowledge about the Universe we need to extract some
information about these objects. We need sufficient
amount of information to uniquely identify the objects
which is not possible in case of all objects. Therefore, we
require classification of these objects into similarity
classes to characterize these objects in order to extract
knowledge about the Universe. Each class is called a
granule which is considered as basic building block of
the Knowledge about the Universe. The classification of
the objects of the Universe is done based on
indiscernibility relation among the objects. It indicates
that the objects of a class cannot discern from one
another based on available information. Creating the
granules from the objects of the Universe as a result of
the classification is called granularity of knowledge about
the Universe [1]. Thus Granular Computing involves
processing of granules to find knowledge about the
Universe that focuses on problem solving based on
common sense concepts of granule, granulated view,
granularity and hierarchy. It also establishes synergy
between the already well-established technologies of
rough sets, fuzzy sets and knowledge representation [7,
8]. This paper gives a brief description about how
Granular Computing offers a simple and effective way of
extracting knowledge out of data sets, inspired by the
human perception of grouping similar featured items
together.
II. GRANULAR COMPUTING AND TYPES OF
GRANULATION

Granular Computing is an emerging conceptual and
computing paradigm of information processing. It is
essential human problem solving and hence has a very
significant impact on the design and implementation of
Intelligent systems. It has been motivated by the
increasingly urgent need for intelligent processing of
large quantities of heterogeneous data into a humanly
manageable abstract knowledge. By taking human
knowledge generation as a basic reference, granular
computing offers a landmark change from the current
machine-centric to human-centric approach to
Cynthya et al, GJCAT, Vol 1 (2), 2011, 176-183.

177
information and knowledge [5]. The fundamental issues,
principles and methodologies of granular computing can
be studied based on granular structures from different
perspectives [3] . Different types of granulation are as
follows.
A. Value Granulation(discretization/quantization)
Value granulation is quantization of variables. It means
that reduction of the values associated with a particular
variable to an approximate number by using rounding off
technique. For example consider the roots of equation
(3x-1) = 0 which results in 0.33333 (to an infinite number
of 3s) which is approximately reduced to 2 point of
decimal values such that 0.33.This Value granulation.
B. Variable Granulation(clustering/transformation)
Variable granulation is a term that could describe a
variety of techniques, most of which are aimed at
reducing dimensionality, redundancy, and storage
requirements. This deals with Variable agglomeration
tree that depicts a hierarchical structure comprising
granules at lower level. These granules of similar
characteristics are group under one particular level. The
levels are agglomerated to form a hierarchical structure
which is data abstract in higher levels. When we move
down the tree we deal with global concept and the lower
level granules gives the real knowledge extraction
concepts. This is described using an agglomeration tree
for a shoe product in the following figure Fig1

Fig. 1 Variable Agglomeration Tree
C. System Granulation(aggregation)
In database systems, aggregations (see e.g. OLAP
aggregation) result in transforming original data tables
(often called information systems) into the tables with
different semantics of rows and columns, wherein the
rows correspond to the groups (granules) of original
tuples and the columns express aggregated information
about original values within each of the groups.
D. Concept Granulation (Component Analysis)
This deals with Information System. In general
Information System consists of objects and its attributes,
where each attribute has a value. Mathematically S = (U,
A), where U: Universal set of objects and A: Non empty
finite set of objects.
III. TRIARCHIC THEORY OF GRANULAR
COMPUTING
Granular Computing is viewed as a combinational study
of human-inspired computing, characterized by
structured thinking, structured problem solving and
structured information processing. Granular Computing
deals with both human and machines.

A. Granules and Granular structure
A granular structure provides structured description of a
system or an application. Basic granules are the building
blocks to form a granular to form a granular structure.
They represent the basic human observations of a
problem in the real world. The connections of different
granules form different levels of a granular structure
reflect structured knowledge. A granular structure
contains three basic components
- Internal structure of a granule
- Collective structure of a family of granules
- Hierarchical structure of a web of granules
A granule play two important roles i.e.; either it may be
an element of another granule or it is considered as a part
forming another granule. Granules with similar size or
nature is termed as a level. Each granule provides a local
view and a level provides a global view. The term
hierarchy is used to denote a family of partially ordered
levels, in which each level consists of a family of
interacting and interrelated granules. A single hierarchy
offers one representation and understanding with many
levels of granularity, multiple hierarchies afford a
complete understanding from many views. Granular
structures are therefore a family of hierarchies.
B. Perspectives of Granular Computing
There are three different perspectives of granular
computing.
- At the philosophical level, granular computing
is viewed as a way of structured thinking.
- At the practical level, granular computing is
viewed as a general method of structured
problem solving.
- At the computational level, granular computing
is viewed as a paradigm of information
processing.
C. Granular Computing Triangle
The Granular Computing triangle specifies three
mutually supporting perspectives on viewing,
constructing and working with granular structures as
Cynthya et al, GJCAT, Vol 1 (2), 2011, 176-183.

178
shown in Fig 2. Three different types of Granular
Computing are listed below as follows.
1) Philosophy - Structured Thinking:
In this, a whole thing is divided into smaller parts
using analytical thinking and the subdivided parts are
combined back into a whole using a synthetical
thinking.
2) Methodology - Structured Problem Solving:
Three task involved in this structured problem solving
are constructing granular structures, working within a
particular level of structure and switching between
levels. It promotes systematic way of approaching by
producing effective principle and practical strategies
for solving real world problems.
3) Computation - Structured Information
Processing:
Computation can be related to two basic steps such as
representation and process. Representation deals with
the description of granules and granular structures.
Process deals with procedures of granulation
computation with granules. The three perspectives of
granular computing are connected and mutually
support each other.


Fig. 2 Triarchic Model of Granular Computing
IV. KNOWLEDGE REPRESENTATION AND
REASONING
A. Human Thinking
Thinking and acting are the specific human features of
man. They are peculiar to all human beings. They are,
beyond membership in the zoological species homo
sapiens, the characteristic mark of man as man. Since a
human life cycle is constituted by set of profession/living
activities, reasoning serves these activities achievement.
At that, knowledge is used as the human activities
awareness.
B. Need of Representing a Knowledge
In the field of artificial intelligence, problem solving can
be simplified by an appropriate choice of knowledge
representation. Representing knowledge in some ways
makes certain problems easier to solve. Representing
knowledge in explicit form enables computers to draw
conclusions from knowledge already stored. Knowledge
may be represented as symbol structures (essentially,
complex data structures) representing bits of knowledge
(objects, concepts, facts, rules, strategies). Intelligent
behaviour can be achieved through manipulation of
symbol structures.
- E.g., red represents color red.
- car1 represents my car.
- Red (car1) represents fact that my car is red.
Knowledge representation languages have been designed
to facilitate this. A KR language should allow you to:
- represent adequately the knowledge you need
for your problem (representational adequacy)
- do it in a clear, precise and natural way.
- allow you to reason on that knowledge, drawing
new conclusions.
Knowledge representation languages should have precise
syntax and semantics [6]. You must know exactly what
an expression means in terms of objects in the real world.
Fig 3 shows the way of representing a knowledge
through mapping technique in the real world.

C. Reasoning
The world does not give us complete
information. Reasoning is the set of processes
that enables us to go beyond the information
given.
Finally, we come to know that Knowledge representation
and reasoning is an area of artificial intelligence whose
fundamental goal is to represent knowledge in a manner
that facilitates inferencing (i.e. drawing conclusions)
from knowledge. They are concerned with how
knowledge can be represented symbolically and
manipulated in an automated way by reasoning programs.

Fig. 3 Knowledge Representation
Cynthya et al, GJCAT, Vol 1 (2), 2011, 176-183.

179
V. ROUGH SETS AND FUNDAMENTAL CONCEPTS

Rough sets introduced by Pawlak in 1985 represent a
different mathematical approach to vagueness and
uncertainty. The rough set methodology is based on the
premise that lowering the degree of precision in the data
makes the data pattern more visible. The main goal of
Rough set analysis is induction of approximation of
concepts. It constitutes a sound basis for Knowledge
Discovery and Data Mining (KDD).It offers
mathematical tools to discover patterns hidden in data. It
can be used for feature selection, feature extraction, data
reduction, decision rule generation and pattern extraction
(using association rules), etc...Recent extensions of rough
set theory (Rough Mereology) have developed new
methods for decomposition of large data sets, data
mining in distributed and multi-agent systems and
Granular Computing. Besides this, rough set has the
following advantages
- It is based on the original data only and
does not need any external information;
- It is a tool suitable for analyzing not only
quantitative attributes but also qualitative
ones;
- Provides efficient algorithms for finding
hidden pattern in data;
- Finds minimal sets of data (data reduction);
- Evaluates significance of data;
- Generates sets of decision rules from data;
- It is easy to understand;
- Offers straightforward interpretation of
obtained results;
- Most algorithms based on the rough set
theory are particularly suited for parallel
processing.
In this section we recall the basic definitions of basic
rough set theory developed by Z. Pawlak and the
fundamental concepts on which it stands. Let U be a
finite nonempty set called the universe. Suppose
R U U _ is an equivalence relation on U. Rough set
basically deals with Equivalence Relation. In general,
equivalence relation involves reflexive, symmetric and
transitive.
Reflexive:A relation R on U is said to be reflexive if xRx
x U.
Symmetric:A relation R on U is said to be symmetric if
xRy then yRx.
Transitive:A relation R on U is said to be transitive if
xRy, yRz then xRz.
The equivalence relation R partitions the set U into
disjoint subsets. Elements of same equivalence class are
said to be indistinguishable. Equivalence classes induced
by R are called elementary concepts. Every union of
elementary concepts is called a definable set. The empty
set is considered to be a definable set, thus all the
definable sets form a Boolean algebra and (U, R) is called
an approximation space. Given a target set X, we can
characterize X by a pair of lower and upper
approximations. We associate two subsets RX and RX
called the R lower and Rupper approximations of X
respectively and are given by

{ / : } RX Y U R Y X = e _

(1)
and { / : } RX Y U R Y X | = e =

(2)
The Rboundary of X, ( )
R
BN X is given
by ( )
R
BN X RX RX = . We say X is rough with respect
to R if and only if RX RX = , equivalently
( )
R
BN | X = . X is said to be R definable if and only if
RX RX = or ( )
R
BN X | = . So, a set is rough with
respect to R if and only if it is not R definable.

A. Information System
Let U be the universe of finite non-empty set of
objects. Let A be the finite non-empty set of attributes of
the objects of the universe. With every attribute of A, we
associate a set of its values. The pair S = (U, A) is called
an information system. Here let us consider consumer
product (shoes) as a real world example to exhibit
association rule. For example, consider a set of shoe
records{s1,s2 ,s3 ,s4 ,s5 ,s6,s7 ,s8 ,s9 ,s10 } as the set of
objects of the universe U with a set of attributes {Brand,
Type, Price}. In the Table1 a classical view of the
universe is tabulated. From this table, we find that the
objects s1 and s9 has same set of attribute values for their
attributes. It means that objects s1 and s9 are identical
based on the given set of attributes.

TABLE I

CLASSICAL VIEW OF UNIVERSE

Shoes Brand Type Price
S1 Reebok Formals 2000
S2 Nike Boots 2500
S3 Addidas Sports 1500
S4 Reebok Sports 2500
S5 Puma Boots 2000
S6 Puma Boots 1500
S7 Addidas Sports 1500
S8 Nike Formals 2500
S9 Reebok Formals 2000
S10 Reebok Formals 1500

Cynthya et al, GJCAT, Vol 1 (2), 2011, 176-183.

180
B. Indiscernibility Relation
Universe can be considered as a large collection of
objects. Each object is associated with some information
(data, knowledge) within it. In order to find knowledge
about the universe we need to process these attribute
values. Due to the lack of sufficient information about the
universe we cannot uniquely identify each element of the
universe. To characterize the elements of the universe and
to extract knowledge about the universe we classify the
elements of the universe based on indiscernibility relation.
The classification results in a set of classes called granules
which are basic building blocks of the knowledge about
the universe. Rough set processes these granules and
produces possible patterns and associations. Creating
granules from the objects of the universe as the result of
the classification is called knowledge granulation
(granularity of the knowledge). Therefore, the concept of
indiscernibility is prior to the concept of granularity. For
example, given the attributes brand, type and price {s1,
s6, s8, s9} are indiscernible in Table I. Similarly, the other
indiscernible classes obtained are {s3, s7}, {s2}, {s4},
{s5} and {s10}.
C. Illustration of Rough Set and Approximations
Consider the Information System discussed earlier in
Table I. The equivalence relation represented using the
given information system can be represented in the
following specification
(i) Let R
1
be a relation defined as
x R
1
y: x and y are of same Brand
(ii) Let R
2
be a relation defined as
x R
2
y: x and y are of same Type
(iii) Let R
3
be a relation defined as
x R
3
y: x and y are of same Price
The equivalence classes generated from the above
equivalence relations are mentioned below.
S/ R
1
: {{S
1,
S
4 ,
S
6,
S
8,
S
9,
S
10
}, {S
2
}, {S
3,
S
7
},
{S
5
}}
S/ R
2
: {{S
1,
S
6,
S
8,
S
9,
S
10
}, {S
2,
S
5
}, {S
3,
S
4,
S
7
}}
S/ R
3
: {{S
1,
S
5,
S
6,
S
8,
S
9
}, {S
2,
S
4
}, {S
3,
S
7,
S
10
}}
These are Elementary Concepts. Intersection of
Equivalence relations is also an equivalence relation [9].
Therefore, on taking R= ( R
1,
R
2,
R
3
) we get the following
equivalence class

U/ R: {{U
1,
U
6 ,
U
8 ,
U
9
}, {U
3,
U
7
}, {U
2
}, {U
4
}, {U
5
},
{U
10
}}

This provides better knowledge than the elementary
knowledge.

Let X be a target set belonging to the universal set U.
Sometimes it is observed that X may not be particular
class based on the attributes. As a result, we cannot
express X exactly. This is because, it may include and
exclude some objects that are indiscernible on the basis
of attributes. Since, X is not exact, so we can express X
approximately with the help of lower and upper
approximation, as explained in equation (1) and (2).
For example: consider X = {U
1,
U
3,
U
7
} as target set.
Therefore, the lower and upper approximation is defined
as below.
- Lower Approximation = {S
3,
S
7
}
- Upper Approximation = {S
1,
S
6,
S
8,
S
9
, S
3,
S
7
}

Since the lower approximation is not equal to upper
approximation, then the target set X is a rough set. The
above concept can be explained in terms of a diagram as
follows. In Fig 4, each square box is considered as an
equivalence class.


Fig. 4 Diagrammatic Representation of Rough Set
VI. ASSOCIATION RULE AND GRANULAR
COMPUTING
A. Association Rule
In data mining, association rule learning is a popular and
well researched method for discovering interesting
relations between variables in large databases .Finding
frequent patterns, associations, correlations, or casual
structures among set of items or objects in transactional
databases, relational databases and other information
repositories. Thus, mining association rules is a common
data mining technique to find knowledge about the
universe.
B. Granular Computing
Due to the lack of sufficient information about the
universe we cannot uniquely identify each element of the
universe. To characterize the elements of the universe
and to extract knowledge about the universe we classify
the elements of the universe based on indiscernibility
relation. The classification results in a set of classes
called granules which are basic building blocks of the
knowledge about the universe. Granular computing
processes these granules and produces possible patterns
and associations. Universe can be considered as a large
collection of objects. There is some information
associated with each object. To find knowledge about the
universe we need to extract some information about these
Cynthya et al, GJCAT, Vol 1 (2), 2011, 176-183.

181
objects. We cannot uniquely identify some objects due to
the lack of sufficient information about the objects of the
universe. Therefore, we require classification of these
objects into similarity classes to characterize these
objects and to extract knowledge about the universe.
Each class is called a granule which is a basic building
block of the knowledge about the universe. The
classification of the objects of the universe is done based
on indiscernibility relation among the objects. It indicates
that objects of a class cannot discern from one another
based on available set of attributes of the objects.
Creating granules from the objects of the universe as the
result of the classification is called knowledge
granulation (granularity of the knowledge). Therefore,
the concept of indiscernibility is prior to the concept of
granularity. Processing the granules to find knowledge
about the universe is called granular computing. Granular
computing processes these granules and produces
possible patterns and associations among the attribute
values of the objects of the universe. Association rule is a
type of relationship among attribute values of the objects
of the universe. In this paper, we study the concept of
indiscernibility and granular computing. We study
association rules among the attribute values of the objects
of the universe by using traditional method and granular
computing method. Finally, we compare both the
methods in terms of finding association rules. In Table II,
Bit computing view of above classical view of the
universe as described in Table I is tabulated and the
Granular computing view of the objects of the universe is
tabulated in Table III.
TABLE III

BIT COMPUTING VIEW OF UNIVERSE

Object Granule
S1 1000000010
S2 0100000000
S3 0010001000
S4 0001000000
S5 0000100000
S6 0000010000
S7 0010001000
S8 0000000100
S9 1000000010
S10 0000000001
TABLE IIIII

GRANULAR COMPUTING VIEW OF UNIVERSE

Object Granule
S1 {s1,s9}
S2 S2
S3 {s3,s7}
S4 S4
S5 S5
S6 S6
S7 {s3,s7}
S8 S8
S9 {s1,s9}
S10 S10

C. Mining Association Rules Using Granular Computing
In this section, we show how granular computing is used
in finding association rules. In granular computing, a set
of attribute values is called an association rule if they
satisfy certain criteria. If a set of attribute values is an
association rule, all the attribute values in the set are said
to be associated with one another. To find association
rules we find granules based on each attribute as shown
in the Table IV.To check whether a set of attribute values
is an association rule or not, we perform the AND
operation among the bit representation of the attribute
values of this set. If number of 1s in the result of AND
operation is greater than or equal to minimum support,
then it is an association rule, otherwise it is not an
association rule.
TABLE IVV

GRANULES BBASED ON INDIVIDUAL ATTRIBUTES

GRANULES
BASED ON
ATTRIBUTE
VALUE
GRANULES
AS LIST
GRANULES
AS BIT
Brand Reebok
Nike
Addidas
Puma
{s1,s4,s9,s10}
{s2,s8}
{s3,s7}
{s5,s6}
1001000011
0100000100
0010001000
0000110000
Type Formals
Boots
Sports

{s1,s8,s9,s10}
{s3,s4,s7}
{s2,s5,s6}
1000000111
0011001000
0100110000

Price 1500
2000
2500
{s3,s6,s7,s10}
{s1,s5,s9}
{s2,s4,s8}
0010011001
1000100010
0101000100
Cynthya et al, GJCAT, Vol 1 (2), 2011, 176-183.

182

Let us consider two examples to see how association rule
is being satisfied in two different cases. Here let us
assume that the minimum support is 2.
Case-1
Check {Formals, 2000} using AND operation and it is
represented in Table V

TABLE V

AND OPERATION BETWEEN TWO ATTRIBUTE VALUES

Attribute Values Granules
Formals 1000000111
2000 1000100010
AND 1000000010

Result:
Since the number of 1s in the result of AND operation is
greater than or equal to the minimum support 2, thus
{Formals, 2000} is an association rule.

Case-2
Check {Reebok, Boots, 2500} using AND operation and
it is represented in Table VI.

TABLE VI

AND OPERATION AMONG THREE ATTRIBUTE VALUES

Attribute Values Granules
Reebok 1001000011
Boots 0011001000
2500 0101000100
AND 0001000000

Result:
Since number of 1s in the result of AND operation is1
which is less than minimum support 2, {Reebok, Boots,
2500} is not an association rule.

From the analysis {Formals, 2000} is an association rule
with bit representation of Formals and 2000
as1000000111 and1000100010 respectively. The bit
representation of the AND operation between them is
1000000010. It means that, the attribute values Formals
and 2000 are present in the two objects of the universe.
i.e. 1 9 {b 1 ,b 9} . Also, {Formals, 2000} is an
association rule of length two since it consists of two
attribute values of two different attributes. First we find
all possible association rules of length two, and then all
possible association rules of length three and so on, as we
have discussed in the conventional method. For better
understanding the AND operation between different
attribute values is presented in Table VII

TABLE VII

AND OPERATION AMONG THREE ATTRIBUTE VALUES

Set of attribute values AND operation among
attribute values
{Reebok,Formals,2000} 1000000010
{Addidas,Boots,1500} 0010001000
{Nike,Sports,2500} 0100000000
{Reebok,Boots,2500} 0001000000
{Puma,Sports,2000} 0000100000
{Puma,Sports,1500} 0000010000
{Nike,Formals,2500} 0000000100
{Reebok,Formals,1500} 0000000001


VI. CONCLUSIONS

This Granular computing is more efficient than
Conventional method while studying association rules in
large databases since AND operation is performed among
attribute values to provide an association rule. The
triarchic theory enables us to study granular computing as
a field in its wholeness .It draws results from many
fields: 1) Results from the general systems theory,
regarding efficient evolution of complex systems and
organized complexity, suggest that multilevel
hierarchical granular structures used in granular
computing are suitable for describing complex real-world
problems.2) Results from cognitive science and
psychology on human guessing, knowing, thinking and
languages provide evidence to support the philosophical
view of granular computing.3) The systematic study of
human problem solving, strategies and heuristics,
knowledge representation and search, in artificial
intelligence and computer programming may provide the
necessary models, methods, and tools, which serves as a
methodological foundation of granular computing.4)
Advances in information processing and related systems
may help us to establish a computational basis of
granular computing.
Finally, Rough Set provides better Knowledge than
Classical Set. While studying larger databases, it is easier
to handle the datasets with the help of equivalence
relations. While studying Expert Systems, Decision
Rules, and Knowledge Representation Rough Set plays a
vital role as we are considering the intersection of all the
relations that is generated by considering attributes.
Many deviations to Rough Sets has also been studied by
many people for different applications.

Cynthya et al, GJCAT, Vol 1 (2), 2011, 176-183.

183
REFERENCES

1. Madan Lal Kumawat and D. P. Acharjya: Knowledge
Granulation, Association Rules and Granular Computing;
Second National Conference on Advanced Technologies in
Electrical Engineering on 19, March 2010.

2. Bing Zhou: A Logic Approach to Granular Computing.

3. Y. Y. Yao: Three Perspectives Granular Computing;
Proceedings of International Forum on Theory of Granular
Computing from Rough Set perspective, Journal of
Nanchang Institute of Technology, (2006).

4. Y. Y. Yao: Granular Computing; Proceedings of 4
th
Chinese
National Conference on Rough Sets and Soft Computing,
Computer Science (Ji Suan Ji Ke Xue), Volume 31, pp. 1-5,
2004.

5. J. T. Yao and Y. Y. Yao: A Granular Computing Approach
to Machine Learning.

6. William J. Frankley, Gregory Piatetshy-Shapiro, and
Christopher J. Matheus: Knowledge Discovery in Databases:
An Overview; Artificial Intelligence Magazine Volume 13
(3) (1992); pp 57-70.

7. Z. Pawlak: Rough Sets-Theoretical Aspects of Reasoning
about Data; Kluwer Academic Publishers, Dordrecht,
London (1991).

8. D. P. Acharjya: Comparative Study of Rough Sets on Fuzzy
Approximation Spaces and Intuitionistic Fuzzy
Approximation Spaces; International Journal of
Computational and Applied Mathematics ISSN 1819-4966
Volume 4 Number 2 (2009), pp. 95106 Research India
Publications.
9. B.K.Tripathy, D. P. Acharjya and V.Cynthya: A Framework
for Intelligent Medical Diagnosis using Rough set with
Formal Concept Analysis; International Journal of Artificial
Intelligence and Applications, Volume 2 Number 2 (April
2011), pp. 4566.

AUTHOR

V. Cynthya, received the B. E. in
Computer Science from Karunya
University, Coimbatore, India in 2009.
She has completed her M. Tech.
(CSE) degree in VIT University,
Vellore, India. She has keen interest in
teaching and applied research. She has
international publication. Her research
interests include rough sets, granular computing, formal
concepts and knowledge mining.