Wentao Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wentao Liu has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Qian Chen
School of Artificial and Big Data, Hefei University, Anhui 230601, China
4 shared publications - Liping Ni
School of Management, Hefei University of Technology, Anhui 230009, China; Key Laboratory of Process Optimization and Intelligent Decision-making, Ministry of Education, Anhui 230009, China
2 shared publications - Pingfan Xia
School of Big Data and Statistics, Anhui University, Hefei, China
2 shared publications - Xuhui Zhu
School of Management, Hefei University of Technology, Hefei, China
2 shared publications Zhiwei Ni
2 shared publications- Zhiwei Ni
School of Management, Hefei University of Technology, Hefei 230009, China
2 shared publications
Latest Publications
- 4 March 2026
- Published by Elsevier in Neural Networks
- Vol. 200, 108805
Decomposition based curriculum-style self-training for source-free universal domain adaptation in computational pathology
- 4 March 2026
- Published by Elsevier in Neural Networks
- Vol. 200, 108805
Decomposition based curriculum-style self-training for source-free universal domain adaptation in computational pathology
- 17 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
DPC-TTA : Dual perturbation and correction network guided test-time adaptation
- 17 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
DPC-TTA : Dual perturbation and correction network guided test-time adaptation
- 18 April 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 318
Abnormal-region-aware Multi-modal Feature Fusion for medical report generation
- 18 April 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 318
Abnormal-region-aware Multi-modal Feature Fusion for medical report generation
- Open Access
- 25 March 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (7) , 3556
An Unmanned Delivery Vehicle Path-Planning Method Based on Point-Graph Joint Embedding and Dual Decoders
The path-planning of unmanned delivery vehicles (UDVs) has garnered significant interest due to their extensive use in contactless delivery during severe epidemics and automated delivery of parcels in diverse scenarios. However, previous studies have focused on achieving the shortest path or time based on the comprehensive cost consumption in the transportation process and ignored the impact of different customers’ different delivery time requirements in the actual interactive system. Hence, a path-planning model is presented to tackle the routing dilemma of UDVs in logistics. This new dilemma, called the unmanned delivery vehicle routing problem (UDVRP), considers the comprehensive transportation cost consumption of distribution vehicles and the customer satisfaction of each distribution point. Customer satisfaction is defined based on the delivery time requirements of different customers. This novel deep neural network model incorporates an attention mechanism and applies a method called point-graph joint embedding and dual decoders (PGDD) to solve the problem. The network’s architecture, consisting of an encoder and two decoders, directly determines the path for unmanned delivery vehicles. In addition, the model is trained offline using a deep reinforcement-learning strategy in combination with pseudo-label learning. In this scenario, the output of one decoder serves as the label for another, overseeing its learning process to choose the most effective path. Experimental results demonstrate that PGDD reduces total costs by 8.73% on average compared to state-of-the-art algorithms in 100-node scenarios, with performance gains reaching 12.5% for larger-scale problems (400 nodes), validating its superiority in complex path-planning. Additionally, PGDD improves customer satisfaction by 15.2% and achieves a response time below 90ms in real-world deployment tests. The experimental results demonstrate that the proposed method is superior to several state-of-the-art algorithms in solving the path-planning problem of unmanned distribution vehicles.
- 25 March 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (7) , 3556
Open AccessAn Unmanned Delivery Vehicle Path-Planning Method Based on Point-Graph Joint Embedding and Dual Decoders
The path-planning of unmanned delivery vehicles (UDVs) has garnered significant interest due to their extensive use in contactless delivery during severe epidemics and automated delivery of parcels in diverse scenarios. However, previous studies have focused on achieving the shortest path or time based on the comprehensive cost consumption in the transportation process and ignored the impact of different customers’ different delivery time requirements in the actual interactive system. Hence, a path-planning model is presented to tackle the routing dilemma of UDVs in logistics. This new dilemma, called the unmanned delivery vehicle routing problem (UDVRP), considers the comprehensive transportation cost consumption of distribution vehicles and the customer satisfaction of each distribution point. Customer satisfaction is defined based on the delivery time requirements of different customers. This novel deep neural network model incorporates an attention mechanism and applies a method called point-graph joint embedding and dual decoders (PGDD) to solve the problem. The network’s architecture, consisting of an encoder and two decoders, directly determines the path for unmanned delivery vehicles. In addition, the model is trained offline using a deep reinforcement-learning strategy in combination with pseudo-label learning. In this scenario, the output of one decoder serves as the label for another, overseeing its learning process to choose the most effective path. Experimental results demonstrate that PGDD reduces total costs by 8.73% on average compared to state-of-the-art algorithms in 100-node scenarios, with performance gains reaching 12.5% for larger-scale problems (400 nodes), validating its superiority in complex path-planning. Additionally, PGDD improves customer satisfaction by 15.2% and achieves a response time below 90ms in real-world deployment tests. The experimental results demonstrate that the proposed method is superior to several state-of-the-art algorithms in solving the path-planning problem of unmanned distribution vehicles.
- Open Access
- 22 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (16) , 3346
Dynamic Edge-Based High-Dimensional Data Aggregation with Differential Privacy
Edge computing enables efficient data aggregation for services like data sharing and analysis in distributed IoT applications. However, uploading dynamic high-dimensional data to an edge server for efficient aggregation is challenging. Additionally, there is the significant risk of privacy leakage associated with direct such data uploading. Therefore, we propose an edge-based differential privacy data aggregation method leveraging progressive UMAP with a dynamic time window based on LSTM (EDP-PUDL). Firstly, a model of the dynamic time window based on a long short-term memory (LSTM) network was developed to divide dynamic data. Then, progressive uniform manifold approximation and projection (UMAP) with differential privacy was performed to reduce the dimension of the window data while preserving privacy. The privacy budget was determined by the data volume and the attribute’s Shapley value, adding DP noise. Finally, the privacy analysis and experimental comparisons demonstrated that EDP-PUDL ensures user privacy while achieving superior aggregation efficiency and availability compared to other algorithms used for dynamic high-dimensional data aggregation.
- 22 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (16) , 3346
Open AccessDynamic Edge-Based High-Dimensional Data Aggregation with Differential Privacy
Edge computing enables efficient data aggregation for services like data sharing and analysis in distributed IoT applications. However, uploading dynamic high-dimensional data to an edge server for efficient aggregation is challenging. Additionally, there is the significant risk of privacy leakage associated with direct such data uploading. Therefore, we propose an edge-based differential privacy data aggregation method leveraging progressive UMAP with a dynamic time window based on LSTM (EDP-PUDL). Firstly, a model of the dynamic time window based on a long short-term memory (LSTM) network was developed to divide dynamic data. Then, progressive uniform manifold approximation and projection (UMAP) with differential privacy was performed to reduce the dimension of the window data while preserving privacy. The privacy budget was determined by the data volume and the attribute’s Shapley value, adding DP noise. Finally, the privacy analysis and experimental comparisons demonstrated that EDP-PUDL ensures user privacy while achieving superior aggregation efficiency and availability compared to other algorithms used for dynamic high-dimensional data aggregation.
- 11 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 27 (12) , 5848-5859
Attention-Guided Partial Domain Adaptation for Automated Pneumonia Diagnosis From Chest X-Ray Images
Deep neural networks (DNN) supported by multicenter large-scale Chest X-Ray (CXR) datasets can efficiently perform tasks such as disease identification, lesion segmentation, and report generation. However, the non-ignorable inter-domain heterogeneity caused by different equipment, ethnic groups, and scanning protocols may lead to dramatic degradation in model performance. Unsupervised domain adaptation (UDA) methods help alleviate the cross-domain discrepancy for subsequent analysis. Nevertheless, they may be prone to 1) spatial negative transfer: misaligning non-transferable regions which have inadequate knowledge, and 2) semantic negative transfer: failing to extend to scenarios where the label spaces of the source and target domain are partially shared. In this work, we propose a classification-based framework named attention-guided partial domain adaptation (AGPDA) network for overcoming these two negative transfer challenges. AGPDA is composed of two key modules: (1) a region attention discrimination block (RADB) to generate fine-grained attention value via lightweight region-wise multi-adversarial networks. (2) a residual feature recalibration block (RFRB) trained with class-weighted maximum mean discrepancy (MMD) loss for down-weighing the irrelevant source samples. Extensive experiments on two publicly available CXR datasets containing a total of 8598 pneumonia (viral, bacterial, and COVID-19) cases, 7163 non-pneumonia or healthy cases, demonstrate the superior performance of our AGPDA. Especially on three partial transfer tasks, AGPDA significantly increases the accuracy, sensitivity, and F1 score by 4.35%, 4.05%, and 1.78% compared to recently strong baselines.
- 11 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 27 (12) , 5848-5859
Attention-Guided Partial Domain Adaptation for Automated Pneumonia Diagnosis From Chest X-Ray Images
Deep neural networks (DNN) supported by multicenter large-scale Chest X-Ray (CXR) datasets can efficiently perform tasks such as disease identification, lesion segmentation, and report generation. However, the non-ignorable inter-domain heterogeneity caused by different equipment, ethnic groups, and scanning protocols may lead to dramatic degradation in model performance. Unsupervised domain adaptation (UDA) methods help alleviate the cross-domain discrepancy for subsequent analysis. Nevertheless, they may be prone to 1) spatial negative transfer: misaligning non-transferable regions which have inadequate knowledge, and 2) semantic negative transfer: failing to extend to scenarios where the label spaces of the source and target domain are partially shared. In this work, we propose a classification-based framework named attention-guided partial domain adaptation (AGPDA) network for overcoming these two negative transfer challenges. AGPDA is composed of two key modules: (1) a region attention discrimination block (RADB) to generate fine-grained attention value via lightweight region-wise multi-adversarial networks. (2) a residual feature recalibration block (RFRB) trained with class-weighted maximum mean discrepancy (MMD) loss for down-weighing the irrelevant source samples. Extensive experiments on two publicly available CXR datasets containing a total of 8598 pneumonia (viral, bacterial, and COVID-19) cases, 7163 non-pneumonia or healthy cases, demonstrate the superior performance of our AGPDA. Especially on three partial transfer tasks, AGPDA significantly increases the accuracy, sensitivity, and F1 score by 4.35%, 4.05%, and 1.78% compared to recently strong baselines.