Chuchao He

Dr. Chuchao He


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
1 January 2020 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
CHChuchao He
Chuchao He
Xiaoguang GaoXiaoguang Gao
Xiaoguang Gao
KWKaifang Wan
Kaifang Wan
To address the problem of a reduced efficiency due to an increase of the search space, it has been proposed that priors could be added as constraints to the OS+ algorithm, which are Parent and children (PC) sets of each node obtained using the Max-min parent and children (MMPC) algorithm. Experimental results indicate that compared to other competitive methods, the proposed algorithm yields better solutions while maintaining high efficiency. Bayesian network (BN) sensitivity analysis is also proposed, which allows the network structure to be determined via a proposed ordering search method. We performed sensitivity analysis to determine the accuracy of the airborne avionics system, for which a simulation model is constructed to generate data samples, and the main effect of each error index is obtained using different sensitivity analysis methods. Experimental results indicate that the proposed BN method produces more accurate results when there is insufficient sample data, and this method can elucidate causal relationships that are present in the data.

20 May 2022 in Scientific Programming
Verified
Journal Article
Open access
RDRuohai Di
Ruohai Di
YLYe Li
Ye Li
TLTingpeng Li
Tingpeng Li
PWPeng Wang
Peng Wang
CHChuchao He
Chuchao He
Bayesian network structure learning based on dynamic programming strategy can be used to find the optimal graph structure compared with approximate search methods. The traditional dynamic programming method for Bayesian network structure learning is a depth-first-based strategy, which is inefficient. We proposed two methods to solve this problem. First, the dependency constraints were used to prune the process of calculating redundancy scores. The constraints were obtained by the conditional independence test from the observed data sets. However, it was difficult to guarantee the accuracy of the constraints, which may have led to a decrease in the accuracy of the method. Second, we proposed a breadth-first-based strategy, which enhanced efficiency greatly while also ensuring global optimality. Experimental results showed that on the standard network data sets, compared with the dynamic programming based on depth-first search (DFSDP) algorithm, dynamic programming based on constraints (CBDP) could reduce the average running time by 57.10% and that dynamic programming based on breadth-first search (BFSDP) could reduce the average running time by 50.02%. On the UCI data sets, compared with DFSDP, CBDP reduced the average running time by 40.71%, and BFSDP reduced the average running time by 81.78%.

20 August 2024 in CAAI Transactions on Intelligence Technology
Verified
Journal Article
Open access
CHChuchao He
Chuchao He
RDRuohai Di
Ruohai Di
Bo LiBo Li
Bo Li
ENEvgeny Neretin
Evgeny Neretin
The use of dynamic programming (DP) algorithms to learn Bayesian network structures is limited by their high space complexity and difficulty in learning the structure of large‐scale networks. Therefore, this study proposes a DP algorithm based on node block sequence constraints. The proposed algorithm constrains the traversal process of the parent graph by using the M‐sequence matrix to considerably reduce the time consumption and space complexity by pruning the traversal process of the order graph using the node block sequence. Experimental results show that compared with existing DP algorithms, the proposed algorithm can obtain learning results more efficiently with less than 1% loss of accuracy, and can be used for learning larger‐scale networks.

17 May 2024
Verified
Conference Paper
Open access
SZShuang Zhang
Shuang Zhang
CWChu Wang
Chu Wang
PWPeng Wang
Peng Wang
MDMianmian Dong
Mianmian Dong
CHChuchao He
Chuchao He
LLLiangliang Li
Liangliang Li
Fuel cells have attracted widespread attention as power generation devices using clean energy. However, the lack of durability has limited further widespread commercialisation of fuel cells. Prediction of health indicators is a prerequisite and basis for improving durability of fuel cells. Nevertheless, the recoverable fault behavior in fuel cells remains one of the key challenges in prognostic. To address this issue, this paper proposes a prognostic strategy to evade recoverable fault by identifying them. The data volume is balanced using data augmentation techniques to detect recoverable fault based on classification results. The proposed prognostic strategy is validated on the aging dataset. The experimental results show that the accuracy of identifying the operational state increases to 97.11% after data enhancement. Prognostic during recoverable fault enables effective evasion, with an average decrease in root mean square error of 63.12%.