Pengfei Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pengfei Zheng has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Can Xu
School of Data Science and Engineering, East China Normal University, Shanghai, China
2 shared publications - Chenglong Shi
School of Cyber Science and Engineering, Southeast University, Nanjing, China
2 shared publications - Haosen Wang
School of Cyber Science and Engineering, Southeast University, Nanjing, China
2 shared publications - Hongyang Chen
Zhejiang Lab
2 shared publications - Chunqi Wu
School of Cyber Science and Engineering, Southeast University, Nanjing, China
1 shared publication - Haishuai Wang
Zhejiang University
1 shared publication
Latest Publications
- 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.
- 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.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (6) , 7225-7237
Learning Co-occurrence Patterns for Next Destination Recommendation
Next destination recommendation is a crucial research area for understanding human travel behavior. However, existing studies often overlook the problem of underfitting, which arises due to the limited regularity in users’ travel patterns. To tackle this issue, we leverage diverse co-occurrence patterns (CoPs) to discover potential user preferences. These patterns capture intersections with similar spatial and temporal characteristics in users’ travels. However, traditional graph neural network (GNN)-based approaches struggle to effectively handle complex spatial-temporal CoPs. To overcome these challenges, we propose a novel framework called DHIN (Dynamic Heterogeneous Information Network). First, to address the problem of underfitting, DHIN constructs intricate CoPs by leveraging abundant features and connection relationships. Additionally, to solve the needs of cold-start users, DHIN generates potential connections by capturing dynamic urban hotspots based on global users’ travel trajectories. Moreover, to model dynamic heterogeneous information, DHIN utilizes a hierarchical attention mechanism and integrates a dynamic encoder. The mechanism integrates multi-level attention to learn informative embeddings from heterogeneous attributes and structures, while the dynamic encoder processes dynamic temporal information for updating node representations. Finally, extensive experiments conducted on real-world trajectory data demonstrate the effectiveness of the proposed DHIN model.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (6) , 7225-7237
Learning Co-occurrence Patterns for Next Destination Recommendation
Next destination recommendation is a crucial research area for understanding human travel behavior. However, existing studies often overlook the problem of underfitting, which arises due to the limited regularity in users’ travel patterns. To tackle this issue, we leverage diverse co-occurrence patterns (CoPs) to discover potential user preferences. These patterns capture intersections with similar spatial and temporal characteristics in users’ travels. However, traditional graph neural network (GNN)-based approaches struggle to effectively handle complex spatial-temporal CoPs. To overcome these challenges, we propose a novel framework called DHIN (Dynamic Heterogeneous Information Network). First, to address the problem of underfitting, DHIN constructs intricate CoPs by leveraging abundant features and connection relationships. Additionally, to solve the needs of cold-start users, DHIN generates potential connections by capturing dynamic urban hotspots based on global users’ travel trajectories. Moreover, to model dynamic heterogeneous information, DHIN utilizes a hierarchical attention mechanism and integrates a dynamic encoder. The mechanism integrates multi-level attention to learn informative embeddings from heterogeneous attributes and structures, while the dynamic encoder processes dynamic temporal information for updating node representations. Finally, extensive experiments conducted on real-world trajectory data demonstrate the effectiveness of the proposed DHIN model.