GMTL: A GART Based Multi-task Learning Model for Multi-Social-Temporal Prediction in Online Games

被引:3
作者
Tao, Jianrong [1 ,4 ]
Gong, Linxia [1 ]
Fan, Changjie [1 ]
Chen, Longbiao [2 ]
Ye, Dezhi [1 ]
Zhao, Sha [3 ]
机构
[1] NetEase Inc, Fuxi AI Lab, Hangzhou, Peoples R China
[2] Xiamen Univ, Sch Informat Sci & Technol, Xiamen, Peoples R China
[3] Zhejiang Univ, Coll Comp Sci & Technol, Hangzhou, Peoples R China
[4] NetEase, Fuxi AI Lab, Hangzhou, Peoples R China
来源
PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19) | 2019年
关键词
Time series prediction; link weight prediction; multi-task learning; graph attention network; recurrent neural network; online game;
D O I
10.1145/3357384.3357830
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Multi-social-temporal (MST) data, which represent multi-attributed time series corresponding to the entities in multi-relational social network series, are ubiquitous in real-world and virtual-world dynamic systems, such as online games. Predictions over MST data such as social time series prediction and temporal link weight prediction are of great importance but challenging. They are affected by many complex factors, including temporal characteristics, social characteristics, collaborative characteristics, task characteristics and the intrinsic causality between them. In this paper, we propose a graph attention recurrent network (GART) based multi-task learning model (GMTL) to fuse information across multiple social-temporal prediction tasks. Experiments on an MMORPG dataset demonstrate that GMTL outperforms the state-of-the-art baselines and can significantly improve performances of specific social-temporal prediction task with additional information from others. Our work has been deployed to several MMORPGs in practice and can also expand to many related multi-social-temporal prediction tasks in real-world applications. Case studies on applications for multi-social-temporal prediction show that GMTL produces great value in the actual business in NetEase Games.
引用
收藏
页码:2841 / 2849
页数:9
相关论文
共 29 条
[1]  
[Anonymous], 2017, ARXIV
[2]  
[Anonymous], 2017, ABS170904875 CORR
[3]  
[Anonymous], 2009, P 3 WORKSH SOC NETW
[4]  
[Anonymous], ARXIV180408139
[5]  
[Anonymous], ARXIV12066417
[6]  
Box G.E.P., 1970, Time Series Analysis, Forecasting and Control, V65, P1509, DOI 10.1080/01621459.1970.10481180
[7]   Multitask learning [J].
Caruana, R .
MACHINE LEARNING, 1997, 28 (01) :41-75
[8]  
Cui, 2018, 32 AAAI C ART INT
[9]   Temporal Link Prediction Using Matrix and Tensor Factorizations [J].
Dunlavy, Daniel M. ;
Kolda, Tamara G. ;
Acar, Evrim .
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2011, 5 (02)
[10]   Greedy function approximation: A gradient boosting machine [J].
Friedman, JH .
ANNALS OF STATISTICS, 2001, 29 (05) :1189-1232