Multi-Granular Computing through Rough Sets

View Sample PDF

Author(s): B. K. Tripathy (VIT University, India)
Copyright: 2014
Pages: 34
Source title: Advances in Secure Computing, Internet Services, and Applications
Source Author(s)/Editor(s): B.K. Tripathy (VIT University, India)and D. P. Acharjya (VIT University, India)
DOI: 10.4018/978-1-4666-4940-8.ch001

Keywords: Information Science Reference / Information Security & Privacy / IT Security and Ethics / Security & Forensics

Purchase

View Multi-Granular Computing through Rough Sets on the publisher's website for pricing and purchasing information.

Abstract

Granular Computing has emerged as a framework in which information granules are represented and manipulated by intelligent systems. Granular Computing forms a unified conceptual and computing platform. Rough set theory put forth by Pawlak is based upon single equivalence relation taken at a time. Therefore, from a granular computing point of view, it is single granular computing. In 2006, Qiang et al. introduced a multi-granular computing using rough set, which was called optimistic multigranular rough sets after the introduction of another type of multigranular computing using rough sets called pessimistic multigranular rough sets being introduced by them in 2010. Since then, several properties of multigranulations have been studied. In addition, these basic notions on multigranular rough sets have been introduced. Some of these, called the Neighborhood-Based Multigranular Rough Sets (NMGRS) and the Covering-Based Multigranular Rough Sets (CBMGRS), have been added recently. In this chapter, the authors discuss all these topics on multigranular computing and suggest some problems for further study.

The IRMA Community

Research IRM

Multi-Granular Computing through Rough Sets

Purchase

Abstract

Related Content

IRMA Sponsors