Ying Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ying Wang has a total of 123 co-authors. Here are the top co-authors by number of shared publications:
- Xin Wang
Jilin University, Changchun, China
15 shared publications - Mingchen Sun
School of Computer Science and Technology, Jilin University, Changchun 130012, China
9 shared publications Xin Wang
8 shared publications- Yingji Li
College of Computer Science and Technology, Jilin University, Changchun, China
6 shared publications - Mengnan Du
New Jersey Institute of Technology, USA
5 shared publications Xinglin Liu
5 shared publications
Latest Publications
- Open Access
- 23 October 2026
- Published by Elsevier in SSRN Electronic Journal
TCSR-GSL: Graph Structure Learning in Noisy Information Networksvia Triangular Relational Consistency and Spectral Regularization
Semi-supervised node classification in real-world information networks draws on graph topology, node attributes, and a small set of labels. Current Graph Structure Learning (GSL) methods tend to process these sources separately or allow them to interact only through node-level prediction losses. As a result, consistency among the pairwise relations induced by topology, representations, and labels is not directly constrained. The global spectral behavior of the learned graph also receives little explicit control. We present TCSR-GSL, a framework that couples relation-level structure learning with spectral regularization. The model first infers an attribute-based structural component and progressively blends it with the observed topology. It then casts topology, node representations, and label supervision as pairwise relations and aligns the three relation spaces with a triangular consistency objective. High-confidence pseudo-labels are gradually admitted to extend these constraints beyond labeled nodes, while confidence-based weighting limits the influence of uncertain predictions. Spectral regularization further preserves selected low-frequency propagation modes, controls irregular spacing outside the protected spectral region, and penalizes excessive upper-tail responses. During training, opposing weight schedules gradually reduce the emphasis on relational consistency while strengthening spectral regularization, shifting the optimization from early semantic alignment toward global frequency-response conditioning as the learned structure becomes more stable. Experiments on six benchmark datasets show that TCSR-GSL achieves the highest mean node-classification accuracy on every dataset, with an average absolute gain of $0.62$ percentage points over the strongest competing method, and remains robust under severe label scarcity and topology perturbations.- 23 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessTCSR-GSL: Graph Structure Learning in Noisy Information Networksvia Triangular Relational Consistency and Spectral Regularization
Semi-supervised node classification in real-world information networks draws on graph topology, node attributes, and a small set of labels. Current Graph Structure Learning (GSL) methods tend to process these sources separately or allow them to interact only through node-level prediction losses. As a result, consistency among the pairwise relations induced by topology, representations, and labels is not directly constrained. The global spectral behavior of the learned graph also receives little explicit control. We present TCSR-GSL, a framework that couples relation-level structure learning with spectral regularization. The model first infers an attribute-based structural component and progressively blends it with the observed topology. It then casts topology, node representations, and label supervision as pairwise relations and aligns the three relation spaces with a triangular consistency objective. High-confidence pseudo-labels are gradually admitted to extend these constraints beyond labeled nodes, while confidence-based weighting limits the influence of uncertain predictions. Spectral regularization further preserves selected low-frequency propagation modes, controls irregular spacing outside the protected spectral region, and penalizes excessive upper-tail responses. During training, opposing weight schedules gradually reduce the emphasis on relational consistency while strengthening spectral regularization, shifting the optimization from early semantic alignment toward global frequency-response conditioning as the learned structure becomes more stable. Experiments on six benchmark datasets show that TCSR-GSL achieves the highest mean node-classification accuracy on every dataset, with an average absolute gain of $0.62$ percentage points over the strongest competing method, and remains robust under severe label scarcity and topology perturbations. - Open Access
- 10 September 2026
- Published by Springer Nature in Complex & Intelligent Systems
Causality mining by candidate events extension and multi-level background knowledge
- 10 September 2026
- Published by Springer Nature in Complex & Intelligent Systems
Open AccessCausality mining by candidate events extension and multi-level background knowledge
- Open Access
- 5 August 2026
- Published by Elsevier in SSRN Electronic Journal
Reliable Graph Structure Learning in Noisy Information Networks via Triangular Relational Consistency and Spectral Regularization
Existing semi-supervised graph structure learning methods often reconstruct topology from local feature similarities while decoupling topology learning, representation learning, and label supervision, leading to inconsistent relational modeling and vulnerability to structural noise. To address this problem, we propose TCSR-GSL, a unified framework that jointly learns graph topology, node representations, and label-aware relations. TCSR-GSL constructs task-relevant topology through bilinear relation scoring, $K$-nearest-neighbor sparsification, and momentum-based graph fusion. It further introduces triangular consistency to align topological, semantic, and label spaces, together with spectral smoothing regularization to preserve low-frequency graph smoothness and suppress high-frequency noise. Experiments on five benchmark datasets show that TCSR-GSL achieves an average $3.9\%$ improvement in node classification accuracy and reaches up to $94.75\%$ AUC and $95.72\%$ AP in link prediction, demonstrating its effectiveness for label-scarce classification and latent relation inference.- 5 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessReliable Graph Structure Learning in Noisy Information Networks via Triangular Relational Consistency and Spectral Regularization
Existing semi-supervised graph structure learning methods often reconstruct topology from local feature similarities while decoupling topology learning, representation learning, and label supervision, leading to inconsistent relational modeling and vulnerability to structural noise. To address this problem, we propose TCSR-GSL, a unified framework that jointly learns graph topology, node representations, and label-aware relations. TCSR-GSL constructs task-relevant topology through bilinear relation scoring, $K$-nearest-neighbor sparsification, and momentum-based graph fusion. It further introduces triangular consistency to align topological, semantic, and label spaces, together with spectral smoothing regularization to preserve low-frequency graph smoothness and suppress high-frequency noise. Experiments on five benchmark datasets show that TCSR-GSL achieves an average $3.9\%$ improvement in node classification accuracy and reaches up to $94.75\%$ AUC and $95.72\%$ AP in link prediction, demonstrating its effectiveness for label-scarce classification and latent relation inference. - 1 August 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (8) , 5323-5338
MuDPK: Knowledge Distillation With Multi-Granularity and Dynamic Priors for Graph Classification
Knowledge distillation technology shows significant potential in transferring the knowledge of graph neural network (GNN) teacher models to multi-layer perceptron (MLP) student models. However, the existing methods are primarily designed for node classification task and are difficult to directly apply to graph classification. Graph classification task requires knowledge transfer via the generation of graph-level soft labels. Such global supervisory signals are inherently sparse, making it difficult for the student model to capture fine-grained structural information. Additionally, the student MLP model lacks the explicit ability to handle graph structures and has a significantly different representation space from the teacher GNN which further complicates the knowledge transfer process. We address these problems by proposing multigranularity distillation with a dynamic prior knowledge framework named MuDPK. The proposed framework integrates multigranularity structural information with the dynamic prior knowledge mechanism to effectively address the challenges of sparse supervision signals and the representation bottleneck in graph classification. We first design an adaptive graph propagation-based node feature enhancement module to enhance the representation capability of the student model in a limited feature space. We then design a triple distillation loss function that includes graph-level, subgraph-level, and node-level components. We alleviate the problem of sparse supervision signals by hierarchically aligning the structural representations of the teacher-student model at different levels. Finally, we use the intermediate layer features of the teacher as both the target representation and input knowledge, dynamically adjusted by our prior knowledge mechanism. Knowledge transfer is achieved through feature alignment while the student model is regulated by adjusting the proportion of injected knowledge in a controlled manner. Extensive experiments on eight benchmark graph datasets demonstrate the effectiveness and superiority of MuDPK, which achieves an average accuracy gain of +1.37% over the baselines.
- 1 August 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (8) , 5323-5338
MuDPK: Knowledge Distillation With Multi-Granularity and Dynamic Priors for Graph Classification
Knowledge distillation technology shows significant potential in transferring the knowledge of graph neural network (GNN) teacher models to multi-layer perceptron (MLP) student models. However, the existing methods are primarily designed for node classification task and are difficult to directly apply to graph classification. Graph classification task requires knowledge transfer via the generation of graph-level soft labels. Such global supervisory signals are inherently sparse, making it difficult for the student model to capture fine-grained structural information. Additionally, the student MLP model lacks the explicit ability to handle graph structures and has a significantly different representation space from the teacher GNN which further complicates the knowledge transfer process. We address these problems by proposing multigranularity distillation with a dynamic prior knowledge framework named MuDPK. The proposed framework integrates multigranularity structural information with the dynamic prior knowledge mechanism to effectively address the challenges of sparse supervision signals and the representation bottleneck in graph classification. We first design an adaptive graph propagation-based node feature enhancement module to enhance the representation capability of the student model in a limited feature space. We then design a triple distillation loss function that includes graph-level, subgraph-level, and node-level components. We alleviate the problem of sparse supervision signals by hierarchically aligning the structural representations of the teacher-student model at different levels. Finally, we use the intermediate layer features of the teacher as both the target representation and input knowledge, dynamically adjusted by our prior knowledge mechanism. Knowledge transfer is achieved through feature alignment while the student model is regulated by adjusting the proportion of injected knowledge in a controlled manner. Extensive experiments on eight benchmark graph datasets demonstrate the effectiveness and superiority of MuDPK, which achieves an average accuracy gain of +1.37% over the baselines.
- 25 July 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 351
Causal contrastive learning for generalizable graph classification
- 25 July 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 351
Causal contrastive learning for generalizable graph classification
- 30 June 2026
- Published by Springer Nature
- p. 28-39
GPAT: Graph Prompt and Adapter Tuning for Graph Transfer Learning
- 30 June 2026
- Published by Springer Nature
- p. 28-39
GPAT: Graph Prompt and Adapter Tuning for Graph Transfer Learning
- 27 May 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 348
Adaptive Prompt and External Knowledge Guidance for Enhancing Molecular Graph OOD Detection
- 27 May 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 348
Adaptive Prompt and External Knowledge Guidance for Enhancing Molecular Graph OOD Detection
- 30 April 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 345
PDCE: A Plug-and-Play Dual-Channel Enhancement framework for Dynamic Graph Neural Networks
- 30 April 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 345
PDCE: A Plug-and-Play Dual-Channel Enhancement framework for Dynamic Graph Neural Networks
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2339-2348
SeaRAG: Reducing Hallucination in Retrieval-Augmented Generation via Statement-Entity Adaptive Ranking
Retrieval-augmented generation (RAG) has facilitated large language models (LLMs) by grounding facts in external knowledge. While prior RAG strategies can achieve dynamic control by detecting sentence-wise hallucination, thereby reducing unnecessary computation, they ignore the entity, statement, and their combinations. In this work, we analyze adaptive RAG methods through probing uncertainty to explore real-time entity- and statement-level verification, finding that such information can serve as training-free signals for hallucination detection, and the entropy probes can also guide principled document ranking. Inspired by these insights, we propose SeaRAG, a training-free, adaptive RAG framework that dynamically detects and mitigates hallucinations by probing LLMs at both entity and statement aspects, ranking retrieved passages via entropy-based uncertainty reduction, and regenerating evidence-grounded responses in real-time. Experiments across various Question-Answering benchmarks and multiple LLMs demonstrate consistent accuracy improvements and reduced retrieval rates. SeaRAG with self-correction outperforms Always Retrieve by up to 11.1% on TriviaQA while cutting retrieval frequency from 45.2%, offering an efficient and real-time hallucination control.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2339-2348
Open AccessSeaRAG: Reducing Hallucination in Retrieval-Augmented Generation via Statement-Entity Adaptive Ranking
Retrieval-augmented generation (RAG) has facilitated large language models (LLMs) by grounding facts in external knowledge. While prior RAG strategies can achieve dynamic control by detecting sentence-wise hallucination, thereby reducing unnecessary computation, they ignore the entity, statement, and their combinations. In this work, we analyze adaptive RAG methods through probing uncertainty to explore real-time entity- and statement-level verification, finding that such information can serve as training-free signals for hallucination detection, and the entropy probes can also guide principled document ranking. Inspired by these insights, we propose SeaRAG, a training-free, adaptive RAG framework that dynamically detects and mitigates hallucinations by probing LLMs at both entity and statement aspects, ranking retrieved passages via entropy-based uncertainty reduction, and regenerating evidence-grounded responses in real-time. Experiments across various Question-Answering benchmarks and multiple LLMs demonstrate consistent accuracy improvements and reduced retrieval rates. SeaRAG with self-correction outperforms Always Retrieve by up to 11.1% on TriviaQA while cutting retrieval frequency from 45.2%, offering an efficient and real-time hallucination control.
- 25 March 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 342
CG-CGSL: Clustering and graph topological properties co-guided graph structure learning
- 25 March 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 342
CG-CGSL: Clustering and graph topological properties co-guided graph structure learning