Lattice for covering rough approximations

Dipankar Ranaa,* and Sankar Kumar Royb

Lattice for covering rough approximations

Authors :

Dipankar Rana^a,* and Sankar Kumar Roy^b

Author Address :

^a,b Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721102, West Bengal, India.

Abstract :

Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this type of data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough sets. This paper presents the lattice based on covering rough approximations and lattice for covering numbers. An important result is investigated to illustrate the paper.

Keywords :

Covering, Rough Set, Lattice, Covering approximation.

DOI :

Article Info :

Received : October 19, 2012; Accepted : April 14, 2014.