Pan Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pan Tang has a total of 29 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 - Can Xu
School of Data Science and Engineering, East China Normal University, Shanghai, China
2 shared publications Chun Tang
2 shared publicationsDitian Zhang
School of Economics and Management, Southeast University, Nanjing, Jiangsu 211189, China
2 shared publicationsHongjuan Peng
School of Economics and Management, Southeast University, Nanjing, China
2 shared publications
Latest Publications
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2632-2642
Continuous Data Augmentation via Condition-Tokenized Diffusion Transformer for Sequential Recommendation
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2632-2642
Open AccessContinuous Data Augmentation via Condition-Tokenized Diffusion Transformer for Sequential Recommendation
- 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
- 24 June 2025
- Published by Elsevier in Finance Research Letters
- Vol. 85
Do insider characteristics matter in opportunistic selling? Evidence from interpretable machine learning
- 24 June 2025
- Published by Elsevier in Finance Research Letters
- Vol. 85
Do insider characteristics matter in opportunistic selling? Evidence from interpretable machine learning
- 9 June 2025
- Published by Springer Nature in Computational Economics
- Vol. 67 (5) , 4199-4242
Predicting Credit Default Risk Crisis of Government Implicit Debt: An Interpretable Machine Learning Approach
- 9 June 2025
- Published by Springer Nature in Computational Economics
- Vol. 67 (5) , 4199-4242
Predicting Credit Default Risk Crisis of Government Implicit Debt: An Interpretable Machine Learning Approach
- 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.
- 17 December 2024
- Published by Elsevier in Journal of Environmental Management
- Vol. 373, 123463
Unraveling asymmetrical spillover effects originating from China’s green finance markets: Insights from asymmetric TVP-VAR and interpretable machine learning
- 17 December 2024
- Published by Elsevier in Journal of Environmental Management
- Vol. 373, 123463
Unraveling asymmetrical spillover effects originating from China’s green finance markets: Insights from asymmetric TVP-VAR and interpretable machine learning
- 29 October 2024
- Published by Taylor & Francis in Emerging Markets Finance and Trade
- p. 1-23
Forecasting Bank Default Risk with Interpretable Machine Learning: The Study of Chinese Banks
- 29 October 2024
- Published by Taylor & Francis in Emerging Markets Finance and Trade
- p. 1-23
Forecasting Bank Default Risk with Interpretable Machine Learning: The Study of Chinese Banks
- 24 July 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 161, 601-613
Accelerating Maximal Bicliques Enumeration with GPU on large scale network
- 24 July 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 161, 601-613
Accelerating Maximal Bicliques Enumeration with GPU on large scale network
- 31 January 2024
- Published by Springer Nature in Computational Economics
- Vol. 64 (5) , 2783-2811
China's business cycle forecasting: a machine learning approach
- 31 January 2024
- Published by Springer Nature in Computational Economics
- Vol. 64 (5) , 2783-2811
China's business cycle forecasting: a machine learning approach
- 3 April 2023
- Published by Taylor & Francis in The Engineering Economist
- Vol. 68 (2) , 60-81
Intraday trend prediction of stock indices with machine learning approaches
In recent years, as research at the intersection of machine learning and finance has grown, predicting stock price movements has become a particularly intriguing issue. Current research focuses primarily on using historical data of the previous day to predict stock movements for the following day, whereas fewer studies use the trading day’s opening data to predict market movements for the current day. We predict intraday price movements of the SSE-50 (Shanghai Securities 50 Index) using stock market opening data as input. Specifically, decision tree, extreme gradient boosting (XGBoost), random forest, support vector machines (SVM), and long-short-term memory are developed to predict the movements of the SSE-50 index utilizing opening price data of various time intervals. We also design three trading strategies when different time frequencies of data are used. At the same time-frequency, the results demonstrate that SVM with Gaussian and linear kernels outperform others. The forecasting accuracy at 10-min frequency approaches 70%, which is close to the results at longer time intervals, indicating that intraday trend can be determined by opening price fluctuations and the first 10-min data contains sufficient information to predict the trend for the entire trading day. In addition, trading methods based on the forecast of daily, weekly, and monthly SSE-50 price movement outperform buy-and-hold strategies. Daily trading performs better than the other two strategies. The outcomes of this research can expand the use of machine learning in quantitative trading and enrich intraday trading techniques further.
- 3 April 2023
- Published by Taylor & Francis in The Engineering Economist
- Vol. 68 (2) , 60-81
Intraday trend prediction of stock indices with machine learning approaches
In recent years, as research at the intersection of machine learning and finance has grown, predicting stock price movements has become a particularly intriguing issue. Current research focuses primarily on using historical data of the previous day to predict stock movements for the following day, whereas fewer studies use the trading day’s opening data to predict market movements for the current day. We predict intraday price movements of the SSE-50 (Shanghai Securities 50 Index) using stock market opening data as input. Specifically, decision tree, extreme gradient boosting (XGBoost), random forest, support vector machines (SVM), and long-short-term memory are developed to predict the movements of the SSE-50 index utilizing opening price data of various time intervals. We also design three trading strategies when different time frequencies of data are used. At the same time-frequency, the results demonstrate that SVM with Gaussian and linear kernels outperform others. The forecasting accuracy at 10-min frequency approaches 70%, which is close to the results at longer time intervals, indicating that intraday trend can be determined by opening price fluctuations and the first 10-min data contains sufficient information to predict the trend for the entire trading day. In addition, trading methods based on the forecast of daily, weekly, and monthly SSE-50 price movement outperform buy-and-hold strategies. Daily trading performs better than the other two strategies. The outcomes of this research can expand the use of machine learning in quantitative trading and enrich intraday trading techniques further.