DTSMLA: A dynamic task scheduling multi-level attention model for stock ranking

被引:0
|
作者
Du, Yuanchuang [1 ]
Xie, Liang [1 ]
Liao, Sihao [1 ]
Chen, Shengshuang [1 ]
Wu, Yuchen [1 ]
Xu, Haijiao [2 ]
机构
[1] Wuhan Univ Technol, Sch Sci, Dept Math, Wuhan 430070, Peoples R China
[2] Guangdong Univ Educ, Sch Comp Sci, Guangzhou 510303, Peoples R China
关键词
Stock ranking; Market index; Multi-task learning; Task scheduling;
D O I
10.1016/j.eswa.2023.122956
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Predicting stock ranking is a complex and challenging task due to the intricate nature of real stock market systems. There are two main obstacles for current methods to directly using historical trading data to predict stock ranking: (1) Predicting stock rankings is a complex process influenced by a variety of factors, such as the temporal dependence of each stock, the spatial correlation between stocks, and the influence of the market on the stock; (2) The stock market's considerable noise creates volatility in directly predicting stock rankings on a given day, presenting difficulties in training models. To overcome these two challenges, a dynamic task scheduling multi-level attention model (DTSMLA) is proposed to enhance stock ranking prediction through market index and multi-task learning. In response to complexity of stock data, we synthesize the factors affecting stocks and propose a multi-level attention prediction framework. To address the noise issue, we introduce multi-task learning and use a task scheduler algorithm to dynamically select auxiliary tasks for model training. Experimental results conducted on four real-world stock datasets have demonstrated that our method outperforms several state-of-the-art approaches.
引用
收藏
页数:14
相关论文
共 50 条
  • [31] Multi-level stock-recruit analysis: Beyond steepness and into model uncertainty
    Hillary, Richard M.
    Levontin, Polina
    Kuikka, Sakari
    Manteniemi, Samu
    Mosqueira, Iago
    Kell, Laurie
    ECOLOGICAL MODELLING, 2012, 242 : 69 - 80
  • [32] Multi-level Scheduling Algorithm Based on Storm
    Wang, Jie
    Hang, Siguang
    Liu, Jiwei
    Chen, Weihao
    Hou, Gang
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2016, 10 (03): : 1091 - 1110
  • [33] Multi-level lotsizing and scheduling by batch sequencing
    Jordan, C
    Koppelmann, J
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (11) : 1212 - 1218
  • [34] OM Algorithm for Multi-level Queue Scheduling
    Hasija, Manupriya
    Kaushik, Akhil
    Kumar, Parveen
    2013 INTERNATIONAL CONFERENCE ON MACHINE INTELLIGENCE AND RESEARCH ADVANCEMENT (ICMIRA 2013), 2013, : 564 - 568
  • [35] MMLQ Algorithm for Multi-level Queue Scheduling
    Hasija, Manupriya
    Kaushik, Akhil
    Kaushik, Satvika
    Barnela, Manoj
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2014, 14 (07): : 90 - 94
  • [36] NEW APPROACH TO MULTI-LEVEL PROCESSOR SCHEDULING
    Semnani, Samaneh Hosseini
    Zamanifar, Kamran
    INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2010, 19 (03) : 335 - 346
  • [37] An image inpainting model based on channel attention gated convolution and multi-level attention mechanism
    Zhao, Sihan
    Li, Chunmeng
    Zhang, Chenyang
    Yang, Xiaozhong
    DISPLAYS, 2025, 87
  • [38] Co-Optimization of Memory Access and Task Scheduling on MPSoC Architectures with Multi-Level Memory
    He, Yi
    Xue, Chun Jason
    Xu, Cathy Qun
    Sha, Edwin H. -M.
    2010 15TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC 2010), 2010, : 93 - +
  • [39] Multi-Level Bayesian Calibration of a Multi-Component Dynamic System Model
    Kapusuzoglu, Berkcan
    Mahadevan, Sankaran
    Matsumoto, Shunsaku
    Miyagi, Yoshitomo
    Watanabe, Daigo
    JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING, 2023, 23 (01)
  • [40] Multi-level Hierarchical Controller Assisted Task Scheduling and Resource Allocation in Large Cloud Infrastructures
    Jyothi, S.
    Shylaja, B. S.
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2021, 12 (11) : 382 - 394