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

Fangyu Zhou

dblp:289/8052 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
8since 2021 · last 2026
—ORCID · conflict

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

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

Interdisciplinary, comprehensive, and emerging computing
2 papers
Medical and health informatics · 78% Bioinformatics and computational biology · 22%
Artificial intelligence
1 paper
Generative modeling · 100%

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

TopicWeightPapersLastEvidence papers
Medical and health informatics
computational pathology
1.012026
Libra-MIL: Multimodal Prototypes Stereoscopic Infused with Task-specific Language Priors for Few-shot Whole Slide Image Classification · AAAI 2026
Medical and health informatics › computational pathology › histopathology image analysis › whole slide image analysis
whole slide image classification
1.012026
Libra-MIL: Multimodal Prototypes Stereoscopic Infused with Task-specific Language Priors for Few-shot Whole Slide Image Classification · AAAI 2026
Medical and health informatics › computational pathology
histopathology image analysis
0.912025
Dynamic Entity-Masked Graph Diffusion Model for Histopathology Image Representation Learning · AAAI 2025
Bioinformatics and computational biology
survival analysis
0.912025
Dynamic Entity-Masked Graph Diffusion Model for Histopathology Image Representation Learning · AAAI 2025
Medical and health informatics › computational pathology
multiple instance learning
0.312026
Libra-MIL: Multimodal Prototypes Stereoscopic Infused with Task-specific Language Priors for Few-shot Whole Slide Image Classification · AAAI 2026
Machine learning › Generative modeling
diffusion model
0.312025
Dynamic Entity-Masked Graph Diffusion Model for Histopathology Image Representation Learning · AAAI 2025

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

