Guofeng Yan

Dr. Guofeng Yan


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2021 in Quantitative Finance and Economics
Verified
Journal Article
Open access
PDF file
KPKuashuai Peng
Kuashuai Peng
GYGuofeng Yan
Guofeng Yan
The rapid development of financial technology not only provides a lot of convenience to people's production and life, but also brings a lot of risks to financial security. To prevent financial risks, a better way is to build an accurate warning model before the financial risk occurs, not to find a solution after the outbreak of the risk. In the past decade, deep learning has made amazing achievements in the fields, such as image recognition, natural language processing. Therefore, some researchers try to apply deep learning methods to financial risk prediction and most of the results are satisfactory. The main work of this paper is to review the predecessors' work of deep learning for financial risk prediction according to three prominent characteristics of financial data: heterogeneity, multi-source, and imbalance. We first briefly introduced some classical deep learning models as the model basis of financial risk prediction. Then we analyzed the reasons for these characteristics of financial data. Meanwhile, we studied the differences of commonly used deep learning models according to different data characteristics. Finally, we pointed out some open issues with research significance in this field and suggested the future implementations that might be feasible.

1 January 2021 in Data Science in Finance and Economics
Verified
Journal Article
Open access
PDF file
YWYongfeng Wang
Yongfeng Wang
GYGuofeng Yan
Guofeng Yan
Algorithmic trading is one of the most concerned directions in financial applications. Compared with traditional trading strategies, algorithmic trading applications perform forecasting and arbitrage with higher efficiency and more stable performance. Numerous studies on algorithmic trading models using deep learning have been conducted to perform trading forecasting and analysis. In this article, we firstly summarize several deep learning methods that have shown good performance in algorithmic trading applications, and briefly introduce some applications of deep learning in algorithmic trading. We then try to provide the latest snapshot application for algorithmic trading based on deep learning technology, and show the different implementations of the developed algorithmic trading model. Finally, some possible research issues are suggested in the future. The prime objectives of this paper are to provide a comprehensive research progress of deep learning applications in algorithmic trading, and benefit for subsequent research of computer program trading systems.

29 April 2025 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
GYGuofeng Yan
Guofeng Yan
KPKuashuai Peng
Kuashuai Peng
YWYongfeng Wang
Yongfeng Wang
HTHengliang Tan
Hengliang Tan
JDJiao Du
Jiao Du
HWHeng Wu
Heng Wu

10 March 2023 in Electronics
Verified
Journal Article
Open access
PDF file
WLWangwang Li
Wangwang Li
HTHengliang Tan
Hengliang Tan
JFJianwei Feng
Jianwei Feng
MXMing Xie
Ming Xie
JDJiao Du
Jiao Du
GYGuofeng Yan
Guofeng Yan
Currently, neighborhood linear discriminant analysis (nLDA) exploits reverse nearest neighbors (RNN) to avoid the assumption of linear discriminant analysis (LDA) that all samples from the same class should be independently and identically distributed (i.i.d.). nLDA performs well when a dataset contains multimodal classes. However, in complex pattern recognition tasks, such as visual classification, the complex appearance variations caused by deformation, illumination and visual angle often generate non-linearity. Furthermore, it is not easy to separate the multimodal classes in lower-dimensional feature space. One solution to these problems is to map the feature to a higher-dimensional feature space for discriminant learning. Hence, in this paper, we employ kernel functions to map the original data to a higher-dimensional feature space, where the nonlinear multimodal classes can be better classified. We give the details of the deduction of the proposed kernel reverse neighborhood discriminant analysis (KRNDA) with the kernel tricks. The proposed KRNDA outperforms the original nLDA on most datasets of the UCI benchmark database. In high-dimensional visual recognition tasks of handwritten digit recognition, object categorization and face recognition, our KRNDA achieves the best recognition results compared to several sophisticated LDA-based discriminators.

3 March 2026 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
CLChengwei Liao
Chengwei Liao
GYGuofeng Yan
Guofeng Yan
HTHengliang Tan
Hengliang Tan
JDJiao Du
Jiao Du
XDXia Deng
Xia Deng
HWHeng Wu
Heng Wu
In Vehicle Edge Computing Network (VECN), task offloading is a key technique to provide the satisfactory quality of service (QoS) for latency-sensitive tasks. However, the diversity of computational resources in edge nodes (i.e., RSU and idle vehicles) and the mobility of vehicles present significant challenges to task offloading. Hence, to address these challenges, we propose an offloading scheme that jointly allocates RSU nodes (including MEC servers) and idle service vehicle resources in this paper. We first prioritize these tasks based on their maximum tolerable latency and design a utility function to capture the executing cost for latency-sensitive tasks. Then, we propose a joint optimization algorithm of task offloading location and proportion based on Multi-agent Deep Reinforcement Learning (jTOLP-MADRL algorithm) for latency-sensitive tasks in VECN, which consists of two sub-algorithms: the Offloading Location Selection (OLS) algorithm and the Offloading Proportion Allocation (OPA) algorithm. Additionally, we design a Convolutional Recurrent Actor-Critic Network (CRACN) to enhance the learning efficiency of the OLS algorithm. Finally, we indicate our algorithm is effective based on simulation results. Compared with the other benchmark algorithms, jTOLP-MADRL can significantly reduce latency and enhance system utility.

26 March 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XZXiao Zeng
Xiao Zeng
GYGuofeng Yan
Guofeng Yan
HTHengliang Tan
Hengliang Tan
JDJiao Du
Jiao Du
XDXia Deng
Xia Deng
HWHeng Wu
Heng Wu
The task offloading and resource allocation strategies aim to provide efficient edge computing services for ground mobile devices in mobile edge computing (MEC) environments. In this article, we propose an autonomous aerial vehicles (AAVs)-assisted dynamic deployment and decision-making (dDDM) framework to address the issue of insufficient base station coverage in remote areas or emergency scenarios, which leverages the flexibility and computational capabilities of a AAV to supplement terrestrial cellular networks. We focus on optimizing the AAV trajectory to support and enhance the effectiveness of task offloading and resource allocation strategies under conditions of user mobility and stochastic task arrivals. Therefore, a joint optimization problem is formulated with the objective of minimizing the weighted sum of the total latency of ground mobile devices and the overall energy consumption of the AAV. To solve this problem, the original optimization problem is decomposed into two subproblems: AAV trajectory planning, and decision-making for task offloading and computing resource allocation. For the AAV trajectory planning subproblem, we propose an improved particle swarm optimization (PSO) algorithm integrated with $K$ -means clustering, i.e., KMPSO algorithm, enabling dynamic AAV deployment in response to user mobility. For the task offloading and resource allocation decision-making, an improved black-winged kite algorithm (IBKA) is developed to determine optimal offloading and allocation strategies. Simulation results demonstrate that the proposed approach outperforms existing benchmark algorithms in terms of both latency and energy consumption.