Journal of Computer Science and Technology ›› 2019, Vol. 34 ›› Issue (6): 1230-1240.doi: 10.1007/s11390-019-1972-2

• Data Management and Data Mining • Previous Articles     Next Articles

Modeling Temporal Dynamics of Users' Purchase Behaviors for Next Basket Prediction

Pengfei Wang1, Yongfeng Zhang2, Shuzi Niu3, Jiafeng Guo4, Member, CCF, ACM   

  1. 1 School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2 Department of Computer Science, Rutgers University, New Jersey 07450, U.S.A.;
    3 Institute of Software, Chinese Academy of Sciences, Beijing 100190, China;
    4 Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China
  • Received:2018-11-30 Revised:2019-09-10 Online:2019-11-16 Published:2019-11-16
  • About author:Pengfei Wang received his B.S. degree in software engineering from the Xidian University, Xi'an, in 2008, his M.S. degree in software engineering from the Beihang University, Beijing, in 2011, and his Ph.D. degree in computer software theory from the Institute of Computing Technology, Chinese Academic of Sciences, Beijing, in 2017. He joined the Beijing University of Posts and Telecommunications, Beijing, as a lecturer in 2017. His research interests include data mining, machine learning, and recommendation. He has published more than 10 papers in refereed journals and conferences.
  • Supported by:
    This research work was supported by the National Natural Science Foundation of China under Grant Nos. 61802029, and 61602451, and the Fundamental Research for the Central Universities of China under Grant No. 500419741.

Next basket prediction attempts to provide sequential recommendations to users based on a sequence of the user's previous purchases. Ideally, a good prediction model should be able to explore the personalized preference of the users, as well as the sequential relations of the items. This goal of modeling becomes even more challenging when both factors are time-dependent. However, existing methods either take these two aspects as static, or only consider temporal dynamics for one of the two aspects. In this work, we propose the dynamic representation learning approach for time-dependent next basket recommendation, which jointly models the dynamic nature of user preferences and item relations. To do so, we explicitly model the transaction timestamps, as well as the dynamic representations of both users and items, so as to capture the personalized user preference on each individual item dynamically. Experiments on three real-world retail datasets show that our method significantly outperforms several state-of-the-art methods for next basket recommendation.

Key words: sequential recommendation, dynamic representation, next basket recommendation