self-supervised learning · 1.7masked graph reconstruction · 1.7graph diffusion model · 1.7prototype learning · 1.0optimal transport · 1.0large language model · 1.0
YearPublicationVenuePosition
2026 Libra-MIL: Multimodal Prototypes Stereoscopic Infused with Task-specific Language Priors for Few-shot Whole Slide Image Classification
abstract
While Large Language Models (LLMs) are emerging as a promising direction in computational pathology, the substantial computational cost of giga-pixel Whole Slide Images (WSIs) necessitates the use of Multi-Instance Learning (MIL) to enable effective modeling. A key challenge is that pathological tasks typically provide only bag-level labels, while instance-level descriptions generated by LLMs often suffer from bias due to a lack of fine-grained medical knowledge. To address this, we propose that constructing task-specific pathological entity prototypes is crucial for learning generalizable features and enhancing model interpretability. Furthermore, existing vision-language MIL methods often employ unidirectional guidance, limiting cross-modal synergy. In this paper, we introduce a novel approach, Multimodal Prototype-based Multi-Instance Learning, that promotes bidirectional interaction through a balanced information compression scheme. Specifically, we leverage a frozen LLM to generate task-specific pathological entity descriptions, which are learned as text prototypes. Concurrently, the vision branch learns instance-level prototypes to mitigate the model's reliance on redundant data. For the fusion stage, we employ the Stereoscopic Optimal Transport (SOT) algorithm, which is based on a similarity metric, thereby facilitating broader semantic alignment in a higher-dimensional space. We conduct few-shot classification and explainability experiments on three distinct cancer datasets, and the results demonstrate the superior generalization capabilities of our proposed method.
Zhenfeng Zhuang, Fangyu Zhou, Liansheng Wang 0002
AAAI2
2026 FG-DDI: Functional group-aware graph neural networks for drug-drug interaction prediction
abstract
OBJECTIVE: We aim to improve Drug-Drug Interactions (DDIs) by explicitly injecting medicinal-chemistry knowledge of functional groups (FGs) into graph neural network (GNN) message passing, in both transductive and inductive settings. Our goal is to (i) encode FG priors in a trainable way that enhances representation quality without handcrafting features, and (ii) yield interpretable attributions that align learned weights with pharmacologically meaningful FG patterns. METHODS: We introduce FG-DDI, a dual-view GNN that augments both intra- and inter-molecular reasoning. At the intra-molecular level, atom/bond messages are scaled by FG enrichment weights derived from detected FG motifs within each drug graph. At the inter-molecular level, a bipartite message-passing layer between a drug pair is modulated by FG-FG enrichment scores that reflect empirical co-occurrence in known DDIs. Enrichment is computed as odds ratios from corpus statistics and injected via learnable gates, ensuring differentiability and allowing data to override noisy priors. We couple this with standard supervision on interaction labels and report accuracy (ACC), AUROC, average precision (AP), and F1. Experiments use DrugBank (1706 drugs; 86 interaction types) and TwoSides (filtered triplets) under transductive and inductive splits (one unseen; both unseen). We perform ablations removing each FG term to isolate contributions and assess stability across splits. RESULTS: Comprehensive experiments on DrugBank and TwoSides datasets demonstrate that FG-DDI achieves superior performance compared to state-of-the-art methods. For DrugBank, the accuracy improves by 0.36% in transductive settings and by 0.46% and 1.42% in inductive settings, respectively for S1 and S2 partitioning. CONCLUSION: By systematically integrating chemical domain knowledge into deep learning architectures, this approach enables better generalization to unseen drug combinations while maintaining computational efficiency, making it particularly valuable for real-world pharmaceutical applications where new drugs continuously enter the market.
Fangyu Zhou, Shahadat Uddin
J. Biomed. Informatics1
2025 Dynamic Entity-Masked Graph Diffusion Model for Histopathology Image Representation Learning
abstract
Significant disparities between the features of natural images and those inherent to histopathological images make it challenging to directly apply and transfer pre-trained models from natural images to histopathology tasks. Moreover, the frequent lack of annotations in histopathology patch images has driven researchers to explore self-supervised learning methods like mask reconstruction for learning representations from large amounts of unlabeled data. Crucially, previous mask-based efforts in self-supervised learning have often overlooked the spatial interactions among entities, which are essential for constructing accurate representations of pathological entities. To address these challenges, constructing graphs of entities is a promising approach. In addition, the diffusion reconstruction strategy has recently shown superior performance through its random intensity noise addition technique to enhance the robust learned representation. Therefore, we introduce H-MGDM, a novel self-supervised Histopathology image representation learning method through the Dynamic Entity-Masked Graph Diffusion Model. Specifically, we propose to use complementary subgraphs as latent diffusion conditions and self-supervised targets respectively during pre-training. We note that the graph can embed entities' topological relationships and enhance representation. Dynamic conditions and targets can improve pathological fine reconstruction. Our model has conducted pretraining experiments on three large histopathological datasets. The advanced predictive performance and interpretability of H-MGDM are clearly evaluated on comprehensive downstream tasks such as classification and survival analysis on six datasets.
Zhenfeng Zhuang, Min Cen, Fangyu Zhou, Lequan Yu, Baptiste Magnier, Liansheng Wang 0002
AAAI4
2025 Optimal adaptive scheduling to maximize throughput for battery constrained time-varying RF-powered systems
Fangyu Zhou, Feng Shan, Weiwei Wu 0001, Runqun Xiong, Junzhou Luo
Comput. Networks1
2025 Feature calibration and feature separation for long-tailed visual recognition
Fangyu Zhou, Xiangge Zhao, Yangtao Lin, Haibo Ye
Neurocomputing2
2024 Class-Aware Feature Perturbation for Long-Tailed Visual Recognition
abstract
The distribution of data in the real world is often imbalanced, with a small number of classes having a large number of instances, while most other classes have relatively few sample instances, resulting in a long-tailed distribution. Supervised contrastive learning still tends to favor classes with more samples, making it challenging to learn discriminative and robust features in imbalanced settings. In our work, we theoretically analyze the advantages of hard samples in contrastive learning and propose an end-to-end training framework based on class-aware perturbation. Specifically, we introduce different levels of perturbation based on class priors to construct hard samples, improve the disadvantaged position of tail classes, balance the feature space distribution, and dynamically adjust the classifier output with a combination of local batch priors and global priors. Experimental results show that our method achieves competitive performance across multiple long-tailed benchmark datasets.
Xicheng Chen, Haibo Ye, Fangyu Zhou
ICME3
2023 Balanced Mixup Loss for Long-Tailed Visual Recognition
abstract
In the real world, the data collected naturally are often long-tailed, which inevitably leads to class-imbalanced prediction and performance degradation. As a simple and effective data augmentation method, Mixup has been proven to be beneficial for the tail class in recent long-tail learning studies. However, samples selected by Mixup are still imbalanced, which could exacerbate the imbalance problem. Existing work always considers adjusting the input distribution to alleviate this problem, while this may lead to over-fitting in the tail class. In this paper, we detail the theoretical analysis of the data imbalance caused by Mixup, and propose a novel Balanced Mixup (BaMix) loss function from the output perspective. By adding a balance term, we theoretically prove the BaMix loss can overcome the imbalance caused by Mixup. In the experiments, our solution achieves the state-of-the-art performance on CIFAR-LT, ImageNet-LT, and iNaturalist 2018.
Haibo Ye, Fangyu Zhou, Xinjie Li 0007, Qingheng Zhang
ICASSP2
2023 Space-Transform Margin Loss with Mixup for Long-Tailed Visual Recognition
Fangyu Zhou, Xicheng Chen, Haibo Ye
PRCV (8)1