Can Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Can Xu has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Chenglong Shi
School of Cyber Science and Engineering, Southeast University, Nanjing, China
3 shared publications - Haosen Wang
School of Cyber Science and Engineering, Southeast University, Nanjing, China
3 shared publications - Hongyang Chen
Zhejiang Lab
3 shared publications - Pan Tang
School of Economics and Management, Southeast University, Nanjing, China
2 shared publications - Pengfei Zheng
Zhejiang Lab, Hangzhou, China
2 shared publications - Surong Yan
Zhejiang University of Finance and Economics, Hangzhou, China
2 shared publications
Latest Publications
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 709-718
Enhancing Homophily in Heterogeneous Graph Contrastive Learning via Connection Strength and Multi-view Self-Expression
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 709-718
Open AccessEnhancing Homophily in Heterogeneous Graph Contrastive Learning via Connection Strength and Multi-view Self-Expression
- 2 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (5) , 2254-2266
A Structure Redefined Graph Pretraining With Contrastive Prompting for Fake News Detection
Fake news detection on social media is crucial to purifying the online environment and protecting public safety. Many existing methods explore the news propagation structures through graph neural networks (GNNs) to determine the truthfulness of news. End-to-end supervised GNNs notoriously depend on large amounts of labels. Recently, self-supervised graph pretraining has been a promising solution to alleviate the dependence on labels. However, the application of graph pretraining in fake news detection still suffers from two challenges: 1) the missing and unreliable interactions intrinsic in the news propagation structures seriously damage the pretraining performance. 2) There is an inherent gap between pretraining and downstream fake news detection tasks due to inconsistency in optimization objectives, which hinders the efficient transfer of pretrained prior knowledge and causes suboptimal detection results. To address the above two challenges, we propose RGCP, a structure redefined graph pretraining with contrastive prompting for fake news detection. Specifically, we design a propagation structure refinement module that adds potential implicit interactions and removes noisy interactions according to the connection probabilities between posts estimated under the guidance of self-supervised contrastive learning. Thereby, the redefined structures provide reliable news propagation patterns to generate robust pretrained news representations. Moreover, we propose a novel prompt tuning based on the contrastive learning module that reformulates the downstream fake news detection task in a similar form as the graph contrastive pretraining, bridging the optimization objective gap. The extensive experiments on benchmark datasets demonstrate the superiority of RGCP, achieving an average improvement of 10.15% in few-shot classification.
- 2 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (5) , 2254-2266
A Structure Redefined Graph Pretraining With Contrastive Prompting for Fake News Detection
Fake news detection on social media is crucial to purifying the online environment and protecting public safety. Many existing methods explore the news propagation structures through graph neural networks (GNNs) to determine the truthfulness of news. End-to-end supervised GNNs notoriously depend on large amounts of labels. Recently, self-supervised graph pretraining has been a promising solution to alleviate the dependence on labels. However, the application of graph pretraining in fake news detection still suffers from two challenges: 1) the missing and unreliable interactions intrinsic in the news propagation structures seriously damage the pretraining performance. 2) There is an inherent gap between pretraining and downstream fake news detection tasks due to inconsistency in optimization objectives, which hinders the efficient transfer of pretrained prior knowledge and causes suboptimal detection results. To address the above two challenges, we propose RGCP, a structure redefined graph pretraining with contrastive prompting for fake news detection. Specifically, we design a propagation structure refinement module that adds potential implicit interactions and removes noisy interactions according to the connection probabilities between posts estimated under the guidance of self-supervised contrastive learning. Thereby, the redefined structures provide reliable news propagation patterns to generate robust pretrained news representations. Moreover, we propose a novel prompt tuning based on the contrastive learning module that reformulates the downstream fake news detection task in a similar form as the graph contrastive pretraining, bridging the optimization objective gap. The extensive experiments on benchmark datasets demonstrate the superiority of RGCP, achieving an average improvement of 10.15% in few-shot classification.
- 23 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 7954-7972
Diffusion-Based Graph Generative Methods
Being the most cutting-edge generative methods, diffusion methods have shown great advances in wide generation tasks. Among them, graph generation attracts significant research attention for its broad application in real life. In our survey, we systematically and comprehensively review on diffusion-based graph generative methods. We first make a review on three mainstream paradigms of diffusion methods, which are denoising diffusion probabilistic models, score-based genrative models, and stochastic differential equations. Then we further categorize and introduce the latest applications of diffusion models on graphs. In the end, we point out some limitations of current studies and future directions of future explorations. The summary of existing methods metioned in this survey is in our Github: https://github.com/zhejiangzhuque/Diffusion-based-Graph-Generative-Methods .
- 23 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 7954-7972
Diffusion-Based Graph Generative Methods
Being the most cutting-edge generative methods, diffusion methods have shown great advances in wide generation tasks. Among them, graph generation attracts significant research attention for its broad application in real life. In our survey, we systematically and comprehensively review on diffusion-based graph generative methods. We first make a review on three mainstream paradigms of diffusion methods, which are denoising diffusion probabilistic models, score-based genrative models, and stochastic differential equations. Then we further categorize and introduce the latest applications of diffusion models on graphs. In the end, we point out some limitations of current studies and future directions of future explorations. The summary of existing methods metioned in this survey is in our Github: https://github.com/zhejiangzhuque/Diffusion-based-Graph-Generative-Methods .
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 3057-3068
Unsupervised Heterogeneous Graph Rewriting Attack via Node Clustering
Self-supervised learning (SSL) has become one of the most popular learning paradigms and has achieved remarkable success in the graph field. Recently, a series of pre-training studies on heterogeneous graphs (HGs) using SSL have been proposed considering the heterogeneity of real-world graph data. However, verification of the robustness of heterogeneous graph pre-training is still a research gap. Most existing researches focus on supervised attacks on graphs, which are limited to a specific scenario and will not work when labels are not available. In this paper, we propose a novel unsupervised heterogeneous graph rewriting attack via node clustering (HGAC) that can effectively attack HG pre-training models without using labels. Specifically, a heterogeneous edge rewriting strategy is designed to ensure the rationality and concealment of the attacks. Then, a tailored heterogeneous graph contrastive learning (HGCL) is used as a surrogate model. Moreover, we leverage node clustering results of the clean HGs as the pseudo-labels to guide the optimization of structural attacks. Extensive experiments exhibit powerful attack performances of our HGAC on various downstream tasks (i.e., node classification, node clustering, metapath prediction, and visualization) under poisoning attack and evasion attack.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 3057-3068
Open AccessUnsupervised Heterogeneous Graph Rewriting Attack via Node Clustering
Self-supervised learning (SSL) has become one of the most popular learning paradigms and has achieved remarkable success in the graph field. Recently, a series of pre-training studies on heterogeneous graphs (HGs) using SSL have been proposed considering the heterogeneity of real-world graph data. However, verification of the robustness of heterogeneous graph pre-training is still a research gap. Most existing researches focus on supervised attacks on graphs, which are limited to a specific scenario and will not work when labels are not available. In this paper, we propose a novel unsupervised heterogeneous graph rewriting attack via node clustering (HGAC) that can effectively attack HG pre-training models without using labels. Specifically, a heterogeneous edge rewriting strategy is designed to ensure the rationality and concealment of the attacks. Then, a tailored heterogeneous graph contrastive learning (HGCL) is used as a surrogate model. Moreover, we leverage node clustering results of the clean HGs as the pseudo-labels to guide the optimization of structural attacks. Extensive experiments exhibit powerful attack performances of our HGAC on various downstream tasks (i.e., node classification, node clustering, metapath prediction, and visualization) under poisoning attack and evasion attack.
- 3 May 2023
- Published by Elsevier in Information Sciences
- Vol. 640
A fairness-aware graph contrastive learning recommender framework for social tagging systems
- 3 May 2023
- Published by Elsevier in Information Sciences
- Vol. 640
A fairness-aware graph contrastive learning recommender framework for social tagging systems