[1] Zimdars A, Chickering D M, Meek C. Using temporal data for making recommendations. In Proc. the 17th Conference on Uncertainty in Artificial Intelligence, August 2001, pp.580-588.
[2] Chen S, Moore J L, Turnbull D, Joachims T. Playlist prediction via metric embedding. In Proc. the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2012, pp.714-722.
[3] Mobasher B, Dai H H, Luo T, Nakagawa M. Using sequential and non-sequential patterns in predictive web usage mining tasks. In Proc. the 2002 IEEE International Conference on Data Mining, December 2002, pp.669-672.
[4] Karatzoglou A, Amatriain X, Baltrunas L, Oliver N. Multiverse recommendation:N-dimensional tensor factorization for context-aware collaborative filtering. In Proc. the 4th ACM Conference on Recommender Systems, September 2012, pp.79-86.
[5] Su X Y, Khoshgoftaar T M. A survey of collaborative filtering techniques. Adv. in Artif. Intell., 2009, 2009:Article No. 421425.
[6] Rendle S, Freudenthaler C, Schmidt-Thieme L. Factorizing personalized Markov chains for next basket recommendation. In Proc. the 19th International Conference on World Wide Web, April 2010, pp.811-820.
[7] Wang P F, Guo J F, Lan Y Y. Modeling retail transaction data for personalized shopping recommendation. In Proc. the 23rd ACM International Conference on Information and Knowledge Management, November 2014, pp.1979-1982.
[8] Wang P F, Guo J F, Lan Y Y, Xu J, Wan S X, Cheng X Q. Learning hierarchical representation model for next basket recommendation. In Proc. the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, August 2015, pp.403-412.
[9] Wang J, Zhang Y. Opportunity model for e-commerce recommendation:Right product; right time. In Proc. the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval, August 2013, pp.303-312.
[10] Yu F, Liu Q, Wu S, Wang L, Tan T N. A dynamic recurrent model for next basket recommendation. In Proc. the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, July 2016, pp.729-732.
[11] Ahmed A, Low Y C, Aly M, Josifovski V, Smola A J. Scalable distributed inference of dynamic user interests for behavioral targeting. In Proc. the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2010, pp.114-122.
[12] Koren Y. Factorization meets the neighborhood:A multifaceted collaborative filtering model. In Proc. the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2008, pp.426-434.
[13] Xiang L, Yuan Q, Zhao S W, Chen L, Zhang X T, Yang Q, Sun J M. Temporal recommendation on graphs via longand short-term preference fusion. In Proc. the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 2010, pp.723-732.
[14] Yap G E, Li X L, Yu P S. Effective next-items recommendation via personalized sequential pattern mining. In Proc. the 17th International Conference on Database Systems for Advanced Applications, April 2012, pp.48-64.
[15] Yin H Z, Cui B, Chen L, Hu Z T, Huang Z. A temporal context-aware model for user behavior modeling in social media systems. In Proc. the 2014 ACM SIGMOD International Conference on Management of Data, June 2014, pp.1543-1554.
[16] He R N, Kang W C, McAuley J J. Translation-based recommendation. In Proc. the 11th ACM Conference on Recommender Systems, August 2017, pp.161-169.
[17] Pasricha R, McAuley J J. Translation-based factorization machines for sequential recommendation. In Proc. the 12th ACM Conference on Recommender Systems, October 2018, pp.63-71.
[18] Chen X, Xu H T, Zhang Y F, Tang J X, Cao Y X, Q Z, Zha H Y. Sequential recommendation with user memory networks. In Proc. the 11th ACM International Conference on Web Search and Data Mining, February 2018, pp.108-116.
[19] Huang J, Zhao W X, Dou H J, Wen J R, Chang E Y. Improving sequential Recommendation with knowledgeenhanced memory networks. In Proc. the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, July 2018, pp.505-514.
[20] Xiong L, Chen X, Huang T K et al. Temporal collaborative filtering with Bayesian probabilistic tensor factorization. In Proc. the 2010 SIAM International Conference on Data Mining, April 2010, pp.211-222.
[21] Zhang Y F, Zhang M, Zhang Y, Lai G K, Liu Y Q, Zhang H H, Ma S P. Daily-aware personalized recommendation based on feature-level time series analysis. In Proc. the 24th International Conference on World Wide Web, May 2015, pp.1373-1383.
[22] Lu Z D, Agarwal D, Dhillon I S. A spatio-temporal approach to collaborative filtering. In Proc. the 3rd ACM Conference on Recommender Systems, October 2009, pp.13-20.
[23] Mikolov T, Sutskever I, Chen K, Corrado G, Dean J. Distributed representations of words and phrases and their compositionality. In Proc. the 27th Annual Conference on Neural Information Processing Systems, December 2013, pp.3111-3119.
[24] Le Q V, Tomas M. Distributed representations of sentences and documents. In Proc. the 31st International Conference on Machine Learning, June 2014, pp.1188-1196.
[25] Lee D D, Seung H S. Algorithms for non-negative matrix factorization. In Proc. the 14th Conference on Neural Information Processing Systems, December 2001, pp.556-562.
[26] Järvelin K, Kekäläinen J. IR evaluation methods for retrieving highly relevant documents. In Proc. the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 2000, pp.41-48.
[27] Zhao G, Lee M L, Hsu W, Chen W. Increasing temporal diversity with purchase intervals. In Proc. the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, August 2012, pp.165-174.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] Jiu-Ru Gao, Wei Chen, Jia-Jie Xu, An Liu, Zhi-Xu Li, Hongzhi Yin, Lei Zhao. An Efficient Framework for Multiple Subgraph Pattern Matching Models[J]. Journal of Computer Science and Technology, 2019, 34(6): 1185 -1202 .

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved