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

Zipeng Zhong

dblp:317/0534 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2026
0009-0004-4529-6658ORCID · reported

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

Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Security and privacy · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Network and information security
1 paper
Security and privacy of machine learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Face, body and person analysis · 77% Reinforcement learning · 23%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Face, body and person analysis
face recognition
1.012026
PPOM-Attack: A Substitute Model-Free Perturbation Prediction and Optimization Method for Black-Box Adversarial Attack Against Face Recognition · IEEE Trans. Inf. Forensics Secur. 2026
Security and privacy of machine learning
adversarial attack
1.012026
PPOM-Attack: A Substitute Model-Free Perturbation Prediction and Optimization Method for Black-Box Adversarial Attack Against Face Recognition · IEEE Trans. Inf. Forensics Secur. 2026
Security and privacy of machine learning › adversarial attack
black-box attack
1.012026
PPOM-Attack: A Substitute Model-Free Perturbation Prediction and Optimization Method for Black-Box Adversarial Attack Against Face Recognition · IEEE Trans. Inf. Forensics Secur. 2026
Bioinformatics and computational biology › network bioinformatics
biological network analysis
0.812024
Association Pattern-aware Fusion for Biological Entity Relationship Prediction · NeurIPS 2024
Bioinformatics and computational biology
drug discovery
0.812024
Association Pattern-aware Fusion for Biological Entity Relationship Prediction · NeurIPS 2024
Machine learning › Reinforcement learning
policy optimization
0.312026
PPOM-Attack: A Substitute Model-Free Perturbation Prediction and Optimization Method for Black-Box Adversarial Attack Against Face Recognition · IEEE Trans. Inf. Forensics Secur. 2026

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

proximal policy optimization · 2.0perturbation optimization · 2.0message passing · 0.8graph neural network · 0.8bind-relation module · 0.8
YearPublicationVenuePosition
2026 PPOM-Attack: A Substitute Model-Free Perturbation Prediction and Optimization Method for Black-Box Adversarial Attack Against Face Recognition
abstract
Face recognition (FR) brings convenience to peoples lives while also posing security risks. Some malicious users employ FR attacks to impersonate the identity of a target. To reveal the security risks, recent work has attacked black-box FR models by utilizing substitute models to generate adversarial face images that are misclassified as the target individual due to the attack transferability of substitute models. However, the substitute models cannot accurately approximate the target model that leads to a decrease in FR attack success rate and adversarial face image quality. To address the issue, we propose the PPOM-Attack, a substitute model-free Perturbation Prediction and Optimization Method for black-box adversarial Attack against face recognition. PPOM-Attack directly obtains feedback from the target model instead of using substitute models, it avoids any discrepancy with the attack objective. To achieve this goal, we design a proximal policy optimization (PPO)-based agent to predict the perturbation regions in the face image and self-adaptively disturb the regions. To maintain high-quality adversarial face images, we further propose a minimum brightness offsets method specifically designed to generate perturbations that minimize the feature embedding difference between the adversarial and targeted face images. The experimental results show that our approach outperforms state-of-the-art FR attack methods by an average of 21.7% in terms of attack success rate, while achieving better image quality on seven FR models.
Jixin Zhang, Haiyun Li, Zipeng Zhong, Mingwu Zhang, Zheng Qin 0001
IEEE Trans. Inf. Forensics Secur.4
2025 TED-DTMoA: Tri-Comparison Expertise Decision for Drug-Target Mechanism of Action
abstract
Machine-learned interactions between drugs and human protein targets play a crucial role in efficient and accurate drug discovery. However, the drug-target mechanism of action (DTMoA) prediction is actually a multi-class classification problem, which follows a long-tailed class distribution. Existing methods simply address whether the drugs and targets can interact and rarely consider these deep mechanisms. In this paper, we introduce TED-DTMoA, a novel DTMoA prediction framework that incorporates the divide-and-conquer strategy with tri-comparison options. Specifically, to reduce the learning difficulty of tail classes, we propose an expertise-based divide-and-conquer decision approach that combines the results of multiple independent expertise models for sub-tasks decomposed from the original prediction task. In addition, to enhance the discrimination of similar mechanism classes, we devise a tri-comparison learning strategy that defines the sub-task as the classification of triple options, such as expanding the classification task for classes A and B to include an extra “Neither of them” option. Extensive experiments conducted on various DTMoA datasets quantitatively demonstrate the proposed method achieves an approximately 13% performance improvement compared with advanced baselines. Moreover, our method exhibits an obvious superiority on the tail classes. Further analysis of the evolvability and generalization reveals the significant potential to be deployed in real-world scenes.
Lingxiang Jia, Zipeng Zhong, Shaolun Yao, Jie Song 0011, Mingli Song, Zunlei Feng
ECAI2
2024 Loose Lesion Location Self-supervision Enhanced Colorectal Cancer Diagnosis
Tianhong Gao, Jie Song 0011, Xiaotian Yu, Shengxuming Zhang, Xiuming Zhang, Zipeng Zhong, Mingli Song, Zunlei Feng
MICCAI (11)10
2024 Association Pattern-aware Fusion for Biological Entity Relationship Prediction
abstract
Deep learning-based methods significantly advance the exploration of associations among triple-wise biological entities (e.g., drug-target protein-adverse reaction), thereby facilitating drug discovery and safeguarding human health. However, existing researches only focus on entity-centric information mapping and aggregation, neglecting the crucial role of potential association patterns among different entities. To address the above limitation, we propose a novel association pattern-aware fusion method for biological entity relationship prediction, which effectively integrates the related association pattern information into entity representation learning. Additionally, to enhance the missing information of the low-order message passing, we devise a bind-relation module that considers the strong bind of low-order entity associations. Extensive experiments conducted on three biological datasets quantitatively demonstrate that the proposed method achieves about 4%-23% hit@1 improvements compared with state-of-the-art baselines. Furthermore, the interpretability of association patterns is elucidated in detail, thus revealing the intrinsic biological mechanisms and promoting it to be deployed in real-world scenarios. Our data and code are available at https://github.com/hry98kki/PatternBERP.
Lingxiang Jia, Yuchen Ying, Zunlei Feng, Zipeng Zhong, Shaolun Yao, Jiacong Hu, Mingjiang Duan, Xingen Wang, Jie Song 0011, Mingli Song
NeurIPS4
2022 Chemical Property Relation Guided Few-Shot Molecular Property Prediction
abstract
The ability of molecular property prediction is of great significance to drug discovery. However, molecular property prediction is essentially a few-shot problem, making it a challenge in deep learning applications in this scenario. Although some deep learning models, such as meta-learning, have been used in few-shot molecular property prediction, they neglect the relationships among different properties. In this paper, we introduce a chemical property relation modeling technique for generating the property relation map, which can guide the few-shot molecular property prediction with positively related properties. Some molecules sharing common properties are firstly picked out. Then, multiple property-aware graph neural networks are trained for extracting molecular representations from those molecules. Next, the Spearman's correlation is adopted to calculate the property relations with the property-aware matrix, which is built by calculating the pairwise similarity of the above molecular representations for each pair of properties. In the few-shot molecular property prediction task, the meta-learning strategy is adopted to learn common prediction knowledge from the meta-training categories, which are provided by the property relations. Extensive experiments on two public few-shot molecular property datasets demonstrate that the positively related properties are beneficial for the target property prediction, while negatively related properties have negative effects. With the guidance of positively related properties, the proposed method outperforms various state-of-the-art methods.
Shaolun Yao, Zunlei Feng, Jie Song 0011, Lingxiang Jia, Zipeng Zhong, Mingli Song
IJCNN5