Chien-Hung Liu

Prof. Chien-Hung Liu

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
1 February 2024 in Information
Verified
Journal Article
Open access
PDF file
YCYu-Hung Chang
Yu-Hung Chang
CLChien-Hung Liu
Chien-Hung Liu
Shingchern YouShingchern You
Shingchern You
The dynamic flexible job-shop problem (DFJSP) is a realistic and challenging problem that many production plants face. As the product line becomes more complex, the machines may suddenly break down or resume service, so we need a dynamic scheduling framework to cope with the changing number of machines over time. This issue has been rarely addressed in the literature. In this paper, we propose an improved learning-to-dispatch (L2D) model to generate a reasonable and good schedule to minimize the makespan. We formulate a DFJSP as a disjunctive graph and use graph neural networks (GINs) to embed the disjunctive graph into states for the agent to learn. The use of GINs enables the model to handle the dynamic number of machines and to effectively generalize to large-scale instances. The learning agent is a multi-layer feedforward network trained with a reinforcement learning algorithm, called proximal policy optimization. We trained the model on small-sized problems and tested it on various-sized problems. The experimental results show that our model outperforms the existing best priority dispatching rule algorithms, such as shortest processing time, most work remaining, flow due date per most work remaining, and most operations remaining. The results verify that the model has a good generalization capability and, thus, demonstrate its effectiveness.

4 June 2011 in Software Quality Journal
Verified
Journal Article
Closed access
PDF file
PCPeng-Hua Chu
Peng-Hua Chu
NHNien-Lin Hsueh
Nien-Lin Hsueh
HCHong-Hsiang Chen
Hong-Hsiang Chen
CLChien-Hung Liu
Chien-Hung Liu

22 January 2025 in Diagnostics
Verified
Journal Article
Open access
PDF file
WZWei-Jun Zhang
Wei-Jun Zhang
WCWei-Teing Chen
Wei-Teing Chen
CLChien-Hung Liu
Chien-Hung Liu
SCShiuan-Wen Chen
Shiuan-Wen Chen
YLYu-Hua Lai
Yu-Hua Lai
Shingchern YouShingchern You
Shingchern You
Objectives: This paper studies the segmentation and detection of small metastatic brain tumors. This study aims to evaluate the feasibility of training a deep neural network for the segmentation and detection of metastatic brain tumors in MRI using a very small dataset of 33 cases, by leveraging large public datasets of primary tumors; Methods: This study explores various methods, including supervised learning, two transfer learning approaches, and self-supervised learning, utilizing U-net and Swin UNETR models; Results: The self-supervised learning approach utilizing the Swin UNETR model yielded the best performance. The Dice score for small brain tumors was approximately 0.19. Sensitivity reached 100%, while specificity was 54.5%. When excluding subjects with hyperintensities, the specificity improved to 80.0%; Conclusions: It is feasible to train a model using self-supervised learning and a small dataset for the segmentation and detection of small brain tumors.

28 March 2018 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
CLChien-Hung Liu
Chien-Hung Liu
WCWoei-Kae Chen
Woei-Kae Chen
CSChi-Chia Sun
Chi-Chia Sun

21 April 2022 in IEEE Access
Verified
Journal Article
Open access
Shingchern YouShingchern You
Shingchern You
HLHsiao-Chung Liu
Hsiao-Chung Liu
CLChien-Hung Liu
Chien-Hung Liu
In machine learning problems, we usually assume that the validation accuracy is a good estimation of prediction accuracy for datasets without ground truth. In reality, this assumption may not hold. Therefore, we propose an approach to estimate the prediction accuracy of a target model on unlabeled datasets. The proposed approach uses multiple target homogeneous models to assign each unlabeled sample a confidence value, based on the number of models agreeing on the predicted label. With the confidence values, the prediction accuracy of the target model on the datasets can be estimated. In the experiments, the target model is a convolutional neural network (CNN) model, and the homogeneous models only differ in initial weights. The experiments are conducted with datasets from a wide variety of music genres. The estimation performance of the proposed approach is compared with the reversed testing qualities (RTQ) and the ensemble average qualities (EAQ) approaches. The RTQ approach was proposed to estimate the prediction accuracy of trained models, and the EAQ approach was originally designed for estimating the predictive uncertainty of individual samples. We apply all three compared models to estimate prediction accuracy of datasets by using a linear model. The parameters of the linear model are either computed by using multiple labeled datasets or one labeled dataset. The experimental results show that when compared with the RTQ approach, the proposed approach has much lower estimation errors for some datasets. When compared with the EAQ approach, the proposed approach is more robust for datasets with large distribution shifts. Finally, we show an additional benefit of the proposed approach. In case that the estimated accuracy is unsatisfactory, we may re-train the target model with a new training set, which contains the original training samples plus new training samples with manual labeling from the unlabeled dataset. The experimental results confirm that it is more effective to select (and label) new samples from those with low confidence values than those randomly selected. Overall, the proposed approach is a promising approach for estimating prediction accuracy on unlabeled datasets.

19 January 2024 in Electronics
Verified
Journal Article
Open access
PDF file
CLChien-Hung Liu
Chien-Hung Liu
Shingchern YouShingchern You
Shingchern You
YCYing-Chieh Chiu
Ying-Chieh Chiu
Web crawlers are widely used to automatically explore and test web applications. However, navigating the pages of a web application can be difficult due to dynamic page generation. In particular, the inputs for the web form fields can affect the resulting pages and subsequent navigation. Therefore, choosing the inputs and the order of clicks on a web page is essential for an effective web crawler to achieve high code coverage. This paper proposes a set of actions to quickly fill in web form fields and uses reinforcement learning algorithms to train a convolutional neural network (CNN). The trained agent, named iRobot, can autonomously select actions to guide the web crawler to maximize code coverage. We experimentally compared different reinforcement learning algorithms, neural networks, and actions. The results show that our CNN network with the proposed actions performs better than other neural networks in terms of branch coverage using the Deep Q-learning (DQN) or proximal policy optimization (PPO) algorithm. Furthermore, compared to previous studies, iRobot can increase branch coverage by about 1.7% while reducing training time to 12.54%.