On Covering Based Approximations of Classifications of Sets

Authors:
B. K. Tripathy;G. K. Panda
Affiliations:
Professor, SCS, VIT University, Vellore, India 632014;Director, MITS School of Biotechnology, Bhubaneswar, Orissa, India 760024
Venue:
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
Year:
2009

Citing 8
Cited 1

Extensions and intentions in the rough set theory

Information Sciences: an International Journal
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Reduction and axiomization of covering generalized rough sets

Information Sciences: an International Journal
Topological approaches to covering rough sets

Information Sciences: an International Journal
A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets

Information Sciences: an International Journal
On Three Types of Covering-Based Rough Sets

IEEE Transactions on Knowledge and Data Engineering
Basic Concepts in Covering-Based Rough Sets

ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 05
Rough approximations on a complete completely distributive lattice with applications to generalized rough sets

Information Sciences: an International Journal

Covering based approximation – a new type approach

International Journal of Computational Vision and Robotics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Approximations of classifications, introduced and studied by Grzymala Busse [4], and approximations of sets are two different issues (Pawlak [9]) and the equivalence classes of approximate classifications can not be arbitrary sets. Busse [4] had established properties of approximations of classifications which were recently extended to necessary and sufficient type theorems by Tripathy et al. [12]. Recently, basic rough sets have been extended to introduce covering based rough sets. In this paper we introduce the notion of covering based approximations of classifications and study their properties.