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...
Saved in:
Main Authors: | Aiping Huang, William Zhu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/236307 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids
by: Aiping Huang, et al.
Published: (2014-01-01) -
Applications of Matrices to a Matroidal Structure of Rough Sets
by: Jingqian Wang, et al.
Published: (2013-01-01) -
A Variable Precision Covering-Based Rough Set Model Based on Functions
by: Yanqing Zhu, et al.
Published: (2014-01-01) -
Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets
by: Shiping Wang, et al.
Published: (2013-01-01) -
SOME PROPERTIES OF INDUCED COVER FROM FAMILY OF COVERING ROUGH SETS
by: Nguyễn Đức Thuần
Published: (2017-09-01)