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

Automatic Generation of Standard Deviation Attribute Profiles for Spectral–Spatial Classification of Remote Sensing Data

In recent years, the development of high-resolution remote sensing image extends the visual field of the terrain features. Back Propagation neural network is widely used in remote sensing image classification in recent y...

Battery-Powered Mobile Computer using Denial of Service

A denial-of-service (DoS) or distributed denial-of-service (DDoS) attack is an attempt to make a machine or network resource unavailable to its intended users. Although the means to carry out, motives for, and targets of...

Efficient Fault-Tolerant Strategy Selection Algorithm in Cloud Computing

Cloud computing is upcoming a mainstream feature of information technology. More progressively enterprises deploy their software systems in the cloud environment. The applications in cloud are usually large scale and con...

A New Web Based Student Annual Review Information System (SARIS) With Student Success Prediction

In this paper, we are proposing new web based Student Annual Review Information System (SARIS) and prediction method for the success of scholar students to China Scholarship Council(CSC). The main objective of developing...

Secure Similarity Search on Outsourced Metric Data

Cloud computing has become an affordable technology for outsourcing data. This will help individuals and organizations to have plethora benefits such as storage, platform, software and other services. In spite of the adv...

Download PDF file
  • EP ID EP125961
  • DOI -
  • Views 92
  • 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