Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pengju Ding

dblp:344/6870 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
8since 2021 · last 2026
0009-0005-7366-2878ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless sensing and localization · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless sensing and localization › human activity recognition
gait recognition
1.012026
Toward Adaptive Person Re-Identification via mmWave Radar Point Clouds · IEEE Trans. Netw. 2026
Wireless sensing and localization › person identification
person re-identification
1.012026
Toward Adaptive Person Re-Identification via mmWave Radar Point Clouds · IEEE Trans. Netw. 2026

Methods — techniques the papers use, named apart from their topics

self-attention · 1.0multi-scale gait catch · 1.0hierarchical attention · 1.0anchor-based orientation descriptor · 1.0
YearPublicationVenuePosition
2026 Multi-behavioral recommendation algorithm based on decoupled graph convolution
Xu Yu 0001, Pengju Ding, Junyu Lin 0002, Lei Guo 0008, Guanfeng Liu 0001, Liang Xi
Expert Syst. Appl.2
2026 Toward Adaptive Person Re-Identification via mmWave Radar Point Clouds
abstract
MmWave radar-based person re-identification (ReID), namely catching a specified person from the database, demonstrates enormous prospects for practical applications such as public security and intelligent surveillance. Towards adaptive ReID across different scenarios, we attempt to explore abundant spatial-temporal features from point clouds for walking individuals. Most existing approaches fail to describe fine-grained 3D spatial properties associated with gaits and neglect the impacts of walking speed changes on perception. To address the two problems, we extract gait features by integrating the anchor-based orientation descriptor (AOD) and multi-scale gait catch (MGC) modules into a ReID system. Specifically, AOD automatically learns virtual anchors, selects anchor-centered neighbors from eight different subspaces and designs orientation-driven feature aggregation to elaborately describe 3D local space. Then, MGC adopts the sub-sampling strategy on AOD results to estimate multiple temporal resolution pathways reflecting relative speeds, on which sequence-specific and cross-sequence dependencies are respectively characterized by our self-attention (SA) and hierarchical attention (HA) to generate more discriminative gait representations. For evaluation, we collect mmWave ReID datasets at three scenes, and comprehensive experiments illustrate that we can maintain superior ReID performances over 90.0% Top-1 accuracy under different scenario settings. Our code and dataset are available athttps://github.com/dpjqw195/ReID-AOD-MGC
Biyun Sheng, Pengju Ding, Fu Xiao 0001, Tie Qiu 0001
IEEE Trans. Netw.2
2025 MSN-DTA: A multi-scale node adaptive graph neural network for interpretable drug-target binding affinity prediction
Pengju Ding, Xin Gao 0001, Bin Yu 0007
Knowl. Based Syst.2
2025 DeepUTF: Locating transcription factor binding sites via interpretable dual-channel encoder-decoder structure
Pengju Ding, Shiyue He, Xin Gao 0001, Bin Yu 0007
Pattern Recognit.1
2025 RPI-GGCN: Prediction of RNA-Protein Interaction Based on Interpretability Gated Graph Convolution Neural Network and Co-Regularized Variational Autoencoders
abstract
RNA-protein interactions (RPIs) play an important role in several fundamental cellular physiological processes, including cell motility, chromosome replication, transcription and translation, and signaling. Predicting RPI can guide the exploration of cellular biological functions, intervening in diseases, and designing drugs. Given this, this study proposes the RPI-gated graph convolutional network (RPI-GGCN) method for predicting RPI based on the gated graph convolutional neural network (GGCN) and co-regularized variational autoencoder (Co-VAE). First, different types of feature information were extracted from RNA and protein sequences by nine feature extraction methods. Second, Co-VAEs are used to eliminate the redundancy of fused features and generate optimal features. Finally, this study introduces gated cyclic units into graph convolutional networks (GCNs) to construct a model for RPI prediction, which efficiently extracts topological information and improves the model's interpretable feature learning and expression capabilities. In the fivefold cross-validation test, the RPI-GGCN method achieved prediction accuracies of 97.27%, 97.32%, 96.54%, 95.76%, and 94.98% on the RPI369, RPI488, RPI1446, RPI1807, and RPI2241 datasets. To test the generalization performance of the model, we used the model trained on RPI369 to predict the independent NPInter v3.0 dataset and achieved excellent performance in all six independent validation sets. By visualizing the RPI network graph based on the prediction results, we aim to provide a new perspective and reference for studying RPI mechanisms and exploring new RPIs. Extensive experimental results demonstrate that RPI-GGCN can provide an efficient, accurate, and stable RPI prediction method.
Pengju Ding, Congjing Wang, Shiyue He, Xin Gao 0001, Bin Yu 0007
IEEE Trans. Neural Networks Learn. Syst.2
2024 Dynamic weighted knowledge distillation for brain tumor segmentation
Dianlong An, Panpan Liu, Pengju Ding, Weifeng Zhou, Bin Yu 0007
Pattern Recognit.4
2023 DeepSTF: predicting transcription factor binding sites by interpretable deep neural networks combining sequence and shape
abstract
Precise targeting of transcription factor binding sites (TFBSs) is essential to comprehending transcriptional regulatory processes and investigating cellular function. Although several deep learning algorithms have been created to predict TFBSs, the models' intrinsic mechanisms and prediction results are difficult to explain. There is still room for improvement in prediction performance. We present DeepSTF, a unique deep-learning architecture for predicting TFBSs by integrating DNA sequence and shape profiles. We use the improved transformer encoder structure for the first time in the TFBSs prediction approach. DeepSTF extracts DNA higher-order sequence features using stacked convolutional neural networks (CNNs), whereas rich DNA shape profiles are extracted by combining improved transformer encoder structure and bidirectional long short-term memory (Bi-LSTM), and, finally, the derived higher-order sequence features and representative shape profiles are integrated into the channel dimension to achieve accurate TFBSs prediction. Experiments on 165 ENCODE chromatin immunoprecipitation sequencing (ChIP-seq) datasets show that DeepSTF considerably outperforms several state-of-the-art algorithms in predicting TFBSs, and we explain the usefulness of the transformer encoder structure and the combined strategy using sequence features and shape profiles in capturing multiple dependencies and learning essential features. In addition, this paper examines the significance of DNA shape features predicting TFBSs. The source code of DeepSTF is available at https://github.com/YuBinLab-QUST/DeepSTF/.
Pengju Ding, Xin Gao 0001, Guozhu Liu, Bin Yu 0007
Briefings Bioinform.1
2023 Cooperation of local features and global representations by a dual-branch network for transcription factor binding sites prediction
abstract
Interactions between DNA and transcription factors (TFs) play an essential role in understanding transcriptional regulation mechanisms and gene expression. Due to the large accumulation of training data and low expense, deep learning methods have shown huge potential in determining the specificity of TFs-DNA interactions. Convolutional network-based and self-attention network-based methods have been proposed for transcription factor binding sites (TFBSs) prediction. Convolutional operations are efficient to extract local features but easy to ignore global information, while self-attention mechanisms are expert in capturing long-distance dependencies but difficult to pay attention to local feature details. To discover comprehensive features for a given sequence as far as possible, we propose a Dual-branch model combining Self-Attention and Convolution, dubbed as DSAC, which fuses local features and global representations in an interactive way. In terms of features, convolution and self-attention contribute to feature extraction collaboratively, enhancing the representation learning. In terms of structure, a lightweight but efficient architecture of network is designed for the prediction, in particular, the dual-branch structure makes the convolution and the self-attention mechanism can be fully utilized to improve the predictive ability of our model. The experiment results on 165 ChIP-seq datasets show that DSAC obviously outperforms other five deep learning based methods and demonstrate that our model can effectively predict TFBSs based on sequence feature alone. The source code of DSAC is available at https://github.com/YuBinLab-QUST/DSAC/.
Yutong Yu, Pengju Ding, Hongli Gao, Guozhu Liu, Fa Zhang 0001, Bin Yu 0007
Briefings Bioinform.2