Hongwei Chen

Hongwei Chen

Auto-generated profile, based on publicly available information

Hongwei Chen

College of Information Science and Technology, Donghua University, Shanghai 201620, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 May 2018 in Designs
Verified
Journal Article
Open access
PDF file
WYWenbin Yue
Wenbin Yue
ZWZidong Wang
Zidong Wang
HCHongwei Chen
Hongwei Chen
APAnnette Payne
Annette Payne
XLXiaohui Liu
Xiaohui Liu
Breast cancer (BC) is one of the most common cancers among women worldwide, representing the majority of new cancer cases and cancer-related deaths according to global statistics, making it a significant public health problem in today’s society. The early diagnosis of BC can improve the prognosis and chance of survival significantly, as it can promote timely clinical treatment to patients. Further accurate classification of benign tumours can prevent patients undergoing unnecessary treatments. Thus, the correct diagnosis of BC and classification of patients into malignant or benign groups is the subject of much research. Because of its unique advantages in critical features detection from complex BC datasets, machine learning (ML) is widely recognised as the methodology of choice in BC pattern classification and forecast modelling. In this paper, we aim to review ML techniques and their applications in BC diagnosis and prognosis. Firstly, we provide an overview of ML techniques including artificial neural networks (ANNs), support vector machines (SVMs), decision trees (DTs), and k-nearest neighbors (k-NNs). Then, we investigate their applications in BC. Our primary data is drawn from the Wisconsin breast cancer database (WBCD) which is the benchmark database for comparing the results through different algorithms. Finally, a healthcare system model of our recent work is also shown.

1 February 2015 in Automatica
Verified
Journal Article
Closed access
Yang LiuYang Liu
Yang Liu
HCHongwei Chen
Hongwei Chen
JLJianquan Lu
Jianquan Lu
BWBo Wu
Bo Wu

8 May 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JLJinling Liang
Jinling Liang
HCHongwei Chen
Hongwei Chen
James LamJames Lam
James Lam
This paper tackles the controllability problem of Boolean control networks (BCNs). By resorting to the semi-tensor product technique and the Warshall algorithm, several improved novel reachability and controllability criteria are obtained for the BCNs. Through constructing a sequence of rigorous Boolean matrices, controllability matrix of the considered BCNs is derived iteratively. It is worth pointing out that the proposed method has lower computational complexity, and thus facilitates the reachability and controllability analysis for BCNs. In addition, the issue concerning controllability of BCNs with undesirable interior states is investigated by checking a set of designated Boolean matrices. Finally, to test the effectiveness of the obtained theoretical results, a genetic network model known as the λ switch is used as an example for numerical simulation.

21 March 2013 in Mathematical Methods in the Applied Sciences
Verified
Journal Article
Closed access
PDF file
Yang LiuYang Liu
Yang Liu
HCHongwei Chen
Hongwei Chen
BWBo Wu
Bo Wu

13 February 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
HCHongwei Chen
Hongwei Chen
ZWZidong Wang
Zidong Wang
JLJinling Liang
Jinling Liang
Maozhen LiMaozhen Li
Maozhen Li
In this article, a general theoretical framework is developed for the state estimation problem of stochastic time-varying Boolean networks (STVBNs). The STVBN consists of a system model describing the evolution of the Boolean states and a model relating the noisy measurements to the Boolean states. Both the process noise and the measurement noise are characterized by sequences of mutually independent Bernoulli distributed stochastic variables taking values of 1 or 0, which imply that the state/measurement variables may be flipped with certain probabilities. First, an algebraic representation of the STVBNs is derived based on the semitensor product. Then, based on Bayes' theorem, a recursive matrix-based algorithm is obtained to calculate the one-step prediction and estimation of the forward-backward state probability distribution vectors. Owing to the Boolean nature of the state variables, the Boolean Bayesian filter is designed that can be utilized to provide the minimum MSE state estimate for the STVBNs. The fixed-interval smoothing filter is also obtained by resorting to the forward-backward technique. Finally, a simulation experiment is carried out for the context estimation problem of the $p53$-$MDM2$ negative-feedback gene regulatory network.

11 April 2019 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
HCHongwei Chen
Hongwei Chen
JLJinling Liang
Jinling Liang
This paper is concerned with the local synchronization problem for the interconnected Boolean networks (BNs) without and with stochastic disturbances. For the case without stochastic disturbances, first, the limit set and the transient period of the interconnected BNs are discussed by resorting to the properties of the reachable set for the global initial states set. Second, in terms of logical submatrices of a certain Boolean vector, a compact algebraic expression is presented for the limit set of the given initial states set. Based on it, several necessary and sufficient conditions are derived assuring the local synchronization of the interconnected BNs. Subsequently, an efficient algorithm is developed to calculate the largest domain of attraction. As for the interconnected BNs with stochastic disturbances, first, mutually independent two-valued random logical variables are introduced to describe the stochastic disturbances. Then, the corresponding local synchronization criteria are also established, and the algorithm to calculate the largest domain of attraction is designed. Finally, numerical examples are employed to illustrate the effectiveness of the obtained results/algorithms.