1 code implementation • IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2021 • Kun Chu, Xianchao Zhu, William Zhu
A crucial issue in Lifelong RL is how best to utilize the knowledge from the previous tasks for improving the performance in the current task.
no code implementations • 28 Dec 2019 • Fiseha B. Tesema, Hong Wu, Mingjian Chen, Junpeng Lin, William Zhu, Kai-Zhu Huang
When using a more advanced RPN in our framework, our approach can be further improved and get competitive results on both benchmarks.
no code implementations • 16 Dec 2013 • Aiping Huang, William Zhu
Rough sets provide a theoretical foundation for the issue.
no code implementations • 16 Dec 2013 • Aiping Huang, William Zhu
Second, considering that all the closed sets of a finite matroid form a geometric lattice, we propose a dependence space through matroids and study the attribute reduction issues of the space, which realizes the application of geometric lattices to attribute reduction.
no code implementations • 16 Dec 2013 • Aiping Huang, William Zhu
First, we present an approach to inducing a covering by a graph, and then study the connectedness of the graph from the viewpoint of the covering approximation operators.
no code implementations • 5 Nov 2013 • Bin Yang, William Zhu
Second, we study the connectivity for matroids by means of relation-based rough sets and some conditions under which a general matroid is connected are presented.
no code implementations • 2 Nov 2013 • Bin Yang, Hong Zhao, William Zhu
First, we investigate some properties of the definable sets with respect to a covering.
no code implementations • 9 Oct 2013 • Hua Yao, William Zhu
In Pawlak rough sets, the structure of the definable set families is simple and clear, but in generalizing rough sets, the structure of the definable set families is a bit more complex.
no code implementations • 10 Jul 2013 • Hua Yao, William Zhu
First, we investigate under what condition a covering of neighborhoods is the reduct of the covering inducing it.
no code implementations • 13 Dec 2012 • Hong Zhao, Fan Min, William Zhu
In this paper, we study the cost-sensitive feature selection problem on numerical data with measurement errors, test costs and misclassification costs.
no code implementations • 12 Nov 2012 • Hong Zhao, Fan Min, William Zhu
In this paper, we consider numerical data with measurement errors and study minimal cost feature selection in this model.
no code implementations • 3 Nov 2012 • Aiping Huang, William Zhu
First, a matrix representation of an equivalence relation is proposed, and then a matroidal structure of rough sets over a field is presented by the matrix.
no code implementations • 29 Sep 2012 • Hong Zhao, Fan Min, William Zhu
In this paper, we introduce normal distribution measurement errors to covering-based rough set model, and deal with test-cost-sensitive attribute reduction problem in this new model.
no code implementations • 25 Sep 2012 • Qingyin Li, William Zhu
Finally, we propose an approach to obtain all the closed sets of the matroid from the semimodular lattice.