15 citations · 27 across the 16 of their papers we have counts for
16 papers
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…
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…
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…
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…
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…
Lattice structures of fixed points of the lower approximations of two types of covering-based rough sets
Qingyin Li, William Zhu
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used exte…