Search Results for author:
Found 4 papers, 0 papers with code
Geometric lattice structure of covering and its application to attribute reduction through matroids
Second, considering that all the closed sets of a finite matroid form a geometric lattice, we propose a dependence space through matroids and study the attribute reduction issues of the space, which realizes the application of geometric lattices to attribute reduction.
Dependence space of matroids and its application to attribute reduction
Rough sets provide a theoretical foundation for the issue.
Connectedness of graphs and its application to connected matroids through covering-based rough sets
First, we present an approach to inducing a covering by a graph, and then study the connectedness of the graph from the viewpoint of the covering approximation operators.
Matrix approach to rough sets through vector matroids over a field
First, a matrix representation of an equivalence relation is proposed, and then a matroidal structure of rough sets over a field is presented by the matrix.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
