Rough sets over the boolean algebras

Authors:
Gui-Long Liu
Affiliations:
School of Information Sciences, Beijing Language and Culture University, Beijing, P.R. China
Venue:
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Year:
2005

Citing 7
Cited 8

Logic and discrete mathematics: a computer science perspective

Logic and discrete mathematics: a computer science perspective
Roughness of a fuzzy set

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

Rough Sets: Theoretical Aspects of Reasoning about Data
On Generalizing Pawlak Approximation Operators

RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
On the structure of rough approximations

Fundamenta Informaticae
On the existence and construction of T-transitive closures

Information Sciences: an International Journal
Constructive and algebraic methods of the theory of rough sets

Information Sciences: an International Journal

Axiomatic systems for rough sets and fuzzy rough sets

International Journal of Approximate Reasoning
An Equivalent Definition of Rough Sets

RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Algebraic aspects of generalized approximation spaces

International Journal of Approximate Reasoning
Rough set theory based on two universal sets and its applications

Knowledge-Based Systems
Invertible approximation operators of generalized rough sets and fuzzy rough sets

Information Sciences: an International Journal
Short communication: A note on "Rough set theory based on two universal sets and its applications" Knowledge-Based Systems 23 (2010) 110-115

Knowledge-Based Systems
Topological and lattice structures of L-fuzzy rough sets determined by lower and upper sets

Information Sciences: an International Journal
Algebraic properties and measures of uncertainty in rough set on two universal sets based on multi-granulation

Proceedings of the 6th ACM India Computing Convention

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies some matrix properties of rough sets over an arbitrary Boolean algebra, and their comparison with the corresponding ones of Pawlak's rough sets, a tool for data mining. The matrix representation of the lower and upper approximation operators of rough sets is given. Matrix approach provides an explicit formula for computing lower and upper approximations. The lower and upper approximation operators of column vector over an arbitrary Boolean algebra are defined. Finally, a set of axioms is constructed to characterize the upper approximation operator of column vector.