Database Based Validation of Union of Two Multigranular Rough Sets

Journal Title: INTERNATIONAL JOURNAL OF COMPUTER TRENDS & TECHNOLOGY - Year 2013, Vol 5, Issue 5

Abstract

Most of the traditional tools for undertaking modeling, reasoning and other computing are found not only crisp but also highly deterministic and more precise in character which usually limits their applicability in real life situations led to the extension of the concept of crisp sets so as to model imprecise data and hence enhance their modeling capacity. One such method used to capture impreciseness was carried out by Pawlak who introduced the idea of rough sets, which is found to be an excellent tool to capture impreciseness in data. Several extensions have been made in different directions in order to improve the modeling capacity of the basic rough sets. One among such extension is rough set model based on multigranulations. Several fundamental properties of these types of rough sets have been studied . Pawlak introduced the types of rough sets in as an interesting characterization of rough sets by employing the ideas of lower and upper approximations of rough sets. There are two different ways of characterizing rough sets; the accuracy coefficient and the topological characterization introduced through the notion of types. As referred by Pawlak himself, in general rough sets by knowing the accuracy of a set, we were still unable to tell exactly its topological structure and also the present knowledge about the topological structure of the set gives no information about its accuracy. Therefore in practical applications of rough sets we combine both kinds of information about the borderline region, that is of the accuracy measure as well as the information about the topological classification of the set under consideration. Keeping this in mind, Tripathy and Mitra [9] have studied the types of rough sets by finding out the types of union and intersection of rough sets of different types. Later Raghavan et al have extended these results to the multigranular context in [12]. In this work I provided the database based validated results for the carried out results.

Authors and Affiliations

R. Raghavan

Keywords

Related Articles

Cloud Computing: A Strategy to Improve the Economy of Islamic Societies

Cloud computing is the new technology that significantly change the landscape of businesses as it enables users, companies, and governments to store information in multiple servers and allows on-demand access. The cloud...

Privacy Preservation using Shamir’s Secrete Sharing Algorithm for Data Storage Security

The Cloud computing is a latest technology which provides various services through internet. The Cloud server allows user to store their data on a cloud without worrying about correctness & integrity of data. Cloud d...

Survey on Weighted Frequent Pattern Mining

Data mining is the collection of techniques for the resourceful, automatic discovery of previously unknown, suitable, novel, helpful and understandable patterns in large databases. Frequent pattern mining has emerged as...

Detecting and Localizing the Attackers in Multiple Networks

Spoofing attack which easily attack the network and reduce the performance of the network. In this Paper, Spoofing attacks are detected, Finding the number of attackers that masquerade the node identity, Localizing all t...

Ensuring Accountability for Data Sharing in Cloud

Cloud computing is emerging rapidly as part of latest developments in communication trends and technology. It brought revolution in today’s world among key stakeholders like service providers and consumers. As a result,...

Download PDF file
  • EP ID EP125961
  • DOI -
  • Views 95
  • Downloads 0

How To Cite

R. Raghavan (2013). Database Based Validation of Union of Two Multigranular Rough Sets. INTERNATIONAL JOURNAL OF COMPUTER TRENDS & TECHNOLOGY, 5(5), 236-242. https://europub.co.uk/articles/-A-125961