most citedCharacteristic matrix of covering and its application to boolean matrix decomposition and axiomatization

15 citations · 27 across the 17 of their papers we have counts for

collaborators

17 papers

cs.DB2012

A Comparative Study of Discretization Approaches for Granular Association Rule Mining

Xu He, Fan Min, William Zhu

Granular association rule mining is a new relational data mining approach to reveal patterns hidden in multiple tables. The current research of granular association rule mining con…

cs.AI20121 cited

Cost-sensitive C4.5 with post-pruning and competition

Zilong Xu, Fan Min, William Zhu

Decision tree is an effective classification approach in data mining and machine learning. In applications, test costs and misclassification costs should be considered while induci…

cs.AI20121 cited

Characteristic of partition-circuit matroid through approximation number

Yanfang Liu, William Zhu

Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid…

cs.AI2012

Relationship between the second type of covering-based rough set and matroid via closure operator

Yanfang Liu, William Zhu

Recently, in order to broad the application and theoretical areas of rough sets and matroids, some authors have combined them from many different viewpoints, such as circuits, rank…

cs.AI2012

Geometric lattice structure of covering-based rough sets through matroids

Aiping Huang, William Zhu

Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, esp…

cs.AI2012

Topological characterizations to three types of covering approximation operators

Aiping Huang, William Zhu

Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Topology, one of the most important subjects in mathemat…