Yifan Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yifan Wang has a total of 99 co-authors. Here are the top co-authors by number of shared publications:
- Wei Ju
Sichuan University, Chengdu, China
25 shared publications - Ming Zhang
State Key Laboratory for Multimedia Information Processing, School of Computer Science, PKU-Anker LLM Lab, Peking University, Beijing, China
15 shared publications - Xiao Luo
University of Wisconsin–Madison, Madison, WI, USA
13 shared publications - Zhiping Xiao
Paul G. Allen School of Computer Science and Engineering, University of Washington, Seattle, WA, USA
11 shared publications - Siyu Yi
Sichuan University, Chengdu, China
9 shared publications - Xian-Sheng Hua
Tongji University, Shanghai, China
9 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 10828-10837
DUET: Dual-view Uncertainty Driven Entrusted Teaching for Contrastive Deep Graph Clustering
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 10828-10837
Open AccessDUET: Dual-view Uncertainty Driven Entrusted Teaching for Contrastive Deep Graph Clustering
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6158-6167
stMRPC: Decoding Spatial Transcriptomics with Multimodal Rebalancing and Perspective-aware Clustering
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6158-6167
Open AccessstMRPC: Decoding Spatial Transcriptomics with Multimodal Rebalancing and Perspective-aware Clustering
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (10) , 6630-6643
FOND: Fine-Grained Boundary Mining With Dual Bridging for Fair Graph Anomaly Detection
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (10) , 6630-6643
FOND: Fine-Grained Boundary Mining With Dual Bridging for Fair Graph Anomaly Detection
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (7) , 4405-4418
HGOOD-D: Hyperbolic Hierarchical Exploration for Graph Out-of-Distribution Detection
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (7) , 4405-4418
HGOOD-D: Hyperbolic Hierarchical Exploration for Graph Out-of-Distribution Detection
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1892-1903
DisCo: Diffusion-guided Unbiased Discriminative Learning for Unsupervised Graph Domain Adaptation
This paper investigates the task of unsupervised graph domain adaptation, which facilitates the transfer of knowledge from labeled source graphs to unlabeled target graphs. Recent approaches usually utilize graph contrastive learning and pseudo-labeling to learn from unlabeled target data, which could introduce potential biased representations and supervision of target graphs resulting from serious shifts across two domains. Towards this end, we propose a novel framework named Diffusion-guided Unbiased Discriminative Learning (DisCo) for unsupervised graph domain adaptation. The core of our DisCo is to leverage both feature disentanglement and cross-domain diffusion signals to remove the potential biases for target graphs. In particular, we first utilize adversarial feature disentanglement to extract causal features that are orthogonal to domain biases. More importantly, we retrieve the labels of cross-domain source graphs to generate the conditions, which would be utilized to optimize a diffusion model for label denoising. The consistency between pseudo-labels and denoised labels is measured to reduce the potential biases during domain alignment. Extensive experiments on several real-world benchmarks demonstrate that our proposed DisCo consistently outperforms competing state-of-the-art baselines.
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1892-1903
Open AccessDisCo: Diffusion-guided Unbiased Discriminative Learning for Unsupervised Graph Domain Adaptation
This paper investigates the task of unsupervised graph domain adaptation, which facilitates the transfer of knowledge from labeled source graphs to unlabeled target graphs. Recent approaches usually utilize graph contrastive learning and pseudo-labeling to learn from unlabeled target data, which could introduce potential biased representations and supervision of target graphs resulting from serious shifts across two domains. Towards this end, we propose a novel framework named Diffusion-guided Unbiased Discriminative Learning (DisCo) for unsupervised graph domain adaptation. The core of our DisCo is to leverage both feature disentanglement and cross-domain diffusion signals to remove the potential biases for target graphs. In particular, we first utilize adversarial feature disentanglement to extract causal features that are orthogonal to domain biases. More importantly, we retrieve the labels of cross-domain source graphs to generate the conditions, which would be utilized to optimize a diffusion model for label denoising. The consistency between pseudo-labels and denoised labels is measured to reduce the potential biases during domain alignment. Extensive experiments on several real-world benchmarks demonstrate that our proposed DisCo consistently outperforms competing state-of-the-art baselines.
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1159-1170
Dual Data-centric Separation with Circular Mixup for Noise-resistant Time Series Learning
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1159-1170
Open AccessDual Data-centric Separation with Circular Mixup for Noise-resistant Time Series Learning
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1160-1170
KEGOD: Kernel-enhanced Latent Substructure Learning for Graph Out-Of-Distribution Detection
Out-of-Distribution (OOD) detection, which seeks to identify samples deviating from the In-Distribution (ID) training distribution at test time, is crucial for building robust machine learning systems. While extensive efforts have been made for Euclidean data, OOD detection on graph-structured data remains relatively underexplored. On the one hand, the specific properties of a graph may be attributed to its substructures. On the other hand, acquiring labeled data for graph learning is typically time-consuming and labor-intensive. Toward this end, in this paper, we propose a novel kernel-enhanced graph substructure learning framework termed KEGOD for unsupervised graph OOD detection. Specifically, we introduce a learnable graph generator to construct the augmented graph view that preserves distinguishable structure information. Then, for both the input graph and augmented view, a graph neural network (GNN) branch and a graph kernel (GK) branch are incorporated to explore graph latent patterns. By performing multi-branch concordance learning on the extracted graph patterns, our KEGOD captures complementary ID structural semantics in both implicit and explicit manners, enabling reliable detection of OOD graphs through semantic inconsistency. Finally, we build a self-adaptive training mechanism to automatically control diverse sensitivities of the graph patterns. Experimental results on several public graph datasets reveal the superiority of our KEGOD. Our code is available at~ https://github.com/jamesyifan/KEGOD.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1160-1170
Open AccessKEGOD: Kernel-enhanced Latent Substructure Learning for Graph Out-Of-Distribution Detection
Out-of-Distribution (OOD) detection, which seeks to identify samples deviating from the In-Distribution (ID) training distribution at test time, is crucial for building robust machine learning systems. While extensive efforts have been made for Euclidean data, OOD detection on graph-structured data remains relatively underexplored. On the one hand, the specific properties of a graph may be attributed to its substructures. On the other hand, acquiring labeled data for graph learning is typically time-consuming and labor-intensive. Toward this end, in this paper, we propose a novel kernel-enhanced graph substructure learning framework termed KEGOD for unsupervised graph OOD detection. Specifically, we introduce a learnable graph generator to construct the augmented graph view that preserves distinguishable structure information. Then, for both the input graph and augmented view, a graph neural network (GNN) branch and a graph kernel (GK) branch are incorporated to explore graph latent patterns. By performing multi-branch concordance learning on the extracted graph patterns, our KEGOD captures complementary ID structural semantics in both implicit and explicit manners, enabling reliable detection of OOD graphs through semantic inconsistency. Finally, we build a self-adaptive training mechanism to automatically control diverse sensitivities of the graph patterns. Experimental results on several public graph datasets reveal the superiority of our KEGOD. Our code is available at~ https://github.com/jamesyifan/KEGOD.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1286-1297
Long-Tailed Recognition of Evidential Experts for Graph-level Classification
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1286-1297
Open AccessLong-Tailed Recognition of Evidential Experts for Graph-level Classification
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1529-1539
Space-based Parameter Evolving with Lightweight Optimization for Graph Adaptation to Evolving Shifts
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1529-1539
Open AccessSpace-based Parameter Evolving with Lightweight Optimization for Graph Adaptation to Evolving Shifts
- Top Cited Papers
- 7 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 48 (3) , 3036-3055
A Survey of Graph Neural Networks in Real World: Imbalance, Noise, Privacy and OOD Challenges
Graph-structured data exhibits universality and widespread applicability across diverse domains, such as social network analysis, biochemistry, financial fraud detection, and network security. Significant strides have been made in leveraging Graph Neural Networks (GNNs) to achieve remarkable success in these areas. However, in real-world scenarios, the training environment for models is often far from ideal, leading to substantial performance degradation of GNN models due to various unfavorable factors, including imbalance in data distribution, the presence of noise in erroneous data, privacy protection of sensitive information, and generalization capability for out-of-distribution (OOD) scenarios. To tackle these issues, substantial efforts have been devoted to improving the performance of GNN models in practical real-world scenarios, as well as enhancing their reliability and robustness. In this paper, we present a comprehensive survey that systematically reviews existing GNN models, focusing on solutions to the four mentioned real-world challenges including imbalance, noise, privacy, and OOD in practical scenarios that many existing reviews have not considered. Specifically, we first highlight the four key challenges faced by existing GNNs, paving the way for our exploration of real-world GNN models. Subsequently, we provide detailed discussions on these four aspects, dissecting how these solutions contribute to enhancing the reliability and robustness of GNN models. Last but not least, we outline promising directions and offer future perspectives in the field.
- 7 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 48 (3) , 3036-3055
Top Cited PapersA Survey of Graph Neural Networks in Real World: Imbalance, Noise, Privacy and OOD Challenges
Graph-structured data exhibits universality and widespread applicability across diverse domains, such as social network analysis, biochemistry, financial fraud detection, and network security. Significant strides have been made in leveraging Graph Neural Networks (GNNs) to achieve remarkable success in these areas. However, in real-world scenarios, the training environment for models is often far from ideal, leading to substantial performance degradation of GNN models due to various unfavorable factors, including imbalance in data distribution, the presence of noise in erroneous data, privacy protection of sensitive information, and generalization capability for out-of-distribution (OOD) scenarios. To tackle these issues, substantial efforts have been devoted to improving the performance of GNN models in practical real-world scenarios, as well as enhancing their reliability and robustness. In this paper, we present a comprehensive survey that systematically reviews existing GNN models, focusing on solutions to the four mentioned real-world challenges including imbalance, noise, privacy, and OOD in practical scenarios that many existing reviews have not considered. Specifically, we first highlight the four key challenges faced by existing GNNs, paving the way for our exploration of real-world GNN models. Subsequently, we provide detailed discussions on these four aspects, dissecting how these solutions contribute to enhancing the reliability and robustness of GNN models. Last but not least, we outline promising directions and offer future perspectives in the field.