1 citations · 1 across the 7 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.AI2013
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…
cs.AI2013★ 1 cited
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…