Applications of Matrices to a Matroidal Structure of Rough Sets
Rough sets provide an efficient tool for dealing with the vagueness and granularity in information systems. They are widely used in attribute reduction in data mining. There are many optimization issues in attribute reduction. Matroids generalize the linear independence in vector spaces and are wide...
Saved in:
Main Authors: | Jingqian Wang, William Zhu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/493201 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Geometric Lattice Structure of Covering-Based Rough Sets through Matroids
by: Aiping Huang, et al.
Published: (2012-01-01) -
Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids
by: Aiping Huang, et al.
Published: (2014-01-01) -
Enumerating Matroids and Linear Spaces
by: Kwan, Matthew, et al.
Published: (2023-02-01) -
Connected Degree of Fuzzifying Matroids
by: Xiu Xin, et al.
Published: (2022-01-01) -
q-Rung Orthopair Fuzzy Matroids with Application to Human Trafficking
by: Muhammad Asif, et al.
Published: (2021-01-01)