Dependency Through Axiomatic Approach On Rough Set Theory
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 2
Abstract
The idea of rough set consist the approximation of a set by pair of sets called the lower and the upper approximation of the set. In fact, these approximations are interior and closer operations in a certain topology generated by available data about elements of the set. The rough set is based on knowledge of an agent about some reality and his ability to discern some phenomenon processes etc. Thus this approach is based on the ability to classify data obtained from observation, measurement, etc. In this paper we define the dependency of knowledge through the axiomatic approach instead of the traditional (Pawlak) method of rough set.
Authors and Affiliations
Nilaratna Kalia , Dr. Debadutta Mohanty
Keywords
Related Articles
- EP ID EP85254
- DOI -
- Views 136
- Downloads 0
Web Page Segmentation for Small Screen Devices Using Tag Path Clustering Approach
The web pages breathing these days are developed to be displayed on a Desktop PCs and so viewing them on mobile web browsers is extremely tough. Since mobile devices have restricted resources, small screen device users n...
Optimizing a multiple criteria dynamic layout problem using a simultaneous data envelopment analysis modeling Optimizing a DLP using DEA<br />
The main characteristic of today's manufacturing environments is volatility. Under such a volatile environment some parameters like demand is not stable. To operate efficiently under such environments, the facilities mus...
Preserving the Privacy and Sharing the Data using Classification on Perturbed Data
Data mining is a powerful tool which supports automatic extraction of unknown patterns from large amounts of data. The knowledge extracted by data mining process support a variety of domains like marketing, weather forec...
CHARACTER BASED WEIGHTED SUPPORT THRESHOLD LGORITHM USING MULTI CRITERIA DECISION MAKING TECHNIQUE
An association rule technique generally used to generate requent itemsets from databases and generates association rules by considering each item in the datasets. However, the values of items are different in many aspec...
Solving Travelling Salesman Problem using Clustering Genetic Algorithm
Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improv...