Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids
The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially greedy algorithm design which plays an important role in the re...
Main Authors: | Aiping Huang, William Zhu |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/183621 |
Similar Items
-
Geometric Lattice Structure of Covering-Based Rough Sets through Matroids
by: Aiping Huang, et al.
Published: (2012-01-01) -
Four Operators of Rough Sets Generalized to Matroids and a Matroidal Method for Attribute Reduction
by: Jingqian Wang, et al.
Published: (2018-09-01) -
Covering-Based Rough Sets on Eulerian Matroids
by: Bin Yang, et al.
Published: (2013-01-01) -
Applications of Matrices to a Matroidal Structure of Rough Sets
by: Jingqian Wang, et al.
Published: (2013-01-01) -
Lattice Subdivisions and Tropical Oriented Matroids, Featuring Products of Simplices
by: Piechnik, Lindsay C.
Published: (2011)