Nan Yin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nan Yin has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Yingxu Wang
Mohamed bin Zayed University of Artificial Intelligence, Abu Dhabi, United Arab Emirates
2 shared publications - Bowen Zhang
Shenzhen Technology University
1 shared publication - Fuqiang Niu
Shenzhen Technology University, Shenzhen, China
1 shared publication - Genan Dai
School of Artificial Intelligence, Shenzhen Technology University, China
1 shared publication - Haodong Zhang
Software College, Northeastern University, Shenyang, China
1 shared publication - Hu Huang
School of Cyberspace Security, University of Science and Technology of China, Hefei, China
1 shared publication
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 5125-5136
USBD: Universal Structural Basis Distillation for Source-Free Graph Domain Adaptation
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 5125-5136
Open AccessUSBD: Universal Structural Basis Distillation for Source-Free Graph Domain Adaptation
- 30 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 326
A survey of stance detection on social media: New directions and perspectives in the era of large language models
- 30 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 326
A survey of stance detection on social media: New directions and perspectives in the era of large language models
- 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
- 8 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 32-38
NeRM-Net: Reflective Evolution of Routing Strategies for Dynamic Communication Networks
- 8 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 32-38
Open AccessNeRM-Net: Reflective Evolution of Routing Strategies for Dynamic Communication Networks
- Open Access
- 8 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-18
DuSEGO: Dual Second-Order Equivariant Graph Ordinary Differential Equation
Graph Neural Networks (GNNs) with equivariant properties have achieved significant success in modeling complex dynamic systems and molecular properties. However, their expressiveness ability is limited by: (1) Existing methods often overlook the over-smoothing issue caused by traditional GNN models, as well as the gradient explosion or vanishing problems in deep GNNs. (2) Most models operate on first-order information, neglecting that the real world often consists of second-order systems, which further limits the model’s representation capabilities. To address these issues, we propose the Dual Second-order Equivariant Graph Ordinary (DuSEGO) Differential Equation for equivariant representation. Specifically, DuSEGO applies the dual second-order equivariant graph ordinary differential equations (Graph ODEs) to both graph embeddings and node coordinates simultaneously. Theoretically, we first prove that DuSEGO maintains the equivariant property. Furthermore, we provide theoretical insights showing that DuSEGO effectively alleviates the over-smoothing problem in both feature representation and coordinate update. Additionally, we demonstrate that the proposed DuSEGO mitigates the exploding and vanishing gradients problem, facilitating the training of deep multi-layer GNNs. Extensive experiments on benchmark datasets validate the superiority of the proposed DuSEGO compared to baselines.
- 8 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-18
Open AccessDuSEGO: Dual Second-Order Equivariant Graph Ordinary Differential Equation
Graph Neural Networks (GNNs) with equivariant properties have achieved significant success in modeling complex dynamic systems and molecular properties. However, their expressiveness ability is limited by: (1) Existing methods often overlook the over-smoothing issue caused by traditional GNN models, as well as the gradient explosion or vanishing problems in deep GNNs. (2) Most models operate on first-order information, neglecting that the real world often consists of second-order systems, which further limits the model’s representation capabilities. To address these issues, we propose the Dual Second-order Equivariant Graph Ordinary (DuSEGO) Differential Equation for equivariant representation. Specifically, DuSEGO applies the dual second-order equivariant graph ordinary differential equations (Graph ODEs) to both graph embeddings and node coordinates simultaneously. Theoretically, we first prove that DuSEGO maintains the equivariant property. Furthermore, we provide theoretical insights showing that DuSEGO effectively alleviates the over-smoothing problem in both feature representation and coordinate update. Additionally, we demonstrate that the proposed DuSEGO mitigates the exploding and vanishing gradients problem, facilitating the training of deep multi-layer GNNs. Extensive experiments on benchmark datasets validate the superiority of the proposed DuSEGO compared to baselines.