Zhaogong Zhang

dblp:52/6747 · DBLP profile ↗
← Back
14ranked-venue papers
0as first author
6since 2021 · last 2026
0000-0002-1195-936XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 5 since 2021Databases, data management, data science and information retrieval · 4Artificial intelligence and machine learning · 3Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2026 Depthwise-Attentive Hierarchical Cross-Modal Knowledge Distillation Network for Rail Surface Defect Detection
abstract
Accurate detection of surface defects on railway tracks is critical for safe railway operation. Most existing models rely solely on Red–Green–Blue (RGB) images, limiting their ability to capture structural information. Incorporating depth features provides richer spatial cues, significantly improving detection accuracy. However, current Red–Green–Blue and Depth (RGB-D) dual-stream models suffer from high computational complexity and hardware dependencies, making them impractical for real-world deployment. To address these limitations, we propose DAHNet, an asymmetric knowledge distillation model with a teacher–student architecture. DAHNet-T serves as the teacher network, taking RGB-D inputs and integrating a cross-modal attention feature enhancement (CAFE) module to capture contextual information, along with a depth feature interaction block (DFIB) for efficient cross-modal fusion. DAHNet-S is the student network, a lightweight single-stream RGB model employing depthwise separable convolutions to reduce computation. We introduce a multi-level distillation strategy with dynamic temperature scaling to balance coarse-grained and fine-grained knowledge transfer, while incorporating contrastive learning and structural loss to improve pixel-level accuracy. Extensive experiments on the NEU RSDDS-AUG dataset demonstrate that our distilled model DAHNet-KD outperforms state-of-the-art methods. Compared to DAHNet-T, the number of parameters is reduced from 87.72 MParams to 13.97 MParams, and the computational cost decreases from 19.79 GFLOPs to 5.41 GFLOPs. The proposed model achieves superior performance across various evaluation metrics and also generalizes well on other public datasets. Therefore, the model provides a lightweight and high-accuracy solution for deployment on mobile devices in real-world industrial scenarios.
Xin Guan 0003, Yu Peng 0001, Zhaogong Zhang, Xiongjie Zhou, Hongyang Chen 0001, Tomoaki Ohtsuki, Zhu Han 0001
IEEE Internet Things J.4
2025 Heterogeneous multi-agent deep reinforcement learning based low carbon emission task offloading in mobile edge computing
Xiongjie Zhou, Xin Guan 0003, Zhaogong Zhang, Tomoaki Ohtsuki
Comput. Commun.5
2025 Digital Twin Empowered Task Offloading for Mobile-Edge Computing in 6G Internet of Vehicles
abstract
The rapid development of the Internet of Vehicles (IoV) and sixth-generation (6G) technology has made traditional cloud computing architectures inadequate for vehicular networks. With ultra-low latency, high bandwidth, and massive connectivity, 6G networks provide essential support for task offloading in mobile edge computing. Task offloading transfers computational tasks from vehicles to edge base stations or cloud servers. However, traditional methods struggle to adapt to diverse user tasks and dynamic network environments. These limitations increase offloading delays. Digital twin (DT) offers real-time simulation to reflect system dynamics and address these challenges. In this paper, we propose a task offloading framework that combines DTs with deep reinforcement learning. We propose a multi-layer dynamic framework with an error-reward feedback mechanism to handle complexity, dynamic changes, and errors. This approach enables the conclusion of task offloading strategies that minimize latency. The framework includes a threshold-based warning mechanism to effectively manage edge base station loads. By monitoring load in real time, the system evaluates base station status and adjusts task allocation to maintain stability. We propose a multi-dimensional state encoder architecture, comprising environment encoders, base station state encoders, and task state encoders to effectively extract critical features. The proposed architecture enables the conclusion of task offloading strategies that minimize latency. Experimental results demonstrate that the proposed algorithm can accurately and quickly conclude the task offloading strategy to minimize energy consumption and latency.
Xiongjie Zhou, Yu Peng 0001, Zhaogong Zhang, Xin Guan 0003
IEEE Internet Things J.4
2024 Deep Reinforcement Learning Based Economic Dispatch with Cost Constraint in Cyber Physical Energy System
Ning Wang 0001, Zhaogong Zhang, Jinghong He, Xin Guan 0003
WASA (3)4
2024 Carbon Neutrality Computational Cost Optimization for Economic Dispatch With Carbon Capture Power Plants in Smart Grid
abstract
To achieve carbon neutrality, reducing carbon emissions is crucial in dispatching problems in smart grid. Though renewable energy such as wind power has low carbon emissions, it suffers from random generation, which makes the thermal power necessary for a stable supply power system. To reduce carbon emissions, the thermal power plants are transformed into carbon capture power plants, which brings new challenges to economic dispatch algorithms. Besides, there are usually many constraints to keep the security operation of power systems, which incurs a large problem scale and high computational cost. Most existing methods either do not consider reducing carbon emissions, or suffer from high computational costs. In this paper, a framework for the carbon capture plants with wind power to reduce both running costs and carbon emissions is designed to support carbon neutrality. To reduce computational cost, initial-training and fine-tuning are used. A deep neural network is employed to describe the relationship between users' load and the constraints, which provides guides for finding the active constraints. Therefore, the problem scale can be significantly decreased, making the optimal dispatching strategy obtained quickly. The experimental results on real-world data show that the proposed framework can obtain the optimal strategy efficiently.
Zhuhuan Xu, Xin Guan 0003, Haiyang Jiang 0003, Yongnan Liu, Zhaogong Zhang, Hongyang Chen 0001, Zhu Han 0001
IEEE Trans. Sustain. Comput.5
2022 Constrained Graph Convolution Networks Based on Graph Enhancement for Collaborative Filtering
Zhaogong Zhang
WASA (2)2
2020 Drawing Dreams
Jingxian Wu 0003, Zhaogong Zhang, Xuexia Wang
ICONIP (1)2
2019 Feature Selection Based on Graph Structure
Zhiwei Hu, Zhaogong Zhang, Zongchao Huang, Dayuan Zheng
COCOA2
2019 TNT: An Effective Method for Finding Correlations Between Two Continuous Variables
Dayuan Zheng, Zhaogong Zhang
COCOA2
2015 Prediction of potential disease-associated microRNAs based on random walk
abstract
MOTIVATION: Identifying microRNAs associated with diseases (disease miRNAs) is helpful for exploring the pathogenesis of diseases. Because miRNAs fulfill function via the regulation of their target genes and because the current number of experimentally validated targets is insufficient, some existing methods have inferred potential disease miRNAs based on the predicted targets. It is difficult for these methods to achieve excellent performance due to the high false-positive and false-negative rates for the target prediction results. Alternatively, several methods have constructed a network composed of miRNAs based on their associated diseases and have exploited the information within the network to predict the disease miRNAs. However, these methods have failed to take into account the prior information regarding the network nodes and the respective local topological structures of the different categories of nodes. Therefore, it is essential to develop a method that exploits the more useful information to predict reliable disease miRNA candidates. RESULTS: miRNAs with similar functions are normally associated with similar diseases and vice versa. Therefore, the functional similarity between a pair of miRNAs is calculated based on their associated diseases to construct a miRNA network. We present a new prediction method based on random walk on the network. For the diseases with some known related miRNAs, the network nodes are divided into labeled nodes and unlabeled nodes, and the transition matrices are established for the two categories of nodes. Furthermore, different categories of nodes have different transition weights. In this way, the prior information of nodes can be completely exploited. Simultaneously, the various ranges of topologies around the different categories of nodes are integrated. In addition, how far the walker can go away from the labeled nodes is controlled by restarting the walking. This is helpful for relieving the negative effect of noisy data. For the diseases without any known related miRNAs, we extend the walking on a miRNA-disease bilayer network. During the prediction process, the similarity between diseases, the similarity between miRNAs, the known miRNA-disease associations and the topology information of the bilayer network are exploited. Moreover, the importance of information from different layers of network is considered. Our method achieves superior performance for 18 human diseases with AUC values ranging from 0.786 to 0.945. Moreover, case studies on breast neoplasms, lung neoplasms, prostatic neoplasms and 32 diseases further confirm the ability of our method to discover potential disease miRNAs. AVAILABILITY AND IMPLEMENTATION: A web service for the prediction and analysis of disease miRNAs is available at http://bioinfolab.stx.hk/midp/.
Ping Xuan, Yahong Guo, Jin Li 0024, Xia Li 0004, Yingli Zhong, Zhaogong Zhang
Bioinform.7
2005 An Incremental Data Stream Clustering Algorithm Based on Dense Units Detection
Jianzhong Li 0001, Zhaogong Zhang, Pang-Ning Tan
PAKDD3
2004 Dynamical Schedule Algorithms Based on Markov Model in Tertiary Storage
Yanqiu Zhang, Zhaogong Zhang, Baoliang Liu
WAIM3
2004 Dynamic Adjustment of Sliding Windows over Data Streams
Jianzhong Li 0001, Zhaogong Zhang, Weiping Wang 0001, Longjiang Guo
WAIM3
2003 Partition Based Hierarchical Index for Text Retrieval
Baoliang Liu, Zhaogong Zhang
WAIM3