W
William Zhu
Researcher at University of Electronic Science and Technology of China
Publications - 220
Citations - 7160
William Zhu is an academic researcher from University of Electronic Science and Technology of China. The author has contributed to research in topics: Rough set & Matroid. The author has an hindex of 37, co-authored 219 publications receiving 6328 citations. Previous affiliations of William Zhu include Chinese Academy of Sciences & University of Auckland.
Papers
More filters
Journal ArticleDOI
Reduction and axiomization of covering generalized rough sets
William Zhu,Fei-Yue Wang +1 more
TL;DR: It has been proved that the reduct of a covering is the minimal covering that generates theSame covering lower approximation or the same covering upper approximation, so this concept is also a technique to get rid of redundancy in data mining.
Journal ArticleDOI
Topological approaches to covering rough sets
TL;DR: This paper explores the topological properties of covering-based rough sets, studies the interdependency between the lower and the upper approximation operations, and establishes the conditions under which two coverings generate the same lower approximation operation and the same upper approximation operation.
Journal ArticleDOI
Relationship between generalized rough sets based on binary relation and covering
TL;DR: The equivalency between this type of covering-based rough sets and a type of binary relation based rough sets is established and axiomatic systems for this type-of-covering lower and upper approximation operations are presented.
Journal ArticleDOI
On Three Types of Covering-Based Rough Sets
William Zhu,Fei-Yue Wang +1 more
TL;DR: The relationships among the definable sets are investigated, and certain conditions that the union of the neighborhood and the complementary neighborhood is equal to the indiscernible neighborhood are presented.
Journal ArticleDOI
Generalized rough sets based on relations
William Zhu,William Zhu +1 more
TL;DR: This paper studies arbitrary binary relation based generalized rough sets, in which a binary relation can generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied.