33 citations · 79 across the 35 of their papers we have counts for
26 papers · 1 filter
Geometric lattice structure of covering and its application to attribute reduction through matroids
Aiping Huang, William Zhu
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 l…
Connectedness of graphs and its application to connected matroids through covering-based rough sets
Aiping Huang, William Zhu
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a wi…
Dependence space of matroids and its application to attribute reduction
Aiping Huang, William Zhu
Attribute reduction is a basic issue in knowledge representation and data mining. Rough sets provide a theoretical foundation for the issue. Matroids generalized from matrices have…
Connectivity for matroids based on rough sets
Bin Yang, William Zhu
In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect…
Rough matroids based on coverings
Bin Yang, Hong Zhao, William Zhu
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution red…
Applications of repeat degree on coverings of neighborhoods
Hua Yao, William Zhu
In covering based rough sets, the neighborhood of an element is the intersection of all the covering blocks containing the element. All the neighborhoods form a new covering called…