Geometric Lattice Structure of Covering-Based Rough Sets through Matroids
Covering-based rough set theory is a useful tool to deal with inexact, uncertain, or vague knowledge in information systems. Geometric lattice has been widely used in diverse fields, especially search algorithm design, which plays an important role in covering reductions. In this paper, we construct...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/236307 |