Multi-task based Sales Predictions for Online Promotions

被引:13
作者
Xin, Shen [1 ]
Ester, Martin [2 ]
Bu, Jiajun [1 ]
Yao, Chengwei [1 ]
Li, Zhao [3 ]
Zhou, Xun [1 ]
Ye, Yizhou [3 ]
Wang, Can [1 ]
机构
[1] Zhejiang Univ, Hangzhou, Zhejiang, Peoples R China
[2] Simon Fraser Univ, Burnaby, BC, Canada
[3] Alibaba Grp, Hangzhou, Zhejiang, Peoples R China
来源
PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19) | 2019年
基金
中国国家自然科学基金;
关键词
Multi-task learning; Sales prediction; Online promotion; Representation learning;
D O I
10.1145/3357384.3357823
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The e-commerce era is witnessing a rapid development of various annual online promotions, such as Black Friday, Cyber Monday, and Alibaba's 11.11, etc. Sales Predictions for Online Promotions (SPOP) are a set of sales related forecasts for the promotion day, including gross merchandise volume, sales volume, best selling products, etc. SPOP is highly important for e-commerce platforms to efficiently organize merchandise and maximize business values. However, sales patterns during the promotions are varied according to different scenarios, each model of which is designed with different features, static or dynamic, for one task in particular. Therefore, several models are proposed with part of features that are possibly beneficial to other tasks, which indicates the universal representation for the items needs to be learned across different promotion scenarios. To address this problem, this paper proposes aDeep ItemNetwork for Online Promotions (DINOP). In DINOP, we design a novel Target Users Controlled Gated Recurrent Unit (TUC-GRU) structure for dynamic features, and provide a new attention mechanism introducing static users profiles. In contrast to traditional prediction models, the network we proposed can effectively and efficiently learn universal item representation by incorporating users' properties as controllers. Furthermore, it can successfully discover the static and dynamic features guided by the multi-task learning, and is easily extended to other sales related prediction problems without retraining. Empirical results show that performance of DINOP in the real data set of Alibaba's Global Shopping Festival is superior to other state-of-the-arts practical methodologies in terms of the convergence rate and prediction accuracy.
引用
收藏
页码:2823 / 2831
页数:9
相关论文
共 39 条
[1]   Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions [J].
Adomavicius, G ;
Tuzhilin, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) :734-749
[2]  
Agarwal D, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P19
[3]  
Aggarwal C. C, 2016, Recommender Systems: The Textbook, V1, DOI DOI 10.1007/978-3-319-29659-3
[4]  
[Anonymous], 2010, ELECTRON J DIFF 0707
[5]   Multivariate GARCH models: A survey [J].
Bauwens, L ;
Laurent, S ;
Rombouts, JVK .
JOURNAL OF APPLIED ECONOMETRICS, 2006, 21 (01) :79-109
[6]   LiJAR: A System for Job Application Redistribution towards Efficient Career Marketplace [J].
Borisyuk, Fedor ;
Zhang, Liang ;
Kenthapadi, Krishnaram .
KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, :1397-1406
[7]  
Box G.E.P., 1970, Time Series Analysis, Forecasting and Control, V65, P1509, DOI 10.1080/01621459.1970.10481180
[8]  
Breese J. S., 1998, P 14 C UNCERTAINTY A, P43
[9]   Improving Collaborative Recommendation via User-Item Subgroups [J].
Bu, Jiajun ;
Shen, Xin ;
Xu, Bin ;
Chen, Chun ;
He, Xiaofei ;
Cai, Deng .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (09) :2363-2375
[10]   Multitask learning [J].
Caruana, R .
MACHINE LEARNING, 1997, 28 (01) :41-75