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: | Aiping Huang, William Zhu |
---|---|
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 |
Similar Items
-
Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids
by: Aiping Huang, et al.
Published: (2014-01-01) -
Covering-Based Rough Sets on Eulerian Matroids
by: Bin Yang, et al.
Published: (2013-01-01) -
Matroidal Structure of Rough Sets Based on Serial and Transitive Relations
by: Yanfang Liu, et al.
Published: (2012-01-01) -
Applications of Matrices to a Matroidal Structure of Rough Sets
by: Jingqian Wang, et al.
Published: (2013-01-01) -
Matroidal Structure of Generalized Rough Sets Based on Tolerance Relations
by: Hui Li, et al.
Published: (2014-01-01)